./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:51:53,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:51:53,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:51:54,005 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:51:54,006 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:51:54,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:51:54,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:51:54,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:51:54,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:51:54,022 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:51:54,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:51:54,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:51:54,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:51:54,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:51:54,024 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:51:54,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:51:54,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:51:54,024 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:51:54,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:51:54,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:51:54,025 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:51:54,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:51:54,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:51:54,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:51:54,027 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:51:54,027 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:51:54,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:51:54,027 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:51:54,028 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:51:54,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:51:54,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:51:54,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:51:54,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:51:54,029 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:51:54,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:51:54,030 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:51:54,030 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:51:54,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:51:54,030 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:51:54,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:51:54,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:51:54,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:51:54,032 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-clean/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-clean/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 -> 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 [2024-10-11 02:51:54,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:51:54,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:51:54,252 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:51:54,253 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:51:54,253 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:51:54,254 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-10-11 02:51:55,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:51:55,884 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:51:55,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-10-11 02:51:55,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/956768bc0/4c88fd10866d4433bb8ce7ec5fb828c8/FLAG73afa60bd [2024-10-11 02:51:55,928 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/956768bc0/4c88fd10866d4433bb8ce7ec5fb828c8 [2024-10-11 02:51:55,931 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:51:55,933 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:51:55,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:51:55,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:51:55,939 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:51:55,940 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:55" (1/1) ... [2024-10-11 02:51:55,941 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f91412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:55, skipping insertion in model container [2024-10-11 02:51:55,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:51:55" (1/1) ... [2024-10-11 02:51:56,001 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:51:56,375 WARN L248 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_spec7_product13.cil.c[16810,16823] [2024-10-11 02:51:56,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:51:56,552 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:51:56,561 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2024-10-11 02:51:56,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [79] [2024-10-11 02:51:56,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [371] [2024-10-11 02:51:56,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [737] [2024-10-11 02:51:56,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [746] [2024-10-11 02:51:56,563 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [781] [2024-10-11 02:51:56,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1193] [2024-10-11 02:51:56,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1210] [2024-10-11 02:51:56,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1308] [2024-10-11 02:51:56,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2024-10-11 02:51:56,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2631] [2024-10-11 02:51:56,603 WARN L248 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_spec7_product13.cil.c[16810,16823] [2024-10-11 02:51:56,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:51:56,703 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:51:56,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56 WrapperNode [2024-10-11 02:51:56,704 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:51:56,705 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:51:56,705 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:51:56,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:51:56,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,736 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,829 INFO L138 Inliner]: procedures = 124, calls = 176, calls flagged for inlining = 54, calls inlined = 45, statements flattened = 851 [2024-10-11 02:51:56,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:51:56,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:51:56,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:51:56,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:51:56,878 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,883 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,921 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-10-11 02:51:56,922 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,922 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,943 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,964 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:56,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:51:56,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:51:57,001 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:51:57,001 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:51:57,003 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (1/1) ... [2024-10-11 02:51:57,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:51:57,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:57,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:51:57,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:51:57,121 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:51:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:51:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:51:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:51:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:51:57,122 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:51:57,122 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:51:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:51:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:51:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:51:57,123 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:51:57,123 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:51:57,124 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:51:57,124 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:51:57,125 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:51:57,125 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:51:57,125 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:51:57,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:51:57,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:51:57,292 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:51:57,294 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:51:57,994 INFO L? ?]: Removed 362 outVars from TransFormulas that were not future-live. [2024-10-11 02:51:57,998 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:51:58,058 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:51:58,059 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:51:58,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:58 BoogieIcfgContainer [2024-10-11 02:51:58,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:51:58,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:51:58,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:51:58,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:51:58,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:51:55" (1/3) ... [2024-10-11 02:51:58,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166abb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:58, skipping insertion in model container [2024-10-11 02:51:58,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:51:56" (2/3) ... [2024-10-11 02:51:58,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@166abb8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:51:58, skipping insertion in model container [2024-10-11 02:51:58,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:51:58" (3/3) ... [2024-10-11 02:51:58,068 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product13.cil.c [2024-10-11 02:51:58,082 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:51:58,083 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:51:58,152 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:51:58,158 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;@41f98160, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:51:58,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:51:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 242 states, 190 states have (on average 1.6210526315789473) internal successors, (308), 192 states have internal predecessors, (308), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-11 02:51:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-11 02:51:58,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:58,183 INFO L215 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] [2024-10-11 02:51:58,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:58,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:58,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2058146720, now seen corresponding path program 1 times [2024-10-11 02:51:58,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:58,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590297455] [2024-10-11 02:51:58,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:58,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:51:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:51:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:51:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:51:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:51:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:51:58,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:51:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:51:58,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:58,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590297455] [2024-10-11 02:51:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590297455] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263767389] [2024-10-11 02:51:58,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:58,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:58,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:58,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:51:58,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:51:59,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:51:59,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:51:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:51:59,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:51:59,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263767389] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:51:59,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:51:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-11 02:51:59,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007172446] [2024-10-11 02:51:59,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:51:59,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:51:59,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:51:59,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:51:59,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:51:59,263 INFO L87 Difference]: Start difference. First operand has 242 states, 190 states have (on average 1.6210526315789473) internal successors, (308), 192 states have internal predecessors, (308), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-10-11 02:51:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:51:59,356 INFO L93 Difference]: Finished difference Result 343 states and 526 transitions. [2024-10-11 02:51:59,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:51:59,362 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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 76 [2024-10-11 02:51:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:51:59,379 INFO L225 Difference]: With dead ends: 343 [2024-10-11 02:51:59,380 INFO L226 Difference]: Without dead ends: 239 [2024-10-11 02:51:59,384 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 93 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-10-11 02:51:59,389 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:51:59,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 364 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:51:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-11 02:51:59,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2024-10-11 02:51:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 188 states have (on average 1.601063829787234) internal successors, (301), 189 states have internal predecessors, (301), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 02:51:59,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 370 transitions. [2024-10-11 02:51:59,439 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 370 transitions. Word has length 76 [2024-10-11 02:51:59,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:51:59,440 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 370 transitions. [2024-10-11 02:51:59,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 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-10-11 02:51:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 370 transitions. [2024-10-11 02:51:59,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-11 02:51:59,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:51:59,443 INFO L215 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] [2024-10-11 02:51:59,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 02:51:59,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:51:59,645 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:51:59,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:51:59,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1362980545, now seen corresponding path program 1 times [2024-10-11 02:51:59,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:51:59,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675578193] [2024-10-11 02:51:59,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:59,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:51:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:51:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:51:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:51:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:51:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:51:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:51:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:51:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:51:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:51:59,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:51:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:51:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:51:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:51:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675578193] [2024-10-11 02:51:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675578193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:51:59,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210655763] [2024-10-11 02:51:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:51:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:51:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:51:59,861 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:51:59,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:52:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:52:00,119 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:00,151 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:52:00,152 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:52:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210655763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:00,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:52:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:52:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126089689] [2024-10-11 02:52:00,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:00,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:52:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:52:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:52:00,157 INFO L87 Difference]: Start difference. First operand 239 states and 370 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 02:52:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:00,243 INFO L93 Difference]: Finished difference Result 339 states and 513 transitions. [2024-10-11 02:52:00,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:52:00,244 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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 77 [2024-10-11 02:52:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:00,246 INFO L225 Difference]: With dead ends: 339 [2024-10-11 02:52:00,249 INFO L226 Difference]: Without dead ends: 241 [2024-10-11 02:52:00,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:52:00,251 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 0 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:00,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 721 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:52:00,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-10-11 02:52:00,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2024-10-11 02:52:00,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 190 states have (on average 1.5947368421052632) internal successors, (303), 191 states have internal predecessors, (303), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 02:52:00,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 372 transitions. [2024-10-11 02:52:00,274 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 372 transitions. Word has length 77 [2024-10-11 02:52:00,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:00,274 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 372 transitions. [2024-10-11 02:52:00,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-10-11 02:52:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 372 transitions. [2024-10-11 02:52:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-11 02:52:00,280 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:00,280 INFO L215 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] [2024-10-11 02:52:00,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:52:00,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:00,482 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:00,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:00,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2057876358, now seen corresponding path program 1 times [2024-10-11 02:52:00,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:00,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520806993] [2024-10-11 02:52:00,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:00,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:52:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:52:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:52:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:52:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:52:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:52:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:52:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,698 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:52:00,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520806993] [2024-10-11 02:52:00,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520806993] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:52:00,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183967963] [2024-10-11 02:52:00,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:00,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:00,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:00,705 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:52:00,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:52:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:00,921 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:52:00,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:00,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:52:00,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:52:00,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183967963] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:00,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:52:00,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:52:00,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083968502] [2024-10-11 02:52:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:00,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:52:00,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:00,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:52:00,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:52:00,944 INFO L87 Difference]: Start difference. First operand 241 states and 372 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 02:52:00,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:00,976 INFO L93 Difference]: Finished difference Result 508 states and 796 transitions. [2024-10-11 02:52:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:52:00,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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 82 [2024-10-11 02:52:00,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:00,979 INFO L225 Difference]: With dead ends: 508 [2024-10-11 02:52:00,979 INFO L226 Difference]: Without dead ends: 289 [2024-10-11 02:52:00,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:52:00,987 INFO L432 NwaCegarLoop]: 374 mSDtfsCounter, 95 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:00,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 691 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:52:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-10-11 02:52:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 284. [2024-10-11 02:52:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 222 states have (on average 1.6036036036036037) internal successors, (356), 223 states have internal predecessors, (356), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-11 02:52:01,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 447 transitions. [2024-10-11 02:52:01,018 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 447 transitions. Word has length 82 [2024-10-11 02:52:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:01,018 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 447 transitions. [2024-10-11 02:52:01,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 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-10-11 02:52:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 447 transitions. [2024-10-11 02:52:01,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:52:01,024 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:01,025 INFO L215 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] [2024-10-11 02:52:01,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 02:52:01,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:01,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:01,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:01,228 INFO L85 PathProgramCache]: Analyzing trace with hash -904675323, now seen corresponding path program 1 times [2024-10-11 02:52:01,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:01,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082286980] [2024-10-11 02:52:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:01,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:52:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:52:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:52:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:52:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:52:01,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:52:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:52:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,422 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:52:01,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:01,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082286980] [2024-10-11 02:52:01,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082286980] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:52:01,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370267338] [2024-10-11 02:52:01,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:01,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:01,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:01,425 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:52:01,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:52:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:01,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:52:01,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:01,733 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:52:01,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:52:01,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370267338] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:01,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:52:01,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 02:52:01,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571753706] [2024-10-11 02:52:01,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:01,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:52:01,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:01,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:52:01,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:52:01,736 INFO L87 Difference]: Start difference. First operand 284 states and 447 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-10-11 02:52:01,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:01,811 INFO L93 Difference]: Finished difference Result 563 states and 888 transitions. [2024-10-11 02:52:01,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:52:01,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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 83 [2024-10-11 02:52:01,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:01,815 INFO L225 Difference]: With dead ends: 563 [2024-10-11 02:52:01,816 INFO L226 Difference]: Without dead ends: 286 [2024-10-11 02:52:01,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 97 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-10-11 02:52:01,818 INFO L432 NwaCegarLoop]: 353 mSDtfsCounter, 2 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:01,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1401 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:52:01,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-10-11 02:52:01,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2024-10-11 02:52:01,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 223 states have (on average 1.600896860986547) internal successors, (357), 225 states have internal predecessors, (357), 46 states have call successors, (46), 15 states have call predecessors, (46), 16 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2024-10-11 02:52:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 450 transitions. [2024-10-11 02:52:01,834 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 450 transitions. Word has length 83 [2024-10-11 02:52:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:01,834 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 450 transitions. [2024-10-11 02:52:01,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 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-10-11 02:52:01,834 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 450 transitions. [2024-10-11 02:52:01,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:52:01,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:01,836 INFO L215 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] [2024-10-11 02:52:01,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:52:02,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:02,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:02,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1546862210, now seen corresponding path program 1 times [2024-10-11 02:52:02,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:02,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308428896] [2024-10-11 02:52:02,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:02,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:02,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:52:02,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:52:02,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:52:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:52:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:52:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:52:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:52:02,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308428896] [2024-10-11 02:52:02,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308428896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:52:02,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698078908] [2024-10-11 02:52:02,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:02,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:02,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:02,250 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:52:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:52:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:52:02,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:52:02,493 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:52:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698078908] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:52:02,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 02:52:02,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81131713] [2024-10-11 02:52:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:52:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:02,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:52:02,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:52:02,495 INFO L87 Difference]: Start difference. First operand 286 states and 450 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-10-11 02:52:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:02,564 INFO L93 Difference]: Finished difference Result 565 states and 893 transitions. [2024-10-11 02:52:02,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:52:02,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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 84 [2024-10-11 02:52:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:02,570 INFO L225 Difference]: With dead ends: 565 [2024-10-11 02:52:02,570 INFO L226 Difference]: Without dead ends: 288 [2024-10-11 02:52:02,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 97 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-10-11 02:52:02,571 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 2 mSDsluCounter, 1036 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:02,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1387 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:52:02,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-10-11 02:52:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-10-11 02:52:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5982142857142858) internal successors, (358), 227 states have internal predecessors, (358), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 02:52:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 456 transitions. [2024-10-11 02:52:02,590 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 456 transitions. Word has length 84 [2024-10-11 02:52:02,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:02,590 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 456 transitions. [2024-10-11 02:52:02,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 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-10-11 02:52:02,591 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 456 transitions. [2024-10-11 02:52:02,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 02:52:02,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:02,592 INFO L215 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] [2024-10-11 02:52:02,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:52:02,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:02,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:02,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:02,794 INFO L85 PathProgramCache]: Analyzing trace with hash 200934642, now seen corresponding path program 1 times [2024-10-11 02:52:02,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:02,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657180064] [2024-10-11 02:52:02,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:02,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:02,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:02,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:02,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:52:02,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:52:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:52:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:52:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:52:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:52:02,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:02,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657180064] [2024-10-11 02:52:02,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657180064] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:02,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:02,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:52:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248993688] [2024-10-11 02:52:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:52:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:02,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:52:02,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:52:02,990 INFO L87 Difference]: Start difference. First operand 288 states and 456 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 02:52:04,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:04,194 INFO L93 Difference]: Finished difference Result 611 states and 976 transitions. [2024-10-11 02:52:04,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:52:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 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 85 [2024-10-11 02:52:04,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:04,198 INFO L225 Difference]: With dead ends: 611 [2024-10-11 02:52:04,198 INFO L226 Difference]: Without dead ends: 342 [2024-10-11 02:52:04,199 INFO L431 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-10-11 02:52:04,200 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 578 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:04,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 817 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:52:04,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-11 02:52:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2024-10-11 02:52:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 224 states have (on average 1.5982142857142858) internal successors, (358), 227 states have internal predecessors, (358), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2024-10-11 02:52:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 455 transitions. [2024-10-11 02:52:04,239 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 455 transitions. Word has length 85 [2024-10-11 02:52:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:04,240 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 455 transitions. [2024-10-11 02:52:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 5 states have internal predecessors, (52), 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-10-11 02:52:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 455 transitions. [2024-10-11 02:52:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-11 02:52:04,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:04,242 INFO L215 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] [2024-10-11 02:52:04,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:52:04,242 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:04,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash 562323533, now seen corresponding path program 2 times [2024-10-11 02:52:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068012362] [2024-10-11 02:52:04,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:52:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:52:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:52:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:52:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:52:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:04,419 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:52:04,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:04,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068012362] [2024-10-11 02:52:04,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068012362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:04,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:04,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:52:04,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222089233] [2024-10-11 02:52:04,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:04,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:52:04,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:04,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:52:04,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:52:04,422 INFO L87 Difference]: Start difference. First operand 288 states and 455 transitions. Second operand has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-10-11 02:52:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:05,658 INFO L93 Difference]: Finished difference Result 613 states and 979 transitions. [2024-10-11 02:52:05,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:52:05,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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 86 [2024-10-11 02:52:05,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:05,661 INFO L225 Difference]: With dead ends: 613 [2024-10-11 02:52:05,662 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 02:52:05,663 INFO L431 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-10-11 02:52:05,664 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 575 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:05,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 816 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:52:05,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 02:52:05,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-11 02:52:05,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-10-11 02:52:05,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 458 transitions. [2024-10-11 02:52:05,685 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 458 transitions. Word has length 86 [2024-10-11 02:52:05,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:05,686 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 458 transitions. [2024-10-11 02:52:05,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.571428571428571) internal successors, (53), 5 states have internal predecessors, (53), 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-10-11 02:52:05,686 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 458 transitions. [2024-10-11 02:52:05,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:52:05,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:05,688 INFO L215 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] [2024-10-11 02:52:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:52:05,688 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash -560741095, now seen corresponding path program 1 times [2024-10-11 02:52:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546867877] [2024-10-11 02:52:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:52:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:52:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:52:05,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:52:05,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:05,841 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:52:05,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546867877] [2024-10-11 02:52:05,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546867877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:05,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:05,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:52:05,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393436976] [2024-10-11 02:52:05,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:05,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:52:05,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:05,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:52:05,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:52:05,844 INFO L87 Difference]: Start difference. First operand 290 states and 458 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 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-10-11 02:52:07,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:07,075 INFO L93 Difference]: Finished difference Result 613 states and 978 transitions. [2024-10-11 02:52:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:52:07,076 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 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 87 [2024-10-11 02:52:07,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:07,079 INFO L225 Difference]: With dead ends: 613 [2024-10-11 02:52:07,080 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 02:52:07,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:52:07,081 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 576 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1497 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:07,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 813 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1497 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:52:07,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 02:52:07,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-11 02:52:07,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-10-11 02:52:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 458 transitions. [2024-10-11 02:52:07,102 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 458 transitions. Word has length 87 [2024-10-11 02:52:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:07,104 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 458 transitions. [2024-10-11 02:52:07,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 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-10-11 02:52:07,104 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 458 transitions. [2024-10-11 02:52:07,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-11 02:52:07,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:07,106 INFO L215 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] [2024-10-11 02:52:07,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:52:07,106 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:07,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:07,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1947526505, now seen corresponding path program 1 times [2024-10-11 02:52:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358246096] [2024-10-11 02:52:07,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:07,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:52:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:52:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:52:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:52:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:52:07,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:07,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358246096] [2024-10-11 02:52:07,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358246096] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:07,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:07,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:52:07,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648103316] [2024-10-11 02:52:07,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:07,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:52:07,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:07,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:52:07,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:52:07,271 INFO L87 Difference]: Start difference. First operand 290 states and 458 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 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-10-11 02:52:08,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:08,750 INFO L93 Difference]: Finished difference Result 611 states and 973 transitions. [2024-10-11 02:52:08,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:52:08,751 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 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 87 [2024-10-11 02:52:08,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:08,753 INFO L225 Difference]: With dead ends: 611 [2024-10-11 02:52:08,753 INFO L226 Difference]: Without dead ends: 344 [2024-10-11 02:52:08,754 INFO L431 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-10-11 02:52:08,755 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 578 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2529 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:08,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 1173 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2529 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:52:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-11 02:52:08,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 290. [2024-10-11 02:52:08,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 225 states have (on average 1.5955555555555556) internal successors, (359), 229 states have internal predecessors, (359), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-10-11 02:52:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 457 transitions. [2024-10-11 02:52:08,775 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 457 transitions. Word has length 87 [2024-10-11 02:52:08,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:08,776 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 457 transitions. [2024-10-11 02:52:08,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 8 states have internal predecessors, (57), 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-10-11 02:52:08,776 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 457 transitions. [2024-10-11 02:52:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 02:52:08,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:08,777 INFO L215 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] [2024-10-11 02:52:08,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:52:08,778 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:08,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:08,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1160114641, now seen corresponding path program 2 times [2024-10-11 02:52:08,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:08,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071452110] [2024-10-11 02:52:08,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:08,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:52:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:52:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:52:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:52:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:08,960 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:52:08,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:08,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071452110] [2024-10-11 02:52:08,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071452110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:08,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:08,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:52:08,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702784513] [2024-10-11 02:52:08,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:08,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:52:08,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:08,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:52:08,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:52:08,962 INFO L87 Difference]: Start difference. First operand 290 states and 457 transitions. Second operand has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 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-10-11 02:52:10,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:10,723 INFO L93 Difference]: Finished difference Result 613 states and 979 transitions. [2024-10-11 02:52:10,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:52:10,726 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 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 88 [2024-10-11 02:52:10,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:10,729 INFO L225 Difference]: With dead ends: 613 [2024-10-11 02:52:10,729 INFO L226 Difference]: Without dead ends: 346 [2024-10-11 02:52:10,730 INFO L431 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-10-11 02:52:10,731 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 575 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:10,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [576 Valid, 1174 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-11 02:52:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-10-11 02:52:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 292. [2024-10-11 02:52:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 226 states have (on average 1.592920353982301) internal successors, (360), 231 states have internal predecessors, (360), 46 states have call successors, (46), 15 states have call predecessors, (46), 19 states have return successors, (57), 45 states have call predecessors, (57), 45 states have call successors, (57) [2024-10-11 02:52:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 463 transitions. [2024-10-11 02:52:10,750 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 463 transitions. Word has length 88 [2024-10-11 02:52:10,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:10,750 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 463 transitions. [2024-10-11 02:52:10,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 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-10-11 02:52:10,751 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 463 transitions. [2024-10-11 02:52:10,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:52:10,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:10,752 INFO L215 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] [2024-10-11 02:52:10,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 02:52:10,752 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:10,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1326054436, now seen corresponding path program 1 times [2024-10-11 02:52:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:10,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423496527] [2024-10-11 02:52:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:10,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:10,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:52:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:52:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:52:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:52:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:10,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423496527] [2024-10-11 02:52:10,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423496527] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:52:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163234063] [2024-10-11 02:52:10,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:10,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:52:10,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:52:10,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:52:10,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:52:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:11,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:52:11,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:52:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:11,185 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:52:11,293 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:11,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163234063] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:52:11,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:52:11,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-11 02:52:11,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591049127] [2024-10-11 02:52:11,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:52:11,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:52:11,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:11,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:52:11,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:52:11,296 INFO L87 Difference]: Start difference. First operand 292 states and 463 transitions. Second operand has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 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-10-11 02:52:12,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:12,327 INFO L93 Difference]: Finished difference Result 754 states and 1264 transitions. [2024-10-11 02:52:12,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:52:12,328 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 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 89 [2024-10-11 02:52:12,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:12,331 INFO L225 Difference]: With dead ends: 754 [2024-10-11 02:52:12,331 INFO L226 Difference]: Without dead ends: 656 [2024-10-11 02:52:12,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 195 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-10-11 02:52:12,332 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 936 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 975 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:12,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 975 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [252 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:52:12,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2024-10-11 02:52:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 587. [2024-10-11 02:52:12,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 587 states, 457 states have (on average 1.6411378555798688) internal successors, (750), 462 states have internal predecessors, (750), 110 states have call successors, (110), 15 states have call predecessors, (110), 19 states have return successors, (131), 109 states have call predecessors, (131), 109 states have call successors, (131) [2024-10-11 02:52:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 991 transitions. [2024-10-11 02:52:12,359 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 991 transitions. Word has length 89 [2024-10-11 02:52:12,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:12,360 INFO L471 AbstractCegarLoop]: Abstraction has 587 states and 991 transitions. [2024-10-11 02:52:12,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.6) internal successors, (76), 7 states have internal predecessors, (76), 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-10-11 02:52:12,360 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 991 transitions. [2024-10-11 02:52:12,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:52:12,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:12,362 INFO L215 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] [2024-10-11 02:52:12,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:52:12,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 02:52:12,563 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:12,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:12,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1557790087, now seen corresponding path program 1 times [2024-10-11 02:52:12,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:12,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031166721] [2024-10-11 02:52:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:12,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:52:12,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:52:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:52:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:52:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:12,632 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031166721] [2024-10-11 02:52:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031166721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:12,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:12,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799621684] [2024-10-11 02:52:12,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:12,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:12,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:12,634 INFO L87 Difference]: Start difference. First operand 587 states and 991 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-11 02:52:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:13,430 INFO L93 Difference]: Finished difference Result 1465 states and 2533 transitions. [2024-10-11 02:52:13,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 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 95 [2024-10-11 02:52:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:13,436 INFO L225 Difference]: With dead ends: 1465 [2024-10-11 02:52:13,436 INFO L226 Difference]: Without dead ends: 938 [2024-10-11 02:52:13,438 INFO L431 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-10-11 02:52:13,438 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 667 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:13,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 613 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:52:13,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2024-10-11 02:52:13,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 879. [2024-10-11 02:52:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 685 states have (on average 1.6452554744525547) internal successors, (1127), 690 states have internal predecessors, (1127), 174 states have call successors, (174), 15 states have call predecessors, (174), 19 states have return successors, (205), 173 states have call predecessors, (205), 173 states have call successors, (205) [2024-10-11 02:52:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1506 transitions. [2024-10-11 02:52:13,475 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1506 transitions. Word has length 95 [2024-10-11 02:52:13,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:13,476 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1506 transitions. [2024-10-11 02:52:13,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 3 states have internal predecessors, (60), 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-10-11 02:52:13,476 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1506 transitions. [2024-10-11 02:52:13,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:52:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:13,479 INFO L215 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] [2024-10-11 02:52:13,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:52:13,479 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:13,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 578903811, now seen corresponding path program 1 times [2024-10-11 02:52:13,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:13,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839572497] [2024-10-11 02:52:13,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:13,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:13,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:52:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:52:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:52:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:52:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:13,582 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:13,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:13,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839572497] [2024-10-11 02:52:13,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839572497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:13,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:13,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:13,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576411970] [2024-10-11 02:52:13,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:13,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:13,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:13,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:13,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:13,584 INFO L87 Difference]: Start difference. First operand 879 states and 1506 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-10-11 02:52:14,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:14,327 INFO L93 Difference]: Finished difference Result 2162 states and 3760 transitions. [2024-10-11 02:52:14,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:14,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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 96 [2024-10-11 02:52:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:14,335 INFO L225 Difference]: With dead ends: 2162 [2024-10-11 02:52:14,335 INFO L226 Difference]: Without dead ends: 1393 [2024-10-11 02:52:14,339 INFO L431 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-10-11 02:52:14,340 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 665 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:14,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 575 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:52:14,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-11 02:52:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1334. [2024-10-11 02:52:14,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1334 states, 1045 states have (on average 1.64688995215311) internal successors, (1721), 1050 states have internal predecessors, (1721), 269 states have call successors, (269), 15 states have call predecessors, (269), 19 states have return successors, (300), 268 states have call predecessors, (300), 268 states have call successors, (300) [2024-10-11 02:52:14,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 2290 transitions. [2024-10-11 02:52:14,408 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 2290 transitions. Word has length 96 [2024-10-11 02:52:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:14,409 INFO L471 AbstractCegarLoop]: Abstraction has 1334 states and 2290 transitions. [2024-10-11 02:52:14,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 3 states have internal predecessors, (61), 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-10-11 02:52:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 2290 transitions. [2024-10-11 02:52:14,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 02:52:14,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:14,414 INFO L215 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] [2024-10-11 02:52:14,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:52:14,415 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:14,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:14,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1725367707, now seen corresponding path program 1 times [2024-10-11 02:52:14,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:14,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799105516] [2024-10-11 02:52:14,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:14,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:52:14,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:52:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:52:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:52:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:14,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:14,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799105516] [2024-10-11 02:52:14,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799105516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:14,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:14,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:14,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065617135] [2024-10-11 02:52:14,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:14,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:14,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:14,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:14,502 INFO L87 Difference]: Start difference. First operand 1334 states and 2290 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-10-11 02:52:15,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:15,263 INFO L93 Difference]: Finished difference Result 3180 states and 5572 transitions. [2024-10-11 02:52:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:15,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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 97 [2024-10-11 02:52:15,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:15,274 INFO L225 Difference]: With dead ends: 3180 [2024-10-11 02:52:15,274 INFO L226 Difference]: Without dead ends: 2076 [2024-10-11 02:52:15,279 INFO L431 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-10-11 02:52:15,279 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 663 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 678 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:15,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [678 Valid, 569 Invalid, 1006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:52:15,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2024-10-11 02:52:15,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2017. [2024-10-11 02:52:15,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 1605 states have (on average 1.649221183800623) internal successors, (2647), 1610 states have internal predecessors, (2647), 392 states have call successors, (392), 15 states have call predecessors, (392), 19 states have return successors, (439), 391 states have call predecessors, (439), 391 states have call successors, (439) [2024-10-11 02:52:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 3478 transitions. [2024-10-11 02:52:15,348 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 3478 transitions. Word has length 97 [2024-10-11 02:52:15,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:15,349 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 3478 transitions. [2024-10-11 02:52:15,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 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-10-11 02:52:15,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 3478 transitions. [2024-10-11 02:52:15,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-11 02:52:15,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:15,354 INFO L215 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] [2024-10-11 02:52:15,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:52:15,355 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:15,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -69701980, now seen corresponding path program 1 times [2024-10-11 02:52:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:15,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846494086] [2024-10-11 02:52:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:52:15,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:52:15,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:52:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:52:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:15,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846494086] [2024-10-11 02:52:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846494086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:15,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:15,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:15,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238019163] [2024-10-11 02:52:15,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:15,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:15,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:15,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:15,427 INFO L87 Difference]: Start difference. First operand 2017 states and 3478 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 02:52:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:16,349 INFO L93 Difference]: Finished difference Result 4750 states and 8377 transitions. [2024-10-11 02:52:16,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:16,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 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 98 [2024-10-11 02:52:16,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:16,371 INFO L225 Difference]: With dead ends: 4750 [2024-10-11 02:52:16,371 INFO L226 Difference]: Without dead ends: 3160 [2024-10-11 02:52:16,378 INFO L431 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-10-11 02:52:16,379 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 661 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:16,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 569 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:52:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3160 states. [2024-10-11 02:52:16,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3160 to 3101. [2024-10-11 02:52:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3101 states, 2510 states have (on average 1.650597609561753) internal successors, (4143), 2515 states have internal predecessors, (4143), 571 states have call successors, (571), 15 states have call predecessors, (571), 19 states have return successors, (644), 570 states have call predecessors, (644), 570 states have call successors, (644) [2024-10-11 02:52:16,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 5358 transitions. [2024-10-11 02:52:16,528 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 5358 transitions. Word has length 98 [2024-10-11 02:52:16,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:16,528 INFO L471 AbstractCegarLoop]: Abstraction has 3101 states and 5358 transitions. [2024-10-11 02:52:16,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 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-10-11 02:52:16,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 5358 transitions. [2024-10-11 02:52:16,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 02:52:16,534 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:16,535 INFO L215 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] [2024-10-11 02:52:16,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:52:16,535 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:16,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:16,535 INFO L85 PathProgramCache]: Analyzing trace with hash 489552599, now seen corresponding path program 1 times [2024-10-11 02:52:16,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869624668] [2024-10-11 02:52:16,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:52:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:52:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:52:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:52:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:16,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869624668] [2024-10-11 02:52:16,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869624668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:16,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270836944] [2024-10-11 02:52:16,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:16,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:16,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:16,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:16,647 INFO L87 Difference]: Start difference. First operand 3101 states and 5358 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 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-10-11 02:52:17,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:17,514 INFO L93 Difference]: Finished difference Result 7581 states and 13389 transitions. [2024-10-11 02:52:17,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:17,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 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 99 [2024-10-11 02:52:17,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:17,541 INFO L225 Difference]: With dead ends: 7581 [2024-10-11 02:52:17,541 INFO L226 Difference]: Without dead ends: 5130 [2024-10-11 02:52:17,552 INFO L431 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-10-11 02:52:17,553 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 659 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:17,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 605 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:52:17,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2024-10-11 02:52:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5071. [2024-10-11 02:52:17,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5071 states, 4104 states have (on average 1.6408382066276803) internal successors, (6734), 4109 states have internal predecessors, (6734), 947 states have call successors, (947), 15 states have call predecessors, (947), 19 states have return successors, (1064), 946 states have call predecessors, (1064), 946 states have call successors, (1064) [2024-10-11 02:52:17,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5071 states to 5071 states and 8745 transitions. [2024-10-11 02:52:17,837 INFO L78 Accepts]: Start accepts. Automaton has 5071 states and 8745 transitions. Word has length 99 [2024-10-11 02:52:17,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:17,838 INFO L471 AbstractCegarLoop]: Abstraction has 5071 states and 8745 transitions. [2024-10-11 02:52:17,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 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-10-11 02:52:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5071 states and 8745 transitions. [2024-10-11 02:52:17,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-10-11 02:52:17,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:17,848 INFO L215 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] [2024-10-11 02:52:17,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:52:17,848 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:17,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:17,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1074212200, now seen corresponding path program 1 times [2024-10-11 02:52:17,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:17,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819899601] [2024-10-11 02:52:17,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:17,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:17,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:17,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:52:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:52:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:52:17,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:52:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:17,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:17,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819899601] [2024-10-11 02:52:17,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819899601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:17,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:17,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:17,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627552011] [2024-10-11 02:52:17,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:17,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:17,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:17,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:17,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:17,929 INFO L87 Difference]: Start difference. First operand 5071 states and 8745 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 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-10-11 02:52:18,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:18,795 INFO L93 Difference]: Finished difference Result 12562 states and 22137 transitions. [2024-10-11 02:52:18,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 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 100 [2024-10-11 02:52:18,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:18,839 INFO L225 Difference]: With dead ends: 12562 [2024-10-11 02:52:18,839 INFO L226 Difference]: Without dead ends: 8507 [2024-10-11 02:52:18,854 INFO L431 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-10-11 02:52:18,855 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 657 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 672 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:18,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [672 Valid, 571 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:52:18,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8507 states. [2024-10-11 02:52:19,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8507 to 8448. [2024-10-11 02:52:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8448 states, 6875 states have (on average 1.6373818181818183) internal successors, (11257), 6880 states have internal predecessors, (11257), 1553 states have call successors, (1553), 15 states have call predecessors, (1553), 19 states have return successors, (1748), 1552 states have call predecessors, (1748), 1552 states have call successors, (1748) [2024-10-11 02:52:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8448 states to 8448 states and 14558 transitions. [2024-10-11 02:52:19,288 INFO L78 Accepts]: Start accepts. Automaton has 8448 states and 14558 transitions. Word has length 100 [2024-10-11 02:52:19,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:19,289 INFO L471 AbstractCegarLoop]: Abstraction has 8448 states and 14558 transitions. [2024-10-11 02:52:19,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 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-10-11 02:52:19,293 INFO L276 IsEmpty]: Start isEmpty. Operand 8448 states and 14558 transitions. [2024-10-11 02:52:19,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-10-11 02:52:19,310 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:19,310 INFO L215 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] [2024-10-11 02:52:19,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:52:19,310 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:19,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:19,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1101922343, now seen corresponding path program 1 times [2024-10-11 02:52:19,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:19,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138166021] [2024-10-11 02:52:19,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:19,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:52:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:52:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:52:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:52:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:19,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:19,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138166021] [2024-10-11 02:52:19,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138166021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:19,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:19,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:19,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002940007] [2024-10-11 02:52:19,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:19,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:19,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:19,438 INFO L87 Difference]: Start difference. First operand 8448 states and 14558 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-11 02:52:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:20,478 INFO L93 Difference]: Finished difference Result 21914 states and 38536 transitions. [2024-10-11 02:52:20,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:20,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 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 101 [2024-10-11 02:52:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:20,571 INFO L225 Difference]: With dead ends: 21914 [2024-10-11 02:52:20,574 INFO L226 Difference]: Without dead ends: 14891 [2024-10-11 02:52:20,601 INFO L431 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-10-11 02:52:20,603 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 655 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:20,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 602 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:52:20,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14891 states. [2024-10-11 02:52:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14891 to 14832. [2024-10-11 02:52:21,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14832 states, 12056 states have (on average 1.6269077637690776) internal successors, (19614), 12061 states have internal predecessors, (19614), 2756 states have call successors, (2756), 15 states have call predecessors, (2756), 19 states have return successors, (3095), 2755 states have call predecessors, (3095), 2755 states have call successors, (3095) [2024-10-11 02:52:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14832 states to 14832 states and 25465 transitions. [2024-10-11 02:52:21,362 INFO L78 Accepts]: Start accepts. Automaton has 14832 states and 25465 transitions. Word has length 101 [2024-10-11 02:52:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:21,363 INFO L471 AbstractCegarLoop]: Abstraction has 14832 states and 25465 transitions. [2024-10-11 02:52:21,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 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-10-11 02:52:21,364 INFO L276 IsEmpty]: Start isEmpty. Operand 14832 states and 25465 transitions. [2024-10-11 02:52:21,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:52:21,381 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:21,381 INFO L215 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] [2024-10-11 02:52:21,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:52:21,382 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:21,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:21,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1897214121, now seen corresponding path program 1 times [2024-10-11 02:52:21,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082107421] [2024-10-11 02:52:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:21,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:21,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:21,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:52:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:52:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:52:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:52:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:21,493 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:21,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:21,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082107421] [2024-10-11 02:52:21,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082107421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:21,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:21,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:21,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397231991] [2024-10-11 02:52:21,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:21,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:21,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:21,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:21,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:21,499 INFO L87 Difference]: Start difference. First operand 14832 states and 25465 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 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-10-11 02:52:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:23,237 INFO L93 Difference]: Finished difference Result 39273 states and 68922 transitions. [2024-10-11 02:52:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:23,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 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 102 [2024-10-11 02:52:23,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:23,352 INFO L225 Difference]: With dead ends: 39273 [2024-10-11 02:52:23,352 INFO L226 Difference]: Without dead ends: 26458 [2024-10-11 02:52:23,396 INFO L431 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-10-11 02:52:23,397 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 653 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:23,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 570 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:52:23,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26458 states. [2024-10-11 02:52:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26458 to 26399. [2024-10-11 02:52:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26399 states, 21584 states have (on average 1.6224518161601187) internal successors, (35019), 21589 states have internal predecessors, (35019), 4795 states have call successors, (4795), 15 states have call predecessors, (4795), 19 states have return successors, (5408), 4794 states have call predecessors, (5408), 4794 states have call successors, (5408) [2024-10-11 02:52:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26399 states to 26399 states and 45222 transitions. [2024-10-11 02:52:24,641 INFO L78 Accepts]: Start accepts. Automaton has 26399 states and 45222 transitions. Word has length 102 [2024-10-11 02:52:24,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:24,641 INFO L471 AbstractCegarLoop]: Abstraction has 26399 states and 45222 transitions. [2024-10-11 02:52:24,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 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-10-11 02:52:24,642 INFO L276 IsEmpty]: Start isEmpty. Operand 26399 states and 45222 transitions. [2024-10-11 02:52:24,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:52:24,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:24,656 INFO L215 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] [2024-10-11 02:52:24,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:52:24,657 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:24,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:24,657 INFO L85 PathProgramCache]: Analyzing trace with hash 619257147, now seen corresponding path program 1 times [2024-10-11 02:52:24,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:24,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116141595] [2024-10-11 02:52:24,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:24,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:52:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:52:24,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:52:24,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:52:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:24,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:24,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116141595] [2024-10-11 02:52:24,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116141595] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:24,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:24,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:24,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390182712] [2024-10-11 02:52:24,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:24,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:24,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:24,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:24,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:24,748 INFO L87 Difference]: Start difference. First operand 26399 states and 45222 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 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-10-11 02:52:27,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:27,281 INFO L93 Difference]: Finished difference Result 71885 states and 125346 transitions. [2024-10-11 02:52:27,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:27,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 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 103 [2024-10-11 02:52:27,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:27,512 INFO L225 Difference]: With dead ends: 71885 [2024-10-11 02:52:27,512 INFO L226 Difference]: Without dead ends: 48218 [2024-10-11 02:52:27,594 INFO L431 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-10-11 02:52:27,595 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 651 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:27,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 574 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:52:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48218 states. [2024-10-11 02:52:29,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48218 to 48159. [2024-10-11 02:52:29,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48159 states, 39629 states have (on average 1.616770546821772) internal successors, (64071), 39634 states have internal predecessors, (64071), 8510 states have call successors, (8510), 15 states have call predecessors, (8510), 19 states have return successors, (9655), 8509 states have call predecessors, (9655), 8509 states have call successors, (9655) [2024-10-11 02:52:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48159 states to 48159 states and 82236 transitions. [2024-10-11 02:52:29,582 INFO L78 Accepts]: Start accepts. Automaton has 48159 states and 82236 transitions. Word has length 103 [2024-10-11 02:52:29,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:29,582 INFO L471 AbstractCegarLoop]: Abstraction has 48159 states and 82236 transitions. [2024-10-11 02:52:29,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 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-10-11 02:52:29,582 INFO L276 IsEmpty]: Start isEmpty. Operand 48159 states and 82236 transitions. [2024-10-11 02:52:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:52:29,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:29,598 INFO L215 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] [2024-10-11 02:52:29,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:52:29,598 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:29,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:29,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1889739081, now seen corresponding path program 1 times [2024-10-11 02:52:29,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:29,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339693135] [2024-10-11 02:52:29,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:29,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:52:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:52:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:52:29,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:52:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:29,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:29,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339693135] [2024-10-11 02:52:29,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339693135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:29,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:29,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:52:29,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73331410] [2024-10-11 02:52:29,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:29,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:52:29,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:29,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:52:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:52:29,685 INFO L87 Difference]: Start difference. First operand 48159 states and 82236 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 02:52:32,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:32,531 INFO L93 Difference]: Finished difference Result 89604 states and 156710 transitions. [2024-10-11 02:52:32,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:52:32,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 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 104 [2024-10-11 02:52:32,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:32,859 INFO L225 Difference]: With dead ends: 89604 [2024-10-11 02:52:32,860 INFO L226 Difference]: Without dead ends: 89506 [2024-10-11 02:52:32,908 INFO L431 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-10-11 02:52:32,909 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 646 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:32,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 582 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 844 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:52:32,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89506 states. [2024-10-11 02:52:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89506 to 89447. [2024-10-11 02:52:36,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89447 states, 74118 states have (on average 1.6096090018618958) internal successors, (119301), 74123 states have internal predecessors, (119301), 15309 states have call successors, (15309), 15 states have call predecessors, (15309), 19 states have return successors, (17500), 15308 states have call predecessors, (17500), 15308 states have call successors, (17500) [2024-10-11 02:52:36,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89447 states to 89447 states and 152110 transitions. [2024-10-11 02:52:36,853 INFO L78 Accepts]: Start accepts. Automaton has 89447 states and 152110 transitions. Word has length 104 [2024-10-11 02:52:36,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:36,854 INFO L471 AbstractCegarLoop]: Abstraction has 89447 states and 152110 transitions. [2024-10-11 02:52:36,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 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-10-11 02:52:36,854 INFO L276 IsEmpty]: Start isEmpty. Operand 89447 states and 152110 transitions. [2024-10-11 02:52:36,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:52:36,878 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:52:36,878 INFO L215 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] [2024-10-11 02:52:36,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:52:36,878 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:52:36,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:52:36,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1249778310, now seen corresponding path program 1 times [2024-10-11 02:52:36,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:52:36,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147187997] [2024-10-11 02:52:36,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:52:36,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:52:36,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:52:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:52:36,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:52:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:52:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:52:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:52:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:52:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:52:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:37,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:52:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:52:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:52:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:52:37,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:52:37,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147187997] [2024-10-11 02:52:37,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147187997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:52:37,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:52:37,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:52:37,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137266969] [2024-10-11 02:52:37,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:52:37,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:52:37,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:52:37,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:52:37,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:52:37,018 INFO L87 Difference]: Start difference. First operand 89447 states and 152110 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 02:52:40,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:52:40,098 INFO L93 Difference]: Finished difference Result 89499 states and 155470 transitions. [2024-10-11 02:52:40,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:52:40,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 105 [2024-10-11 02:52:40,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:52:40,124 INFO L225 Difference]: With dead ends: 89499 [2024-10-11 02:52:40,125 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 02:52:40,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:52:40,293 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 568 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:52:40,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 825 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:52:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 02:52:40,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 02:52:40,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 02:52:40,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 02:52:40,321 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2024-10-11 02:52:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:52:40,322 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 02:52:40,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-10-11 02:52:40,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 02:52:40,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 02:52:40,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:52:40,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 02:52:40,328 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:52:40,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 02:52:46,871 WARN L286 SmtUtils]: Spent 6.44s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 02:52:52,289 WARN L286 SmtUtils]: Spent 5.41s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-10-11 02:52:57,414 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)