./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product28.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 459b394196a1606fd18d87736056d8c2e811f354c9c1071577c3ccd936910200 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:12:01,929 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:12:02,022 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:12:02,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:12:02,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:12:02,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:12:02,059 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:12:02,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:12:02,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:12:02,062 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:12:02,063 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:12:02,063 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:12:02,063 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:12:02,063 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:12:02,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:12:02,064 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:12:02,064 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:12:02,064 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:12:02,064 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:12:02,065 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:12:02,065 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:12:02,066 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:12:02,066 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:12:02,067 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:12:02,067 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:12:02,067 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:12:02,067 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:12:02,067 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:12:02,068 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:12:02,068 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:12:02,068 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:12:02,068 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:12:02,069 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:12:02,069 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:12:02,069 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:12:02,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:12:02,071 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:12:02,071 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 459b394196a1606fd18d87736056d8c2e811f354c9c1071577c3ccd936910200 [2024-11-09 23:12:02,283 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:12:02,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:12:02,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:12:02,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:12:02,308 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:12:02,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product28.cil.c [2024-11-09 23:12:03,635 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:12:03,888 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:12:03,890 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product28.cil.c [2024-11-09 23:12:03,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea1c86d8/113e3d7d917b45d0b175a3952ff03b66/FLAG5042eb1b2 [2024-11-09 23:12:03,923 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fea1c86d8/113e3d7d917b45d0b175a3952ff03b66 [2024-11-09 23:12:03,926 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:12:03,927 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:12:03,928 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:12:03,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:12:03,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:12:03,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:12:03" (1/1) ... [2024-11-09 23:12:03,939 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b533519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:03, skipping insertion in model container [2024-11-09 23:12:03,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:12:03" (1/1) ... [2024-11-09 23:12:03,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:12:04,395 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product28.cil.c[29342,29355] [2024-11-09 23:12:04,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:12:04,528 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:12:04,536 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-09 23:12:04,537 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [97] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [318] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [467] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [484] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [528] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [930] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1296] [2024-11-09 23:12:04,538 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1305] [2024-11-09 23:12:04,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1583] [2024-11-09 23:12:04,539 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1908] [2024-11-09 23:12:04,590 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product28.cil.c[29342,29355] [2024-11-09 23:12:04,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:12:04,654 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:12:04,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04 WrapperNode [2024-11-09 23:12:04,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:12:04,656 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:12:04,656 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:12:04,656 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:12:04,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,684 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,730 INFO L138 Inliner]: procedures = 129, calls = 199, calls flagged for inlining = 56, calls inlined = 46, statements flattened = 872 [2024-11-09 23:12:04,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:12:04,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:12:04,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:12:04,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:12:04,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,754 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,781 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-09 23:12:04,781 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,781 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,796 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,799 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,801 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,810 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:12:04,815 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:12:04,815 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:12:04,815 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:12:04,816 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (1/1) ... [2024-11-09 23:12:04,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:12:04,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:04,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:12:04,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:12:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-09 23:12:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-09 23:12:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-09 23:12:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-09 23:12:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-09 23:12:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-09 23:12:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:12:04,905 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:12:04,905 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:12:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:12:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 23:12:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 23:12:04,906 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:12:04,906 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:12:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-09 23:12:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-09 23:12:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 23:12:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 23:12:04,907 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:12:04,907 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:12:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:12:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 23:12:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-09 23:12:04,909 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-09 23:12:04,909 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:12:04,910 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:12:04,910 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:12:04,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:12:04,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:12:05,085 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:12:05,087 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:12:05,242 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2954-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2024-11-09 23:12:05,252 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L837: #res := ~retValue_acc~15; [2024-11-09 23:12:05,269 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1826: #res := ~retValue_acc~26; [2024-11-09 23:12:05,294 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2611: #res#1 := ~retValue_acc~38#1; [2024-11-09 23:12:05,294 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2566-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2024-11-09 23:12:05,311 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835: #res := ~retValue_acc~41; [2024-11-09 23:12:05,318 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2519: #res := ~retValue_acc~36; [2024-11-09 23:12:05,330 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L464-1: createEmail_#res#1 := createEmail_~retValue_acc~5#1; [2024-11-09 23:12:05,340 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L763: #res := ~retValue_acc~13; [2024-11-09 23:12:05,349 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L800: #res := ~retValue_acc~14; [2024-11-09 23:12:05,354 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L874: #res := ~retValue_acc~16; [2024-11-09 23:12:05,365 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L648: #res := ~retValue_acc~10; [2024-11-09 23:12:05,544 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2024-11-09 23:12:05,544 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2024-11-09 23:12:05,544 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2674-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2024-11-09 23:12:05,545 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1783-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~23#1; [2024-11-09 23:12:05,545 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1792-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~24#1; [2024-11-09 23:12:05,545 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1801-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~25#1; [2024-11-09 23:12:05,550 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: #res := ~retValue_acc~9; [2024-11-09 23:12:05,558 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L440: #res#1 := ~retValue_acc~3#1; [2024-11-09 23:12:05,558 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L420-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~2#1; [2024-11-09 23:12:05,685 INFO L? ?]: Removed 404 outVars from TransFormulas that were not future-live. [2024-11-09 23:12:05,686 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:12:05,700 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:12:05,701 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:12:05,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:12:05 BoogieIcfgContainer [2024-11-09 23:12:05,701 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:12:05,702 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:12:05,702 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:12:05,705 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:12:05,705 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:12:03" (1/3) ... [2024-11-09 23:12:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68198995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:12:05, skipping insertion in model container [2024-11-09 23:12:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:12:04" (2/3) ... [2024-11-09 23:12:05,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68198995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:12:05, skipping insertion in model container [2024-11-09 23:12:05,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:12:05" (3/3) ... [2024-11-09 23:12:05,708 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product28.cil.c [2024-11-09 23:12:05,722 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:12:05,723 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:12:05,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:12:05,797 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;@c5403c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:12:05,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:12:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand has 340 states, 266 states have (on average 1.5) internal successors, (399), 270 states have internal predecessors, (399), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-09 23:12:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 23:12:05,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:05,833 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:05,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1273044414, now seen corresponding path program 1 times [2024-11-09 23:12:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:05,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058808593] [2024-11-09 23:12:05,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:05,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:06,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:06,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:12:06,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 23:12:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:12:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 23:12:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:12:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,462 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:12:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058808593] [2024-11-09 23:12:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058808593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:06,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757963892] [2024-11-09 23:12:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:06,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:06,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:06,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:12:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:06,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:12:06,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:06,788 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:12:06,788 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:06,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757963892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:06,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:06,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-09 23:12:06,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152859419] [2024-11-09 23:12:06,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:12:06,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:06,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:12:06,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:12:06,819 INFO L87 Difference]: Start difference. First operand has 340 states, 266 states have (on average 1.5) internal successors, (399), 270 states have internal predecessors, (399), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:06,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:06,873 INFO L93 Difference]: Finished difference Result 520 states and 749 transitions. [2024-11-09 23:12:06,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:12:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-09 23:12:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:06,895 INFO L225 Difference]: With dead ends: 520 [2024-11-09 23:12:06,895 INFO L226 Difference]: Without dead ends: 332 [2024-11-09 23:12:06,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:12:06,905 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:06,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-09 23:12:06,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-11-09 23:12:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 259 states have (on average 1.494208494208494) internal successors, (387), 262 states have internal predecessors, (387), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-09 23:12:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 486 transitions. [2024-11-09 23:12:06,978 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 486 transitions. Word has length 99 [2024-11-09 23:12:06,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:06,982 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 486 transitions. [2024-11-09 23:12:06,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 486 transitions. [2024-11-09 23:12:06,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 23:12:06,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:06,986 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:07,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:12:07,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 23:12:07,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:07,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:07,189 INFO L85 PathProgramCache]: Analyzing trace with hash 398791144, now seen corresponding path program 1 times [2024-11-09 23:12:07,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:07,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899432866] [2024-11-09 23:12:07,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:07,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:07,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:07,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:07,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:12:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:12:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:12:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 23:12:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:12:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:12:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899432866] [2024-11-09 23:12:07,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899432866] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435237190] [2024-11-09 23:12:07,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:07,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:07,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:07,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:07,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:12:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:07,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:12:07,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:12:07,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:07,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435237190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:07,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:07,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 23:12:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896125085] [2024-11-09 23:12:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:07,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:12:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:12:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:07,650 INFO L87 Difference]: Start difference. First operand 332 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:07,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:07,694 INFO L93 Difference]: Finished difference Result 509 states and 729 transitions. [2024-11-09 23:12:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:12:07,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-11-09 23:12:07,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:07,697 INFO L225 Difference]: With dead ends: 509 [2024-11-09 23:12:07,697 INFO L226 Difference]: Without dead ends: 335 [2024-11-09 23:12:07,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 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-11-09 23:12:07,701 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:07,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:07,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-09 23:12:07,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2024-11-09 23:12:07,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 262 states have (on average 1.4885496183206106) internal successors, (390), 265 states have internal predecessors, (390), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-09 23:12:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 489 transitions. [2024-11-09 23:12:07,740 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 489 transitions. Word has length 101 [2024-11-09 23:12:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 489 transitions. [2024-11-09 23:12:07,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:07,740 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 489 transitions. [2024-11-09 23:12:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 23:12:07,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:07,743 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:07,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:12:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 23:12:07,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1166323386, now seen corresponding path program 1 times [2024-11-09 23:12:07,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518175698] [2024-11-09 23:12:07,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:07,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:08,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 23:12:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:12:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:12:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:12:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:12:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:12:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:12:08,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518175698] [2024-11-09 23:12:08,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518175698] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:08,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026248406] [2024-11-09 23:12:08,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:08,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:08,121 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:08,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:12:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:12:08,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:12:08,384 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:08,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026248406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:08,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:08,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-09 23:12:08,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051574142] [2024-11-09 23:12:08,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:12:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:08,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:12:08,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:12:08,386 INFO L87 Difference]: Start difference. First operand 335 states and 489 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:08,415 INFO L93 Difference]: Finished difference Result 704 states and 1038 transitions. [2024-11-09 23:12:08,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:12:08,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2024-11-09 23:12:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:08,420 INFO L225 Difference]: With dead ends: 704 [2024-11-09 23:12:08,420 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 23:12:08,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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-11-09 23:12:08,423 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 109 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:08,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 935 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:08,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 23:12:08,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 389. [2024-11-09 23:12:08,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 305 states have (on average 1.4885245901639343) internal successors, (454), 308 states have internal predecessors, (454), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-09 23:12:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 575 transitions. [2024-11-09 23:12:08,446 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 575 transitions. Word has length 108 [2024-11-09 23:12:08,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:08,447 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 575 transitions. [2024-11-09 23:12:08,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:08,448 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 575 transitions. [2024-11-09 23:12:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:12:08,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:08,450 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:08,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 23:12:08,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:08,655 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:08,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1817522847, now seen corresponding path program 1 times [2024-11-09 23:12:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411305971] [2024-11-09 23:12:08,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:08,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:12:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:12:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:12:08,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 23:12:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:12:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 23:12:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:12:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:12:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:12:08,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411305971] [2024-11-09 23:12:08,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411305971] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:08,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616754069] [2024-11-09 23:12:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:08,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:08,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:08,852 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:08,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:12:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,066 INFO L255 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:12:09,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:09,125 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:12:09,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:09,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616754069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:09,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:09,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-09 23:12:09,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805425668] [2024-11-09 23:12:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:12:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:09,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:12:09,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:12:09,128 INFO L87 Difference]: Start difference. First operand 389 states and 575 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:09,181 INFO L93 Difference]: Finished difference Result 769 states and 1140 transitions. [2024-11-09 23:12:09,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:12:09,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2024-11-09 23:12:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:09,185 INFO L225 Difference]: With dead ends: 769 [2024-11-09 23:12:09,185 INFO L226 Difference]: Without dead ends: 391 [2024-11-09 23:12:09,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:12:09,188 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:09,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-09 23:12:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-09 23:12:09,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 306 states have (on average 1.4869281045751634) internal successors, (455), 310 states have internal predecessors, (455), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-09 23:12:09,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions. [2024-11-09 23:12:09,210 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 109 [2024-11-09 23:12:09,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:09,210 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 578 transitions. [2024-11-09 23:12:09,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:09,211 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions. [2024-11-09 23:12:09,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 23:12:09,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:09,214 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:09,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:12:09,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:09,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:09,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:09,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1013226268, now seen corresponding path program 1 times [2024-11-09 23:12:09,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:09,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859879759] [2024-11-09 23:12:09,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:09,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:09,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:09,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:09,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:12:09,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:12:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 23:12:09,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:12:09,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:12:09,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:09,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:12:09,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:12:09,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,586 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:12:09,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859879759] [2024-11-09 23:12:09,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859879759] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:09,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060423165] [2024-11-09 23:12:09,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:09,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:09,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:09,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:09,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:12:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:09,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:12:09,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:12:09,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:12:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060423165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:09,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:12:09,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-09 23:12:09,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097446499] [2024-11-09 23:12:09,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:09,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:12:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:12:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:12:09,862 INFO L87 Difference]: Start difference. First operand 391 states and 578 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:09,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:09,908 INFO L93 Difference]: Finished difference Result 771 states and 1145 transitions. [2024-11-09 23:12:09,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:12:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2024-11-09 23:12:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:09,910 INFO L225 Difference]: With dead ends: 771 [2024-11-09 23:12:09,910 INFO L226 Difference]: Without dead ends: 393 [2024-11-09 23:12:09,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:12:09,912 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:09,912 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:12:09,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-09 23:12:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-09 23:12:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 307 states have (on average 1.485342019543974) internal successors, (456), 312 states have internal predecessors, (456), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-09 23:12:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 584 transitions. [2024-11-09 23:12:09,923 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 584 transitions. Word has length 110 [2024-11-09 23:12:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:09,923 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 584 transitions. [2024-11-09 23:12:09,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 584 transitions. [2024-11-09 23:12:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 23:12:09,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:09,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:09,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:12:10,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:10,127 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:10,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:10,127 INFO L85 PathProgramCache]: Analyzing trace with hash -2041876073, now seen corresponding path program 1 times [2024-11-09 23:12:10,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:10,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229752935] [2024-11-09 23:12:10,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:10,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:12:10,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:12:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:12:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:12:10,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:12:10,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:12:10,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:12:10,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:10,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229752935] [2024-11-09 23:12:10,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229752935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:10,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:10,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:12:10,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277137257] [2024-11-09 23:12:10,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:10,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:12:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:10,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:12:10,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:12:10,282 INFO L87 Difference]: Start difference. First operand 393 states and 584 transitions. Second operand has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:11,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:11,514 INFO L93 Difference]: Finished difference Result 836 states and 1249 transitions. [2024-11-09 23:12:11,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:11,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-09 23:12:11,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:11,517 INFO L225 Difference]: With dead ends: 836 [2024-11-09 23:12:11,517 INFO L226 Difference]: Without dead ends: 466 [2024-11-09 23:12:11,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:12:11,519 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 802 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1863 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:11,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 996 Invalid, 2109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1863 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:12:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-11-09 23:12:11,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 393. [2024-11-09 23:12:11,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 307 states have (on average 1.485342019543974) internal successors, (456), 312 states have internal predecessors, (456), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-09 23:12:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 583 transitions. [2024-11-09 23:12:11,540 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 583 transitions. Word has length 111 [2024-11-09 23:12:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:11,541 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 583 transitions. [2024-11-09 23:12:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.428571428571429) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 583 transitions. [2024-11-09 23:12:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-09 23:12:11,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:11,543 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:11,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:12:11,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:11,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:11,543 INFO L85 PathProgramCache]: Analyzing trace with hash 974772798, now seen corresponding path program 2 times [2024-11-09 23:12:11,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:11,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400091432] [2024-11-09 23:12:11,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:11,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:12:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:12:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:12:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:12:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:12:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:12:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:11,680 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:12:11,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:11,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400091432] [2024-11-09 23:12:11,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400091432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:11,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:11,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:12:11,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147618273] [2024-11-09 23:12:11,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:11,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:12:11,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:11,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:12:11,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:12:11,682 INFO L87 Difference]: Start difference. First operand 393 states and 583 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:12,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:12,818 INFO L93 Difference]: Finished difference Result 838 states and 1252 transitions. [2024-11-09 23:12:12,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:12:12,819 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-09 23:12:12,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:12,821 INFO L225 Difference]: With dead ends: 838 [2024-11-09 23:12:12,821 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 23:12:12,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:12:12,823 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 811 mSDsluCounter, 817 mSDsCounter, 0 mSdLazyCounter, 1845 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:12,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 996 Invalid, 2096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1845 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:12:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 23:12:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 395. [2024-11-09 23:12:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 308 states have (on average 1.4837662337662338) internal successors, (457), 314 states have internal predecessors, (457), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-09 23:12:12,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 586 transitions. [2024-11-09 23:12:12,844 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 586 transitions. Word has length 112 [2024-11-09 23:12:12,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:12,844 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 586 transitions. [2024-11-09 23:12:12,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 23:12:12,844 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 586 transitions. [2024-11-09 23:12:12,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-09 23:12:12,846 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:12,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:12,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:12:12,846 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:12,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:12,847 INFO L85 PathProgramCache]: Analyzing trace with hash -823893574, now seen corresponding path program 1 times [2024-11-09 23:12:12,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:12,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549793477] [2024-11-09 23:12:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:12:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-09 23:12:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:12,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:12:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:13,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:12:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:12:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:13,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:12:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:13,006 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:12:13,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:13,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549793477] [2024-11-09 23:12:13,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549793477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:13,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:13,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:12:13,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231662454] [2024-11-09 23:12:13,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:13,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:12:13,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:13,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:12:13,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:12:13,008 INFO L87 Difference]: Start difference. First operand 395 states and 586 transitions. Second operand has 11 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 23:12:14,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:14,568 INFO L93 Difference]: Finished difference Result 836 states and 1247 transitions. [2024-11-09 23:12:14,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:12:14,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 113 [2024-11-09 23:12:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:14,571 INFO L225 Difference]: With dead ends: 836 [2024-11-09 23:12:14,571 INFO L226 Difference]: Without dead ends: 468 [2024-11-09 23:12:14,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:12:14,573 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 798 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 3221 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 3462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:14,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 1429 Invalid, 3462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3221 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:12:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-09 23:12:14,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 395. [2024-11-09 23:12:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 308 states have (on average 1.4837662337662338) internal successors, (457), 314 states have internal predecessors, (457), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-09 23:12:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 585 transitions. [2024-11-09 23:12:14,590 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 585 transitions. Word has length 113 [2024-11-09 23:12:14,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:14,590 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 585 transitions. [2024-11-09 23:12:14,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.8) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 23:12:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 585 transitions. [2024-11-09 23:12:14,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-09 23:12:14,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:14,592 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:14,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:12:14,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:14,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:14,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1453052905, now seen corresponding path program 2 times [2024-11-09 23:12:14,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:14,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315520172] [2024-11-09 23:12:14,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:14,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:14,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:12:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:12:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:12:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:12:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:12:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:12:14,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:14,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315520172] [2024-11-09 23:12:14,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315520172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:14,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:14,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 23:12:14,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539239950] [2024-11-09 23:12:14,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:14,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:12:14,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:14,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:12:14,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:12:14,802 INFO L87 Difference]: Start difference. First operand 395 states and 585 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 23:12:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:16,337 INFO L93 Difference]: Finished difference Result 838 states and 1253 transitions. [2024-11-09 23:12:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:12:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 114 [2024-11-09 23:12:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:16,340 INFO L225 Difference]: With dead ends: 838 [2024-11-09 23:12:16,341 INFO L226 Difference]: Without dead ends: 470 [2024-11-09 23:12:16,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:12:16,342 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 805 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 3184 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 1430 SdHoareTripleChecker+Invalid, 3433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 3184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:16,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 1430 Invalid, 3433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 3184 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:12:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-09 23:12:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 397. [2024-11-09 23:12:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 309 states have (on average 1.4822006472491909) internal successors, (458), 316 states have internal predecessors, (458), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-09 23:12:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 591 transitions. [2024-11-09 23:12:16,368 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 591 transitions. Word has length 114 [2024-11-09 23:12:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:16,368 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 591 transitions. [2024-11-09 23:12:16,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 23:12:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 591 transitions. [2024-11-09 23:12:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 23:12:16,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:16,370 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:16,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:12:16,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -42731811, now seen corresponding path program 1 times [2024-11-09 23:12:16,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:16,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929752094] [2024-11-09 23:12:16,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:16,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:16,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:16,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:12:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 23:12:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:12:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:12:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,483 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:16,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:16,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929752094] [2024-11-09 23:12:16,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929752094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:12:16,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151636903] [2024-11-09 23:12:16,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:16,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:16,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:12:16,486 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:12:16,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:12:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:16,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 1010 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:12:16,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:12:16,739 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:16,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:12:16,803 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:16,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1151636903] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:12:16,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:12:16,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-09 23:12:16,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433845157] [2024-11-09 23:12:16,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:12:16,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:12:16,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:16,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:12:16,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:16,807 INFO L87 Difference]: Start difference. First operand 397 states and 591 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 23:12:17,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:17,822 INFO L93 Difference]: Finished difference Result 1022 states and 1581 transitions. [2024-11-09 23:12:17,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 23:12:17,822 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2024-11-09 23:12:17,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:17,826 INFO L225 Difference]: With dead ends: 1022 [2024-11-09 23:12:17,826 INFO L226 Difference]: Without dead ends: 848 [2024-11-09 23:12:17,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 23:12:17,828 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 1400 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 1194 mSolverCounterSat, 363 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1445 SdHoareTripleChecker+Valid, 1274 SdHoareTripleChecker+Invalid, 1557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 363 IncrementalHoareTripleChecker+Valid, 1194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:17,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1445 Valid, 1274 Invalid, 1557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [363 Valid, 1194 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:12:17,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2024-11-09 23:12:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 751. [2024-11-09 23:12:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 599 states have (on average 1.5141903171953255) internal successors, (907), 606 states have internal predecessors, (907), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-11-09 23:12:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1178 transitions. [2024-11-09 23:12:17,854 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1178 transitions. Word has length 115 [2024-11-09 23:12:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1178 transitions. [2024-11-09 23:12:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 23:12:17,855 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1178 transitions. [2024-11-09 23:12:17,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 23:12:17,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:17,857 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:17,875 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 23:12:18,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:12:18,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:18,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1828865424, now seen corresponding path program 1 times [2024-11-09 23:12:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:18,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130888906] [2024-11-09 23:12:18,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:18,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:12:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:12:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:12:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:12:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 23:12:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:18,138 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:18,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:18,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130888906] [2024-11-09 23:12:18,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130888906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:18,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:18,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:18,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680552783] [2024-11-09 23:12:18,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:18,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:18,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:18,140 INFO L87 Difference]: Start difference. First operand 751 states and 1178 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:18,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:18,990 INFO L93 Difference]: Finished difference Result 1865 states and 2982 transitions. [2024-11-09 23:12:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:18,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 129 [2024-11-09 23:12:18,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:18,997 INFO L225 Difference]: With dead ends: 1865 [2024-11-09 23:12:18,997 INFO L226 Difference]: Without dead ends: 1184 [2024-11-09 23:12:19,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:19,000 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 878 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 893 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:19,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [893 Valid, 762 Invalid, 1364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:12:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2024-11-09 23:12:19,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 1103. [2024-11-09 23:12:19,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 887 states have (on average 1.5152198421645997) internal successors, (1344), 894 states have internal predecessors, (1344), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-11-09 23:12:19,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1753 transitions. [2024-11-09 23:12:19,035 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1753 transitions. Word has length 129 [2024-11-09 23:12:19,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:19,035 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1753 transitions. [2024-11-09 23:12:19,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:19,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1753 transitions. [2024-11-09 23:12:19,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 23:12:19,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:19,039 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:19,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:12:19,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:19,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:19,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1660073285, now seen corresponding path program 1 times [2024-11-09 23:12:19,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:19,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311706894] [2024-11-09 23:12:19,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:19,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:12:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:12:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:12:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:12:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:12:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 23:12:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:19,120 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:19,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311706894] [2024-11-09 23:12:19,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311706894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:19,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:19,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:19,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845243913] [2024-11-09 23:12:19,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:19,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:19,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:19,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:19,122 INFO L87 Difference]: Start difference. First operand 1103 states and 1753 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:19,945 INFO L93 Difference]: Finished difference Result 2710 states and 4357 transitions. [2024-11-09 23:12:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:19,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2024-11-09 23:12:19,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:19,953 INFO L225 Difference]: With dead ends: 2710 [2024-11-09 23:12:19,953 INFO L226 Difference]: Without dead ends: 1736 [2024-11-09 23:12:19,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:19,956 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 909 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:19,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 728 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:12:19,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1736 states. [2024-11-09 23:12:19,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1736 to 1655. [2024-11-09 23:12:19,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1655 states, 1344 states have (on average 1.5141369047619047) internal successors, (2035), 1351 states have internal predecessors, (2035), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-11-09 23:12:20,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2634 transitions. [2024-11-09 23:12:20,005 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2634 transitions. Word has length 130 [2024-11-09 23:12:20,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:20,005 INFO L471 AbstractCegarLoop]: Abstraction has 1655 states and 2634 transitions. [2024-11-09 23:12:20,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2634 transitions. [2024-11-09 23:12:20,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 23:12:20,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:20,011 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:20,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:12:20,012 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:20,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:20,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1015730672, now seen corresponding path program 1 times [2024-11-09 23:12:20,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:20,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959085306] [2024-11-09 23:12:20,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:20,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:20,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:12:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:12:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:12:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:12:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:12:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:12:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959085306] [2024-11-09 23:12:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959085306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:20,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993075202] [2024-11-09 23:12:20,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:20,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:20,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:20,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:20,110 INFO L87 Difference]: Start difference. First operand 1655 states and 2634 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:20,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:20,934 INFO L93 Difference]: Finished difference Result 3964 states and 6405 transitions. [2024-11-09 23:12:20,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:20,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2024-11-09 23:12:20,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:20,945 INFO L225 Difference]: With dead ends: 3964 [2024-11-09 23:12:20,945 INFO L226 Difference]: Without dead ends: 2577 [2024-11-09 23:12:20,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:20,950 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 910 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 925 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:20,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [925 Valid, 697 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:12:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2024-11-09 23:12:21,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2496. [2024-11-09 23:12:21,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 2062 states have (on average 1.5126091173617846) internal successors, (3119), 2069 states have internal predecessors, (3119), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-11-09 23:12:21,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3980 transitions. [2024-11-09 23:12:21,026 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3980 transitions. Word has length 131 [2024-11-09 23:12:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:21,026 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3980 transitions. [2024-11-09 23:12:21,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3980 transitions. [2024-11-09 23:12:21,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-09 23:12:21,034 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:21,034 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:21,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:12:21,035 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:21,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:21,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2117684219, now seen corresponding path program 1 times [2024-11-09 23:12:21,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:21,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100503671] [2024-11-09 23:12:21,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:21,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:12:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:12:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:12:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:21,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:12:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:12:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:21,129 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:21,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:21,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100503671] [2024-11-09 23:12:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100503671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:21,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876129763] [2024-11-09 23:12:21,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:21,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:21,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:21,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:21,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:21,131 INFO L87 Difference]: Start difference. First operand 2496 states and 3980 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:21,998 INFO L93 Difference]: Finished difference Result 5925 states and 9601 transitions. [2024-11-09 23:12:21,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:21,999 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 132 [2024-11-09 23:12:21,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:22,016 INFO L225 Difference]: With dead ends: 5925 [2024-11-09 23:12:22,016 INFO L226 Difference]: Without dead ends: 3927 [2024-11-09 23:12:22,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:22,023 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 869 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:22,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 697 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:12:22,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3927 states. [2024-11-09 23:12:22,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3927 to 3846. [2024-11-09 23:12:22,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3846 states, 3233 states have (on average 1.5097432725023199) internal successors, (4881), 3240 states have internal predecessors, (4881), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-11-09 23:12:22,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3846 states to 3846 states and 6126 transitions. [2024-11-09 23:12:22,188 INFO L78 Accepts]: Start accepts. Automaton has 3846 states and 6126 transitions. Word has length 132 [2024-11-09 23:12:22,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:22,189 INFO L471 AbstractCegarLoop]: Abstraction has 3846 states and 6126 transitions. [2024-11-09 23:12:22,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3846 states and 6126 transitions. [2024-11-09 23:12:22,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 23:12:22,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:22,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:22,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:12:22,201 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:22,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:22,202 INFO L85 PathProgramCache]: Analyzing trace with hash -477825552, now seen corresponding path program 1 times [2024-11-09 23:12:22,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:22,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485937368] [2024-11-09 23:12:22,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:22,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:22,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:22,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:22,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:12:22,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:12:22,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:12:22,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:22,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:12:22,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:12:22,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485937368] [2024-11-09 23:12:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485937368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:22,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:22,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:22,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032392725] [2024-11-09 23:12:22,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:22,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:22,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:22,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:22,306 INFO L87 Difference]: Start difference. First operand 3846 states and 6126 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:23,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:23,175 INFO L93 Difference]: Finished difference Result 9438 states and 15295 transitions. [2024-11-09 23:12:23,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:23,176 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-11-09 23:12:23,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:23,201 INFO L225 Difference]: With dead ends: 9438 [2024-11-09 23:12:23,201 INFO L226 Difference]: Without dead ends: 6364 [2024-11-09 23:12:23,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:23,246 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 904 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:23,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 723 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:12:23,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6364 states. [2024-11-09 23:12:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6364 to 6283. [2024-11-09 23:12:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6283 states, 5294 states have (on average 1.499622213826974) internal successors, (7939), 5301 states have internal predecessors, (7939), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-11-09 23:12:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6283 states to 6283 states and 9980 transitions. [2024-11-09 23:12:23,419 INFO L78 Accepts]: Start accepts. Automaton has 6283 states and 9980 transitions. Word has length 133 [2024-11-09 23:12:23,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:23,420 INFO L471 AbstractCegarLoop]: Abstraction has 6283 states and 9980 transitions. [2024-11-09 23:12:23,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6283 states and 9980 transitions. [2024-11-09 23:12:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-09 23:12:23,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:23,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:12:23,433 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:23,433 INFO L85 PathProgramCache]: Analyzing trace with hash -65200645, now seen corresponding path program 1 times [2024-11-09 23:12:23,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014202164] [2024-11-09 23:12:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:23,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:23,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:12:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:12:23,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:12:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:12:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:12:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:12:23,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:23,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:23,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014202164] [2024-11-09 23:12:23,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014202164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:23,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:23,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:23,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343159526] [2024-11-09 23:12:23,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:23,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:23,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:23,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:23,510 INFO L87 Difference]: Start difference. First operand 6283 states and 9980 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:24,460 INFO L93 Difference]: Finished difference Result 15666 states and 25290 transitions. [2024-11-09 23:12:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2024-11-09 23:12:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:24,508 INFO L225 Difference]: With dead ends: 15666 [2024-11-09 23:12:24,508 INFO L226 Difference]: Without dead ends: 10594 [2024-11-09 23:12:24,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:24,523 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 863 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:24,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 727 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:12:24,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10594 states. [2024-11-09 23:12:24,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10594 to 10513. [2024-11-09 23:12:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10513 states, 8918 states have (on average 1.4930477685579726) internal successors, (13315), 8925 states have internal predecessors, (13315), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-11-09 23:12:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10513 states to 10513 states and 16646 transitions. [2024-11-09 23:12:24,851 INFO L78 Accepts]: Start accepts. Automaton has 10513 states and 16646 transitions. Word has length 134 [2024-11-09 23:12:24,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:24,851 INFO L471 AbstractCegarLoop]: Abstraction has 10513 states and 16646 transitions. [2024-11-09 23:12:24,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 10513 states and 16646 transitions. [2024-11-09 23:12:24,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-09 23:12:24,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:24,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:24,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:12:24,869 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:24,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:24,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1405363792, now seen corresponding path program 1 times [2024-11-09 23:12:24,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:24,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964137029] [2024-11-09 23:12:24,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:24,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:12:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:12:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:12:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:12:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:12:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:12:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:24,946 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:24,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:24,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964137029] [2024-11-09 23:12:24,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964137029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:24,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:24,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:24,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240312891] [2024-11-09 23:12:24,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:24,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:24,947 INFO L87 Difference]: Start difference. First operand 10513 states and 16646 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:26,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:26,166 INFO L93 Difference]: Finished difference Result 27380 states and 44051 transitions. [2024-11-09 23:12:26,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:26,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 135 [2024-11-09 23:12:26,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:26,213 INFO L225 Difference]: With dead ends: 27380 [2024-11-09 23:12:26,213 INFO L226 Difference]: Without dead ends: 18586 [2024-11-09 23:12:26,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:26,228 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 882 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:26,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [897 Valid, 729 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:12:26,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18586 states. [2024-11-09 23:12:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18586 to 18505. [2024-11-09 23:12:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18505 states, 15707 states have (on average 1.482141720252117) internal successors, (23280), 15714 states have internal predecessors, (23280), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-11-09 23:12:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18505 states to 18505 states and 29161 transitions. [2024-11-09 23:12:26,674 INFO L78 Accepts]: Start accepts. Automaton has 18505 states and 29161 transitions. Word has length 135 [2024-11-09 23:12:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:26,674 INFO L471 AbstractCegarLoop]: Abstraction has 18505 states and 29161 transitions. [2024-11-09 23:12:26,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 18505 states and 29161 transitions. [2024-11-09 23:12:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-09 23:12:26,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:26,698 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:26,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:12:26,698 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:26,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:26,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1722250235, now seen corresponding path program 1 times [2024-11-09 23:12:26,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:26,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066382475] [2024-11-09 23:12:26,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:26,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:26,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:26,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:12:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:12:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:12:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:12:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 23:12:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 23:12:26,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:26,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066382475] [2024-11-09 23:12:26,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066382475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:26,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:26,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:26,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44890709] [2024-11-09 23:12:26,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:26,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:26,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:26,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:26,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:26,778 INFO L87 Difference]: Start difference. First operand 18505 states and 29161 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:28,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:28,142 INFO L93 Difference]: Finished difference Result 49318 states and 79016 transitions. [2024-11-09 23:12:28,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:28,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2024-11-09 23:12:28,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:28,242 INFO L225 Difference]: With dead ends: 49318 [2024-11-09 23:12:28,242 INFO L226 Difference]: Without dead ends: 33253 [2024-11-09 23:12:28,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:28,279 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 883 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 898 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:28,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [898 Valid, 697 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 23:12:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33253 states. [2024-11-09 23:12:29,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33253 to 33172. [2024-11-09 23:12:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33172 states, 28335 states have (on average 1.4746779601199929) internal successors, (41785), 28342 states have internal predecessors, (41785), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-11-09 23:12:29,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33172 states to 33172 states and 52018 transitions. [2024-11-09 23:12:29,352 INFO L78 Accepts]: Start accepts. Automaton has 33172 states and 52018 transitions. Word has length 136 [2024-11-09 23:12:29,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:29,352 INFO L471 AbstractCegarLoop]: Abstraction has 33172 states and 52018 transitions. [2024-11-09 23:12:29,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:29,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33172 states and 52018 transitions. [2024-11-09 23:12:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-09 23:12:29,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:29,372 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:29,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:12:29,373 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:29,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:29,373 INFO L85 PathProgramCache]: Analyzing trace with hash -110483760, now seen corresponding path program 1 times [2024-11-09 23:12:29,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:29,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943399754] [2024-11-09 23:12:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:29,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:29,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:12:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:12:29,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:12:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:12:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 23:12:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 23:12:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:29,665 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:29,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:29,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943399754] [2024-11-09 23:12:29,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943399754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:29,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:29,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:29,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296803482] [2024-11-09 23:12:29,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:29,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:29,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:29,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:29,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:29,666 INFO L87 Difference]: Start difference. First operand 33172 states and 52018 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:31,851 INFO L93 Difference]: Finished difference Result 90932 states and 144442 transitions. [2024-11-09 23:12:31,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:31,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 137 [2024-11-09 23:12:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:32,049 INFO L225 Difference]: With dead ends: 90932 [2024-11-09 23:12:32,050 INFO L226 Difference]: Without dead ends: 61078 [2024-11-09 23:12:32,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:32,120 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 880 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:32,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 707 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:12:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61078 states. [2024-11-09 23:12:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61078 to 60997. [2024-11-09 23:12:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60997 states, 52445 states have (on average 1.4663361616932025) internal successors, (76902), 52452 states have internal predecessors, (76902), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-11-09 23:12:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60997 states to 60997 states and 95097 transitions. [2024-11-09 23:12:34,694 INFO L78 Accepts]: Start accepts. Automaton has 60997 states and 95097 transitions. Word has length 137 [2024-11-09 23:12:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:34,694 INFO L471 AbstractCegarLoop]: Abstraction has 60997 states and 95097 transitions. [2024-11-09 23:12:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 60997 states and 95097 transitions. [2024-11-09 23:12:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-09 23:12:34,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:34,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:34,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:12:34,720 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:34,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1107363227, now seen corresponding path program 1 times [2024-11-09 23:12:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:34,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891116188] [2024-11-09 23:12:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:34,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:34,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:12:34,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:12:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:12:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:12:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:12:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 23:12:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:34,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:34,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891116188] [2024-11-09 23:12:34,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891116188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:34,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:34,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:34,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921551951] [2024-11-09 23:12:34,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:34,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:34,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:34,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:34,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:34,807 INFO L87 Difference]: Start difference. First operand 60997 states and 95097 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:37,428 INFO L93 Difference]: Finished difference Result 114511 states and 181666 transitions. [2024-11-09 23:12:37,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:37,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 138 [2024-11-09 23:12:37,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:37,787 INFO L225 Difference]: With dead ends: 114511 [2024-11-09 23:12:37,787 INFO L226 Difference]: Without dead ends: 114337 [2024-11-09 23:12:37,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:37,813 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 848 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 1330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:37,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 723 Invalid, 1330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:12:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114337 states. [2024-11-09 23:12:40,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114337 to 114256. [2024-11-09 23:12:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114256 states, 98905 states have (on average 1.456983974521005) internal successors, (144103), 98912 states have internal predecessors, (144103), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-09 23:12:41,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114256 states to 114256 states and 176942 transitions. [2024-11-09 23:12:41,428 INFO L78 Accepts]: Start accepts. Automaton has 114256 states and 176942 transitions. Word has length 138 [2024-11-09 23:12:41,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 114256 states and 176942 transitions. [2024-11-09 23:12:41,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:41,429 INFO L276 IsEmpty]: Start isEmpty. Operand 114256 states and 176942 transitions. [2024-11-09 23:12:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 23:12:41,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:41,451 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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-11-09 23:12:41,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:12:41,451 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:41,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1746201342, now seen corresponding path program 2 times [2024-11-09 23:12:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126044135] [2024-11-09 23:12:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:12:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:12:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:41,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:12:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:12:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 23:12:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:41,542 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 23:12:41,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:41,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126044135] [2024-11-09 23:12:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126044135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 23:12:41,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759273541] [2024-11-09 23:12:41,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:41,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 23:12:41,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:41,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 23:12:41,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 23:12:41,545 INFO L87 Difference]: Start difference. First operand 114256 states and 176942 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:45,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:45,161 INFO L93 Difference]: Finished difference Result 223167 states and 349129 transitions. [2024-11-09 23:12:45,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 23:12:45,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2024-11-09 23:12:45,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:45,599 INFO L225 Difference]: With dead ends: 223167 [2024-11-09 23:12:45,599 INFO L226 Difference]: Without dead ends: 114337 [2024-11-09 23:12:45,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:12:45,780 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 903 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 1057 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1122 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:45,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1122 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1057 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:12:45,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114337 states. [2024-11-09 23:12:49,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114337 to 114256. [2024-11-09 23:12:49,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114256 states, 98905 states have (on average 1.446509276578535) internal successors, (143067), 98912 states have internal predecessors, (143067), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-09 23:12:49,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114256 states to 114256 states and 175906 transitions. [2024-11-09 23:12:49,852 INFO L78 Accepts]: Start accepts. Automaton has 114256 states and 175906 transitions. Word has length 139 [2024-11-09 23:12:49,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:12:49,852 INFO L471 AbstractCegarLoop]: Abstraction has 114256 states and 175906 transitions. [2024-11-09 23:12:49,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 23:12:49,852 INFO L276 IsEmpty]: Start isEmpty. Operand 114256 states and 175906 transitions. [2024-11-09 23:12:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 23:12:49,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:12:49,877 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:12:49,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:12:49,877 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:12:49,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:12:49,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1069296816, now seen corresponding path program 1 times [2024-11-09 23:12:49,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:12:49,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072149010] [2024-11-09 23:12:49,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:12:49,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:12:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:12:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:12:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:12:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:12:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:12:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:12:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:12:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:12:50,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:12:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:12:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:12:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 23:12:50,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:12:50,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:12:50,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:12:50,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072149010] [2024-11-09 23:12:50,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072149010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:12:50,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:12:50,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 23:12:50,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857224863] [2024-11-09 23:12:50,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:12:50,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:12:50,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:12:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:12:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:12:50,210 INFO L87 Difference]: Start difference. First operand 114256 states and 175906 transitions. Second operand has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 11 states have internal predecessors, (100), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 23:12:57,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:12:57,838 INFO L93 Difference]: Finished difference Result 228056 states and 363115 transitions. [2024-11-09 23:12:57,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 23:12:57,840 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 11 states have internal predecessors, (100), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 139 [2024-11-09 23:12:57,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:12:58,651 INFO L225 Difference]: With dead ends: 228056 [2024-11-09 23:12:58,651 INFO L226 Difference]: Without dead ends: 227890 [2024-11-09 23:12:58,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 529 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 23:12:58,738 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 3616 mSDsluCounter, 2422 mSDsCounter, 0 mSdLazyCounter, 6193 mSolverCounterSat, 1166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3616 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 7359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1166 IncrementalHoareTripleChecker+Valid, 6193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:12:58,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3616 Valid, 2657 Invalid, 7359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1166 Valid, 6193 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-09 23:12:58,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227890 states. [2024-11-09 23:13:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227890 to 227524. [2024-11-09 23:13:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227524 states, 197015 states have (on average 1.4473974062888613) internal successors, (285159), 196919 states have internal predecessors, (285159), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-11-09 23:13:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227524 states to 227524 states and 353696 transitions. [2024-11-09 23:13:07,195 INFO L78 Accepts]: Start accepts. Automaton has 227524 states and 353696 transitions. Word has length 139 [2024-11-09 23:13:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:07,196 INFO L471 AbstractCegarLoop]: Abstraction has 227524 states and 353696 transitions. [2024-11-09 23:13:07,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.666666666666667) internal successors, (100), 11 states have internal predecessors, (100), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-09 23:13:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 227524 states and 353696 transitions. [2024-11-09 23:13:07,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 23:13:07,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:07,238 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:07,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:13:07,239 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:07,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:07,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1397289690, now seen corresponding path program 1 times [2024-11-09 23:13:07,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:07,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851094057] [2024-11-09 23:13:07,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:07,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:07,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:13:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:13:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:13:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:13:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:13:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 23:13:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,425 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:07,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:07,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851094057] [2024-11-09 23:13:07,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851094057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:07,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:07,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 23:13:07,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990661537] [2024-11-09 23:13:07,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:07,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 23:13:07,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:07,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 23:13:07,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 23:13:07,428 INFO L87 Difference]: Start difference. First operand 227524 states and 353696 transitions. Second operand has 8 states, 8 states have (on average 12.625) internal successors, (101), 5 states have internal predecessors, (101), 2 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)