./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product16.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product16.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 8953ac6143780bf628ca2bf650b2a5c9b00061ee3dd80e32fadc01758229df18 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:38:51,008 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:38:51,090 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:38:51,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:38:51,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:38:51,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:38:51,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:38:51,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:38:51,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:38:51,135 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:38:51,135 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:38:51,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:38:51,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:38:51,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:38:51,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:38:51,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:38:51,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:38:51,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:38:51,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:38:51,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:38:51,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:38:51,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:38:51,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:38:51,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:38:51,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:38:51,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:38:51,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:38:51,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:38:51,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:38:51,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:38:51,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:38:51,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:38:51,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:51,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:38:51,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:38:51,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:38:51,150 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:38:51,151 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:38:51,151 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:38:51,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:38:51,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:38:51,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:38:51,152 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 -> 8953ac6143780bf628ca2bf650b2a5c9b00061ee3dd80e32fadc01758229df18 [2024-11-11 20:38:51,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:38:51,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:38:51,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:38:51,425 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:38:51,426 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:38:51,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product16.cil.c [2024-11-11 20:38:53,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:38:53,320 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:38:53,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product16.cil.c [2024-11-11 20:38:53,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2a36704/ef6413f5714b4b7caf6d9c2d82f8288b/FLAGfa5c2aecb [2024-11-11 20:38:53,361 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7d2a36704/ef6413f5714b4b7caf6d9c2d82f8288b [2024-11-11 20:38:53,363 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:38:53,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:38:53,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:53,366 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:38:53,372 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:38:53,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:53" (1/1) ... [2024-11-11 20:38:53,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2885c836 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:53, skipping insertion in model container [2024-11-11 20:38:53,375 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:53" (1/1) ... [2024-11-11 20:38:53,447 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:38:53,849 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product16.cil.c[36116,36129] [2024-11-11 20:38:54,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:54,040 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:38:54,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2024-11-11 20:38:54,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [66] [2024-11-11 20:38:54,052 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [478] [2024-11-11 20:38:54,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [527] [2024-11-11 20:38:54,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1607] [2024-11-11 20:38:54,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1616] [2024-11-11 20:38:54,053 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1982] [2024-11-11 20:38:54,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2207] [2024-11-11 20:38:54,054 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2236] [2024-11-11 20:38:54,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2517] [2024-11-11 20:38:54,055 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2622] [2024-11-11 20:38:54,106 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product16.cil.c[36116,36129] [2024-11-11 20:38:54,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:54,183 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:38:54,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54 WrapperNode [2024-11-11 20:38:54,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:54,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:54,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:38:54,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:38:54,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,225 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,290 INFO L138 Inliner]: procedures = 125, calls = 182, calls flagged for inlining = 56, calls inlined = 51, statements flattened = 989 [2024-11-11 20:38:54,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:54,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:38:54,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:38:54,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:38:54,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,319 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,356 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-11 20:38:54,356 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,356 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,374 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,409 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:38:54,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:38:54,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:38:54,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:38:54,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (1/1) ... [2024-11-11 20:38:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:54,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:54,458 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:38:54,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:38:54,508 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:38:54,508 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:38:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:38:54,509 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:38:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:38:54,509 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:38:54,509 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:38:54,510 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:38:54,510 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:38:54,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:38:54,511 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:38:54,512 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:38:54,512 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:38:54,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:38:54,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:38:54,513 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:38:54,514 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:38:54,515 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:38:54,515 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:38:54,515 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:38:54,515 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:38:54,516 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:38:54,516 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:38:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:38:54,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:38:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:38:54,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:38:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:38:54,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:38:54,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:38:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:38:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:38:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:38:54,518 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:38:54,519 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:38:54,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:38:54,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:38:54,751 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:38:54,754 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:38:55,586 INFO L? ?]: Removed 414 outVars from TransFormulas that were not future-live. [2024-11-11 20:38:55,586 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:38:55,608 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:38:55,608 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:38:55,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:55 BoogieIcfgContainer [2024-11-11 20:38:55,609 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:38:55,611 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:38:55,611 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:38:55,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:38:55,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:38:53" (1/3) ... [2024-11-11 20:38:55,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a344c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:55, skipping insertion in model container [2024-11-11 20:38:55,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:54" (2/3) ... [2024-11-11 20:38:55,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73a344c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:55, skipping insertion in model container [2024-11-11 20:38:55,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:55" (3/3) ... [2024-11-11 20:38:55,618 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product16.cil.c [2024-11-11 20:38:55,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:38:55,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:38:55,697 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:38:55,704 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;@58041b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:38:55,704 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:38:55,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 298 states, 235 states have (on average 1.5361702127659576) internal successors, (361), 239 states have internal predecessors, (361), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-11 20:38:55,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-11 20:38:55,724 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:55,724 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:55,725 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:55,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:55,730 INFO L85 PathProgramCache]: Analyzing trace with hash 56806197, now seen corresponding path program 1 times [2024-11-11 20:38:55,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:55,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079325346] [2024-11-11 20:38:55,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:55,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:56,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:56,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:56,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:38:56,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:38:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:38:56,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:38:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:38:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,526 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:38:56,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:56,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079325346] [2024-11-11 20:38:56,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079325346] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:56,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176508559] [2024-11-11 20:38:56,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:56,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:56,531 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:56,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:38:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:38:56,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:56,877 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:56,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176508559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:56,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:56,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:38:56,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813318898] [2024-11-11 20:38:56,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:38:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:56,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:38:56,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:56,925 INFO L87 Difference]: Start difference. First operand has 298 states, 235 states have (on average 1.5361702127659576) internal successors, (361), 239 states have internal predecessors, (361), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:56,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:56,990 INFO L93 Difference]: Finished difference Result 442 states and 656 transitions. [2024-11-11 20:38:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:38:56,996 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-11-11 20:38:56,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:57,019 INFO L225 Difference]: With dead ends: 442 [2024-11-11 20:38:57,019 INFO L226 Difference]: Without dead ends: 291 [2024-11-11 20:38:57,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:57,033 INFO L435 NwaCegarLoop]: 447 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, 447 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:57,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-11 20:38:57,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-11 20:38:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.5283842794759825) internal successors, (350), 232 states have internal predecessors, (350), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-11 20:38:57,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 439 transitions. [2024-11-11 20:38:57,100 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 439 transitions. Word has length 89 [2024-11-11 20:38:57,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:57,101 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 439 transitions. [2024-11-11 20:38:57,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:57,102 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 439 transitions. [2024-11-11 20:38:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-11 20:38:57,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:57,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:57,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:57,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:38:57,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:57,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:57,308 INFO L85 PathProgramCache]: Analyzing trace with hash -774067971, now seen corresponding path program 1 times [2024-11-11 20:38:57,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:57,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614423177] [2024-11-11 20:38:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:57,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:57,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:38:57,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:38:57,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:38:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:38:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:38:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:38:57,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:57,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614423177] [2024-11-11 20:38:57,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614423177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:57,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139382125] [2024-11-11 20:38:57,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:57,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:57,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:57,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:57,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:38:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:57,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:38:57,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:57,984 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:57,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139382125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:57,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:57,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:38:57,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828840599] [2024-11-11 20:38:57,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:57,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:38:57,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:57,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:38:57,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:57,992 INFO L87 Difference]: Start difference. First operand 291 states and 439 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:58,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:58,039 INFO L93 Difference]: Finished difference Result 432 states and 637 transitions. [2024-11-11 20:38:58,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:38:58,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-11 20:38:58,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:58,044 INFO L225 Difference]: With dead ends: 432 [2024-11-11 20:38:58,044 INFO L226 Difference]: Without dead ends: 294 [2024-11-11 20:38:58,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:58,048 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:58,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 872 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-11 20:38:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2024-11-11 20:38:58,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 231 states have (on average 1.5238095238095237) internal successors, (352), 234 states have internal predecessors, (352), 45 states have call successors, (45), 16 states have call predecessors, (45), 16 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-11 20:38:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 441 transitions. [2024-11-11 20:38:58,072 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 441 transitions. Word has length 90 [2024-11-11 20:38:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:58,073 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 441 transitions. [2024-11-11 20:38:58,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:58,073 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 441 transitions. [2024-11-11 20:38:58,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:38:58,076 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:58,076 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:58,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:58,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:38:58,278 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:58,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:58,278 INFO L85 PathProgramCache]: Analyzing trace with hash 232109862, now seen corresponding path program 1 times [2024-11-11 20:38:58,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:58,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975280753] [2024-11-11 20:38:58,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:58,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:38:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:38:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:38:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:38:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:38:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:58,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:58,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975280753] [2024-11-11 20:38:58,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975280753] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:58,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033288624] [2024-11-11 20:38:58,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:58,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:58,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:58,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:58,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:38:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 925 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:38:58,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:58,837 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:58,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033288624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:58,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:58,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:38:58,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017561949] [2024-11-11 20:38:58,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:58,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:38:58,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:58,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:38:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:58,840 INFO L87 Difference]: Start difference. First operand 293 states and 441 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:58,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:58,887 INFO L93 Difference]: Finished difference Result 616 states and 941 transitions. [2024-11-11 20:38:58,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:38:58,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2024-11-11 20:38:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:58,895 INFO L225 Difference]: With dead ends: 616 [2024-11-11 20:38:58,896 INFO L226 Difference]: Without dead ends: 350 [2024-11-11 20:38:58,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:58,898 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 107 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:58,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 860 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:58,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-11 20:38:58,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 342. [2024-11-11 20:38:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 269 states have (on average 1.5390334572490707) internal successors, (414), 272 states have internal predecessors, (414), 56 states have call successors, (56), 16 states have call predecessors, (56), 16 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2024-11-11 20:38:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 525 transitions. [2024-11-11 20:38:58,931 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 525 transitions. Word has length 96 [2024-11-11 20:38:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:58,931 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 525 transitions. [2024-11-11 20:38:58,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:38:58,933 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 525 transitions. [2024-11-11 20:38:58,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 20:38:58,935 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:58,935 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:58,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:38:59,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:59,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:59,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1191161156, now seen corresponding path program 1 times [2024-11-11 20:38:59,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:59,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510743581] [2024-11-11 20:38:59,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:38:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:38:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:38:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:38:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:59,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510743581] [2024-11-11 20:38:59,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510743581] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:59,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779448019] [2024-11-11 20:38:59,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:59,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:59,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:59,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:59,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:38:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:59,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:38:59,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:38:59,750 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779448019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:59,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:59,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:38:59,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674663744] [2024-11-11 20:38:59,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:38:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:59,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:38:59,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:38:59,752 INFO L87 Difference]: Start difference. First operand 342 states and 525 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:38:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:59,825 INFO L93 Difference]: Finished difference Result 675 states and 1040 transitions. [2024-11-11 20:38:59,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:38:59,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 97 [2024-11-11 20:38:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:59,830 INFO L225 Difference]: With dead ends: 675 [2024-11-11 20:38:59,830 INFO L226 Difference]: Without dead ends: 344 [2024-11-11 20:38:59,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:38:59,834 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 2 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1713 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:59,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1713 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-11 20:38:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2024-11-11 20:38:59,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.537037037037037) internal successors, (415), 274 states have internal predecessors, (415), 56 states have call successors, (56), 16 states have call predecessors, (56), 17 states have return successors, (57), 55 states have call predecessors, (57), 55 states have call successors, (57) [2024-11-11 20:38:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 528 transitions. [2024-11-11 20:38:59,861 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 528 transitions. Word has length 97 [2024-11-11 20:38:59,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:59,861 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 528 transitions. [2024-11-11 20:38:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:38:59,861 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 528 transitions. [2024-11-11 20:38:59,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:38:59,863 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:59,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:59,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:39:00,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:00,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:00,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:00,065 INFO L85 PathProgramCache]: Analyzing trace with hash 77511015, now seen corresponding path program 1 times [2024-11-11 20:39:00,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:00,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432445113] [2024-11-11 20:39:00,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:00,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:39:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:39:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:39:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:39:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:39:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:39:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:00,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432445113] [2024-11-11 20:39:00,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432445113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:00,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324260155] [2024-11-11 20:39:00,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:00,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:00,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:00,350 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:39:00,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:39:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 931 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:39:00,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:39:00,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:39:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324260155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:00,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:39:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:39:00,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787325245] [2024-11-11 20:39:00,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:39:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:00,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:39:00,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:39:00,686 INFO L87 Difference]: Start difference. First operand 344 states and 528 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:00,764 INFO L93 Difference]: Finished difference Result 677 states and 1045 transitions. [2024-11-11 20:39:00,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:39:00,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 98 [2024-11-11 20:39:00,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:00,768 INFO L225 Difference]: With dead ends: 677 [2024-11-11 20:39:00,768 INFO L226 Difference]: Without dead ends: 346 [2024-11-11 20:39:00,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:39:00,771 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 2 mSDsluCounter, 1270 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1699 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-11 20:39:00,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1699 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:39:00,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2024-11-11 20:39:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2024-11-11 20:39:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 276 states have internal predecessors, (416), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-11-11 20:39:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 534 transitions. [2024-11-11 20:39:00,798 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 534 transitions. Word has length 98 [2024-11-11 20:39:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 534 transitions. [2024-11-11 20:39:00,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 534 transitions. [2024-11-11 20:39:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:39:00,802 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:00,802 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:00,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:01,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:01,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:01,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:01,004 INFO L85 PathProgramCache]: Analyzing trace with hash -807330812, now seen corresponding path program 1 times [2024-11-11 20:39:01,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:01,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429835815] [2024-11-11 20:39:01,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:01,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:39:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:39:01,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:39:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:39:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:01,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,227 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:01,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429835815] [2024-11-11 20:39:01,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429835815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:01,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:01,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:39:01,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82916965] [2024-11-11 20:39:01,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:01,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:39:01,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:01,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:39:01,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:01,230 INFO L87 Difference]: Start difference. First operand 346 states and 534 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:03,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:03,260 INFO L93 Difference]: Finished difference Result 816 states and 1258 transitions. [2024-11-11 20:39:03,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:39:03,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 99 [2024-11-11 20:39:03,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:03,267 INFO L225 Difference]: With dead ends: 816 [2024-11-11 20:39:03,267 INFO L226 Difference]: Without dead ends: 493 [2024-11-11 20:39:03,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:39:03,272 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 910 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:03,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1108 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:39:03,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-11 20:39:03,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 346. [2024-11-11 20:39:03,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 276 states have internal predecessors, (416), 56 states have call successors, (56), 16 states have call predecessors, (56), 18 states have return successors, (61), 55 states have call predecessors, (61), 55 states have call successors, (61) [2024-11-11 20:39:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 533 transitions. [2024-11-11 20:39:03,314 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 533 transitions. Word has length 99 [2024-11-11 20:39:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:03,314 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 533 transitions. [2024-11-11 20:39:03,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 533 transitions. [2024-11-11 20:39:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:39:03,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:03,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:03,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:39:03,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:03,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:03,317 INFO L85 PathProgramCache]: Analyzing trace with hash -805719347, now seen corresponding path program 2 times [2024-11-11 20:39:03,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:03,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872418100] [2024-11-11 20:39:03,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:03,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:39:03,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:39:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:39:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:39:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:39:03,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:03,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872418100] [2024-11-11 20:39:03,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872418100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:03,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:03,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:39:03,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834327774] [2024-11-11 20:39:03,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:03,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:39:03,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:03,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:39:03,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:39:03,542 INFO L87 Difference]: Start difference. First operand 346 states and 533 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:05,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:05,424 INFO L93 Difference]: Finished difference Result 818 states and 1261 transitions. [2024-11-11 20:39:05,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:39:05,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 100 [2024-11-11 20:39:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:05,429 INFO L225 Difference]: With dead ends: 818 [2024-11-11 20:39:05,430 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 20:39:05,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:39:05,432 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 906 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:05,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1108 Invalid, 2578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:39:05,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 20:39:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 348. [2024-11-11 20:39:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 272 states have (on average 1.5330882352941178) internal successors, (417), 278 states have internal predecessors, (417), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (63), 55 states have call predecessors, (63), 55 states have call successors, (63) [2024-11-11 20:39:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 536 transitions. [2024-11-11 20:39:05,473 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 536 transitions. Word has length 100 [2024-11-11 20:39:05,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:05,474 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 536 transitions. [2024-11-11 20:39:05,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-11 20:39:05,474 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 536 transitions. [2024-11-11 20:39:05,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:39:05,476 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:05,477 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:05,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:39:05,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:05,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:05,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1471237417, now seen corresponding path program 1 times [2024-11-11 20:39:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:05,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755841826] [2024-11-11 20:39:05,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:05,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:39:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:39:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:39:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:05,724 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:05,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:05,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755841826] [2024-11-11 20:39:05,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755841826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:05,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:05,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:39:05,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611766805] [2024-11-11 20:39:05,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:05,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:39:05,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:39:05,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:39:05,730 INFO L87 Difference]: Start difference. First operand 348 states and 536 transitions. Second operand has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:39:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:08,254 INFO L93 Difference]: Finished difference Result 816 states and 1256 transitions. [2024-11-11 20:39:08,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:39:08,255 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2024-11-11 20:39:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:08,258 INFO L225 Difference]: With dead ends: 816 [2024-11-11 20:39:08,258 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 20:39:08,260 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:39:08,260 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 910 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3796 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 4073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 3796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:08,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1535 Invalid, 4073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 3796 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:39:08,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 20:39:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 348. [2024-11-11 20:39:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 272 states have (on average 1.5330882352941178) internal successors, (417), 278 states have internal predecessors, (417), 56 states have call successors, (56), 16 states have call predecessors, (56), 19 states have return successors, (62), 55 states have call predecessors, (62), 55 states have call successors, (62) [2024-11-11 20:39:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 535 transitions. [2024-11-11 20:39:08,290 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 535 transitions. Word has length 101 [2024-11-11 20:39:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:08,290 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 535 transitions. [2024-11-11 20:39:08,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:39:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 535 transitions. [2024-11-11 20:39:08,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:39:08,292 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:08,292 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:08,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:39:08,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:08,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:08,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1244916972, now seen corresponding path program 2 times [2024-11-11 20:39:08,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:08,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064090501] [2024-11-11 20:39:08,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:08,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:39:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:39:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:39:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:08,530 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:39:08,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:08,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064090501] [2024-11-11 20:39:08,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064090501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:08,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:08,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:39:08,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491812402] [2024-11-11 20:39:08,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:08,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:39:08,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:08,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:39:08,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:39:08,533 INFO L87 Difference]: Start difference. First operand 348 states and 535 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:39:10,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:10,814 INFO L93 Difference]: Finished difference Result 818 states and 1262 transitions. [2024-11-11 20:39:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:39:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 102 [2024-11-11 20:39:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:10,818 INFO L225 Difference]: With dead ends: 818 [2024-11-11 20:39:10,818 INFO L226 Difference]: Without dead ends: 497 [2024-11-11 20:39:10,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:39:10,821 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 906 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3840 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 4114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 3840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:10,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1536 Invalid, 4114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 3840 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:39:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-11 20:39:10,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 350. [2024-11-11 20:39:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 273 states have (on average 1.531135531135531) internal successors, (418), 280 states have internal predecessors, (418), 56 states have call successors, (56), 16 states have call predecessors, (56), 20 states have return successors, (67), 55 states have call predecessors, (67), 55 states have call successors, (67) [2024-11-11 20:39:10,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 541 transitions. [2024-11-11 20:39:10,859 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 541 transitions. Word has length 102 [2024-11-11 20:39:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:10,859 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 541 transitions. [2024-11-11 20:39:10,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-11 20:39:10,860 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 541 transitions. [2024-11-11 20:39:10,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-11 20:39:10,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:10,862 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:10,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:39:10,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:10,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:10,863 INFO L85 PathProgramCache]: Analyzing trace with hash -74300082, now seen corresponding path program 1 times [2024-11-11 20:39:10,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:10,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823382129] [2024-11-11 20:39:10,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:10,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:39:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:39:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:39:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,083 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823382129] [2024-11-11 20:39:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823382129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:39:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334107747] [2024-11-11 20:39:11,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:11,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:11,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:11,086 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:39:11,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:39:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:11,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 936 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:39:11,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:39:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:11,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:39:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:11,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334107747] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:39:11,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:39:11,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:39:11,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133114601] [2024-11-11 20:39:11,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:39:11,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:39:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:39:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:11,460 INFO L87 Difference]: Start difference. First operand 350 states and 541 transitions. Second operand has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:39:13,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:13,059 INFO L93 Difference]: Finished difference Result 987 states and 1590 transitions. [2024-11-11 20:39:13,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:39:13,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2024-11-11 20:39:13,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:13,068 INFO L225 Difference]: With dead ends: 987 [2024-11-11 20:39:13,068 INFO L226 Difference]: Without dead ends: 849 [2024-11-11 20:39:13,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:39:13,070 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1504 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 1500 mSolverCounterSat, 440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1277 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 440 IncrementalHoareTripleChecker+Valid, 1500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:13,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1277 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [440 Valid, 1500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:39:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2024-11-11 20:39:13,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 678. [2024-11-11 20:39:13,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 537 states have (on average 1.5940409683426444) internal successors, (856), 544 states have internal predecessors, (856), 120 states have call successors, (120), 16 states have call predecessors, (120), 20 states have return successors, (141), 119 states have call predecessors, (141), 119 states have call successors, (141) [2024-11-11 20:39:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1117 transitions. [2024-11-11 20:39:13,108 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1117 transitions. Word has length 103 [2024-11-11 20:39:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1117 transitions. [2024-11-11 20:39:13,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.727272727272727) internal successors, (96), 7 states have internal predecessors, (96), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-11 20:39:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1117 transitions. [2024-11-11 20:39:13,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:39:13,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:13,113 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:13,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:39:13,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:13,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:13,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1454059765, now seen corresponding path program 1 times [2024-11-11 20:39:13,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946901407] [2024-11-11 20:39:13,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:13,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:39:13,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:39:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:13,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:13,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946901407] [2024-11-11 20:39:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946901407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021466302] [2024-11-11 20:39:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:13,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:13,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:13,436 INFO L87 Difference]: Start difference. First operand 678 states and 1117 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:14,777 INFO L93 Difference]: Finished difference Result 1768 states and 2961 transitions. [2024-11-11 20:39:14,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:14,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-11-11 20:39:14,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:14,785 INFO L225 Difference]: With dead ends: 1768 [2024-11-11 20:39:14,785 INFO L226 Difference]: Without dead ends: 1158 [2024-11-11 20:39:14,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:14,788 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1010 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1025 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:14,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1025 Valid, 873 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:39:14,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-11 20:39:14,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1003. [2024-11-11 20:39:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 798 states have (on average 1.605263157894737) internal successors, (1281), 805 states have internal predecessors, (1281), 184 states have call successors, (184), 16 states have call predecessors, (184), 20 states have return successors, (215), 183 states have call predecessors, (215), 183 states have call successors, (215) [2024-11-11 20:39:14,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1680 transitions. [2024-11-11 20:39:14,843 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1680 transitions. Word has length 109 [2024-11-11 20:39:14,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:14,843 INFO L471 AbstractCegarLoop]: Abstraction has 1003 states and 1680 transitions. [2024-11-11 20:39:14,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:14,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2024-11-11 20:39:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:39:14,848 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:14,849 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:14,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:39:14,849 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1651482476, now seen corresponding path program 1 times [2024-11-11 20:39:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:14,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058028749] [2024-11-11 20:39:14,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:39:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:39:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:39:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:14,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:14,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058028749] [2024-11-11 20:39:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058028749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:14,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070003693] [2024-11-11 20:39:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:14,963 INFO L87 Difference]: Start difference. First operand 1003 states and 1680 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:16,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:16,251 INFO L93 Difference]: Finished difference Result 2548 states and 4310 transitions. [2024-11-11 20:39:16,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:16,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-11-11 20:39:16,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:16,263 INFO L225 Difference]: With dead ends: 2548 [2024-11-11 20:39:16,263 INFO L226 Difference]: Without dead ends: 1666 [2024-11-11 20:39:16,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:16,269 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1008 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1023 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:16,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1023 Valid, 816 Invalid, 1662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:39:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-11 20:39:16,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1511. [2024-11-11 20:39:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1211 states have (on average 1.611890999174236) internal successors, (1952), 1218 states have internal predecessors, (1952), 279 states have call successors, (279), 16 states have call predecessors, (279), 20 states have return successors, (310), 278 states have call predecessors, (310), 278 states have call successors, (310) [2024-11-11 20:39:16,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2541 transitions. [2024-11-11 20:39:16,339 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 2541 transitions. Word has length 110 [2024-11-11 20:39:16,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:16,339 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 2541 transitions. [2024-11-11 20:39:16,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:16,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 2541 transitions. [2024-11-11 20:39:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:39:16,346 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:16,346 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:39:16,347 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:16,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:16,347 INFO L85 PathProgramCache]: Analyzing trace with hash 225800205, now seen corresponding path program 1 times [2024-11-11 20:39:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745420442] [2024-11-11 20:39:16,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:39:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:39:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:39:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:16,505 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:16,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:16,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745420442] [2024-11-11 20:39:16,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745420442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:16,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:16,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:16,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001287205] [2024-11-11 20:39:16,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:16,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:16,511 INFO L87 Difference]: Start difference. First operand 1511 states and 2541 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:17,636 INFO L93 Difference]: Finished difference Result 3700 states and 6319 transitions. [2024-11-11 20:39:17,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:17,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-11-11 20:39:17,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:17,651 INFO L225 Difference]: With dead ends: 3700 [2024-11-11 20:39:17,651 INFO L226 Difference]: Without dead ends: 2435 [2024-11-11 20:39:17,655 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:17,656 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1006 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:17,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 811 Invalid, 1634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2435 states. [2024-11-11 20:39:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2435 to 2280. [2024-11-11 20:39:17,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2280 states, 1857 states have (on average 1.617124394184168) internal successors, (3003), 1864 states have internal predecessors, (3003), 402 states have call successors, (402), 16 states have call predecessors, (402), 20 states have return successors, (449), 401 states have call predecessors, (449), 401 states have call successors, (449) [2024-11-11 20:39:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2280 states to 2280 states and 3854 transitions. [2024-11-11 20:39:17,758 INFO L78 Accepts]: Start accepts. Automaton has 2280 states and 3854 transitions. Word has length 111 [2024-11-11 20:39:17,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:17,758 INFO L471 AbstractCegarLoop]: Abstraction has 2280 states and 3854 transitions. [2024-11-11 20:39:17,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:17,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2280 states and 3854 transitions. [2024-11-11 20:39:17,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:39:17,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:17,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:17,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:39:17,767 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:17,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:17,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1877105493, now seen corresponding path program 1 times [2024-11-11 20:39:17,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:17,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842155921] [2024-11-11 20:39:17,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:17,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:39:17,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:17,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:39:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:39:17,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:17,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:17,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842155921] [2024-11-11 20:39:17,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842155921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:17,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:17,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:17,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483190582] [2024-11-11 20:39:17,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:17,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:17,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:17,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:17,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:17,889 INFO L87 Difference]: Start difference. First operand 2280 states and 3854 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:19,204 INFO L93 Difference]: Finished difference Result 5494 states and 9453 transitions. [2024-11-11 20:39:19,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:19,205 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-11-11 20:39:19,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:19,228 INFO L225 Difference]: With dead ends: 5494 [2024-11-11 20:39:19,228 INFO L226 Difference]: Without dead ends: 3664 [2024-11-11 20:39:19,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:19,237 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1004 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 323 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:19,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 814 Invalid, 1645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [323 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:39:19,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2024-11-11 20:39:19,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3509. [2024-11-11 20:39:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3509 states, 2907 states have (on average 1.6202270381836945) internal successors, (4710), 2914 states have internal predecessors, (4710), 581 states have call successors, (581), 16 states have call predecessors, (581), 20 states have return successors, (654), 580 states have call predecessors, (654), 580 states have call successors, (654) [2024-11-11 20:39:19,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 5945 transitions. [2024-11-11 20:39:19,400 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 5945 transitions. Word has length 112 [2024-11-11 20:39:19,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:19,400 INFO L471 AbstractCegarLoop]: Abstraction has 3509 states and 5945 transitions. [2024-11-11 20:39:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:19,401 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 5945 transitions. [2024-11-11 20:39:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:39:19,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:19,410 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:19,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:39:19,411 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:19,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:19,411 INFO L85 PathProgramCache]: Analyzing trace with hash 463786281, now seen corresponding path program 1 times [2024-11-11 20:39:19,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:19,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796579953] [2024-11-11 20:39:19,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:19,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:39:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:39:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:39:19,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:39:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:39:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:19,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:19,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796579953] [2024-11-11 20:39:19,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796579953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:19,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:19,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:19,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546500027] [2024-11-11 20:39:19,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:19,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:19,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:19,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:19,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:19,561 INFO L87 Difference]: Start difference. First operand 3509 states and 5945 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:20,898 INFO L93 Difference]: Finished difference Result 8442 states and 14600 transitions. [2024-11-11 20:39:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:20,898 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 113 [2024-11-11 20:39:20,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:20,927 INFO L225 Difference]: With dead ends: 8442 [2024-11-11 20:39:20,928 INFO L226 Difference]: Without dead ends: 5695 [2024-11-11 20:39:20,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:20,939 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 1002 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 327 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 327 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:20,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 845 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [327 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:39:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5695 states. [2024-11-11 20:39:21,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5695 to 5540. [2024-11-11 20:39:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5540 states, 4562 states have (on average 1.6137658921525646) internal successors, (7362), 4569 states have internal predecessors, (7362), 957 states have call successors, (957), 16 states have call predecessors, (957), 20 states have return successors, (1074), 956 states have call predecessors, (1074), 956 states have call successors, (1074) [2024-11-11 20:39:21,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5540 states to 5540 states and 9393 transitions. [2024-11-11 20:39:21,193 INFO L78 Accepts]: Start accepts. Automaton has 5540 states and 9393 transitions. Word has length 113 [2024-11-11 20:39:21,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:21,194 INFO L471 AbstractCegarLoop]: Abstraction has 5540 states and 9393 transitions. [2024-11-11 20:39:21,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5540 states and 9393 transitions. [2024-11-11 20:39:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:39:21,207 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:21,207 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:21,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:39:21,208 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:21,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash 397519417, now seen corresponding path program 1 times [2024-11-11 20:39:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:21,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593961786] [2024-11-11 20:39:21,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:21,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:21,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:39:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:39:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:39:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:21,349 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:21,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:21,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593961786] [2024-11-11 20:39:21,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593961786] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:21,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815999717] [2024-11-11 20:39:21,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:21,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:21,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:21,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:21,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:21,351 INFO L87 Difference]: Start difference. First operand 5540 states and 9393 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:22,719 INFO L93 Difference]: Finished difference Result 13779 states and 23821 transitions. [2024-11-11 20:39:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 114 [2024-11-11 20:39:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:22,776 INFO L225 Difference]: With dead ends: 13779 [2024-11-11 20:39:22,776 INFO L226 Difference]: Without dead ends: 9378 [2024-11-11 20:39:22,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:22,796 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 1000 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 330 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1015 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 330 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:22,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1015 Valid, 824 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [330 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9378 states. [2024-11-11 20:39:23,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9378 to 9223. [2024-11-11 20:39:23,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9223 states, 7639 states have (on average 1.6112056551904699) internal successors, (12308), 7646 states have internal predecessors, (12308), 1563 states have call successors, (1563), 16 states have call predecessors, (1563), 20 states have return successors, (1758), 1562 states have call predecessors, (1758), 1562 states have call successors, (1758) [2024-11-11 20:39:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9223 states to 9223 states and 15629 transitions. [2024-11-11 20:39:23,296 INFO L78 Accepts]: Start accepts. Automaton has 9223 states and 15629 transitions. Word has length 114 [2024-11-11 20:39:23,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:23,297 INFO L471 AbstractCegarLoop]: Abstraction has 9223 states and 15629 transitions. [2024-11-11 20:39:23,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:23,298 INFO L276 IsEmpty]: Start isEmpty. Operand 9223 states and 15629 transitions. [2024-11-11 20:39:23,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:39:23,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:23,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:23,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:39:23,316 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:23,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1530809481, now seen corresponding path program 1 times [2024-11-11 20:39:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:23,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688436076] [2024-11-11 20:39:23,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:23,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:23,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:23,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:39:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:39:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:39:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:23,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:23,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688436076] [2024-11-11 20:39:23,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688436076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:23,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:23,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:23,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221719072] [2024-11-11 20:39:23,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:23,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:23,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:23,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:23,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:23,421 INFO L87 Difference]: Start difference. First operand 9223 states and 15629 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:24,837 INFO L93 Difference]: Finished difference Result 23963 states and 41367 transitions. [2024-11-11 20:39:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 115 [2024-11-11 20:39:24,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:24,906 INFO L225 Difference]: With dead ends: 23963 [2024-11-11 20:39:24,906 INFO L226 Difference]: Without dead ends: 16331 [2024-11-11 20:39:24,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:24,932 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 998 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:24,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 844 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 1337 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:24,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16331 states. [2024-11-11 20:39:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16331 to 16176. [2024-11-11 20:39:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16176 states, 13389 states have (on average 1.6020613936813803) internal successors, (21450), 13396 states have internal predecessors, (21450), 2766 states have call successors, (2766), 16 states have call predecessors, (2766), 20 states have return successors, (3105), 2765 states have call predecessors, (3105), 2765 states have call successors, (3105) [2024-11-11 20:39:25,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16176 states to 16176 states and 27321 transitions. [2024-11-11 20:39:25,735 INFO L78 Accepts]: Start accepts. Automaton has 16176 states and 27321 transitions. Word has length 115 [2024-11-11 20:39:25,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:25,736 INFO L471 AbstractCegarLoop]: Abstraction has 16176 states and 27321 transitions. [2024-11-11 20:39:25,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:25,736 INFO L276 IsEmpty]: Start isEmpty. Operand 16176 states and 27321 transitions. [2024-11-11 20:39:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:39:25,762 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:25,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:25,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:39:25,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:25,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:25,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1035195930, now seen corresponding path program 1 times [2024-11-11 20:39:25,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:25,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557490082] [2024-11-11 20:39:25,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:25,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:25,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:25,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:25,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:39:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:39:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:39:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,889 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:25,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:25,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557490082] [2024-11-11 20:39:25,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557490082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:25,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:25,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:25,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745817289] [2024-11-11 20:39:25,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:25,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:25,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:25,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:25,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:25,893 INFO L87 Difference]: Start difference. First operand 16176 states and 27321 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:27,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:27,614 INFO L93 Difference]: Finished difference Result 42929 states and 73966 transitions. [2024-11-11 20:39:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-11-11 20:39:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:27,749 INFO L225 Difference]: With dead ends: 42929 [2024-11-11 20:39:27,749 INFO L226 Difference]: Without dead ends: 28986 [2024-11-11 20:39:27,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:27,799 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 996 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1324 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:27,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 815 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1324 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:27,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28986 states. [2024-11-11 20:39:29,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28986 to 28831. [2024-11-11 20:39:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28831 states, 24005 states have (on average 1.597750468652364) internal successors, (38354), 24012 states have internal predecessors, (38354), 4805 states have call successors, (4805), 16 states have call predecessors, (4805), 20 states have return successors, (5418), 4804 states have call predecessors, (5418), 4804 states have call successors, (5418) [2024-11-11 20:39:29,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28831 states to 28831 states and 48577 transitions. [2024-11-11 20:39:29,206 INFO L78 Accepts]: Start accepts. Automaton has 28831 states and 48577 transitions. Word has length 116 [2024-11-11 20:39:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:29,207 INFO L471 AbstractCegarLoop]: Abstraction has 28831 states and 48577 transitions. [2024-11-11 20:39:29,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28831 states and 48577 transitions. [2024-11-11 20:39:29,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:39:29,237 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:29,238 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:29,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:39:29,238 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:29,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:29,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1615427271, now seen corresponding path program 1 times [2024-11-11 20:39:29,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:29,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130047222] [2024-11-11 20:39:29,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:29,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:39:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:39:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:39:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:39:29,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:29,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:29,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:29,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130047222] [2024-11-11 20:39:29,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130047222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:29,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:29,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:29,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388384463] [2024-11-11 20:39:29,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:29,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:29,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:29,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:29,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:29,378 INFO L87 Difference]: Start difference. First operand 28831 states and 48577 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:32,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:32,186 INFO L93 Difference]: Finished difference Result 78691 states and 134725 transitions. [2024-11-11 20:39:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 117 [2024-11-11 20:39:32,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:32,449 INFO L225 Difference]: With dead ends: 78691 [2024-11-11 20:39:32,449 INFO L226 Difference]: Without dead ends: 52865 [2024-11-11 20:39:32,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:32,533 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 994 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:32,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 818 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:39:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52865 states. [2024-11-11 20:39:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52865 to 52710. [2024-11-11 20:39:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52710 states, 44169 states have (on average 1.5921347551450111) internal successors, (70323), 44176 states have internal predecessors, (70323), 8520 states have call successors, (8520), 16 states have call predecessors, (8520), 20 states have return successors, (9665), 8519 states have call predecessors, (9665), 8519 states have call successors, (9665) [2024-11-11 20:39:34,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52710 states to 52710 states and 88508 transitions. [2024-11-11 20:39:35,011 INFO L78 Accepts]: Start accepts. Automaton has 52710 states and 88508 transitions. Word has length 117 [2024-11-11 20:39:35,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:35,012 INFO L471 AbstractCegarLoop]: Abstraction has 52710 states and 88508 transitions. [2024-11-11 20:39:35,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 52710 states and 88508 transitions. [2024-11-11 20:39:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:39:35,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:35,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:35,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:39:35,042 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:35,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:35,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1383712678, now seen corresponding path program 1 times [2024-11-11 20:39:35,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:35,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512487986] [2024-11-11 20:39:35,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:35,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:35,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:39:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:39:35,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:39:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:39:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:39:35,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:35,179 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:35,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512487986] [2024-11-11 20:39:35,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512487986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:35,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:35,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:39:35,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327672230] [2024-11-11 20:39:35,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:35,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:39:35,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:35,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:39:35,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:39:35,183 INFO L87 Difference]: Start difference. First operand 52710 states and 88508 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:38,542 INFO L93 Difference]: Finished difference Result 98462 states and 168912 transitions. [2024-11-11 20:39:38,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:39:38,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 118 [2024-11-11 20:39:38,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:39,122 INFO L225 Difference]: With dead ends: 98462 [2024-11-11 20:39:39,123 INFO L226 Difference]: Without dead ends: 98324 [2024-11-11 20:39:39,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:39:39,168 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 989 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1314 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 1314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:39,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 821 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 1314 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:39:39,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98324 states. [2024-11-11 20:39:42,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98324 to 98169. [2024-11-11 20:39:42,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98169 states, 82829 states have (on average 1.5851090801530865) internal successors, (131293), 82836 states have internal predecessors, (131293), 15319 states have call successors, (15319), 16 states have call predecessors, (15319), 20 states have return successors, (17510), 15318 states have call predecessors, (17510), 15318 states have call successors, (17510) [2024-11-11 20:39:42,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98169 states to 98169 states and 164122 transitions. [2024-11-11 20:39:42,706 INFO L78 Accepts]: Start accepts. Automaton has 98169 states and 164122 transitions. Word has length 118 [2024-11-11 20:39:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:42,707 INFO L471 AbstractCegarLoop]: Abstraction has 98169 states and 164122 transitions. [2024-11-11 20:39:42,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-11 20:39:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 98169 states and 164122 transitions. [2024-11-11 20:39:42,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-11 20:39:42,731 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:42,731 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:42,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:39:42,732 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:42,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:42,732 INFO L85 PathProgramCache]: Analyzing trace with hash -548289320, now seen corresponding path program 1 times [2024-11-11 20:39:42,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:42,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322033446] [2024-11-11 20:39:42,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:42,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:43,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:43,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:39:43,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:39:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:43,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:39:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:39:43,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322033446] [2024-11-11 20:39:43,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322033446] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:43,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:43,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-11 20:39:43,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258096732] [2024-11-11 20:39:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-11 20:39:43,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-11 20:39:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-11 20:39:43,665 INFO L87 Difference]: Start difference. First operand 98169 states and 164122 transitions. Second operand has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-11 20:39:52,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:52,464 INFO L93 Difference]: Finished difference Result 196066 states and 339710 transitions. [2024-11-11 20:39:52,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-11 20:39:52,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 119 [2024-11-11 20:39:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:53,655 INFO L225 Difference]: With dead ends: 196066 [2024-11-11 20:39:53,655 INFO L226 Difference]: Without dead ends: 195934 [2024-11-11 20:39:53,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2024-11-11 20:39:53,741 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 3481 mSDsluCounter, 2395 mSDsCounter, 0 mSdLazyCounter, 6720 mSolverCounterSat, 999 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3481 SdHoareTripleChecker+Valid, 2628 SdHoareTripleChecker+Invalid, 7719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 999 IncrementalHoareTripleChecker+Valid, 6720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:53,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3481 Valid, 2628 Invalid, 7719 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [999 Valid, 6720 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-11 20:39:53,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195934 states. [2024-11-11 20:40:00,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195934 to 195509. [2024-11-11 20:40:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195509 states, 165029 states have (on average 1.585909143241491) internal successors, (261721), 164932 states have internal predecessors, (261721), 30430 states have call successors, (30430), 41 states have call predecessors, (30430), 49 states have return successors, (38087), 30541 states have call predecessors, (38087), 30427 states have call successors, (38087) [2024-11-11 20:40:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195509 states to 195509 states and 330238 transitions. [2024-11-11 20:40:02,202 INFO L78 Accepts]: Start accepts. Automaton has 195509 states and 330238 transitions. Word has length 119 [2024-11-11 20:40:02,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:02,202 INFO L471 AbstractCegarLoop]: Abstraction has 195509 states and 330238 transitions. [2024-11-11 20:40:02,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.466666666666667) internal successors, (82), 10 states have internal predecessors, (82), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-11 20:40:02,203 INFO L276 IsEmpty]: Start isEmpty. Operand 195509 states and 330238 transitions. [2024-11-11 20:40:02,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:40:02,248 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:02,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:02,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:40:02,249 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:02,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1574323709, now seen corresponding path program 1 times [2024-11-11 20:40:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:02,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838217507] [2024-11-11 20:40:02,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838217507] [2024-11-11 20:40:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838217507] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:02,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:02,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043183282] [2024-11-11 20:40:02,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:02,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:02,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:02,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:02,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:02,458 INFO L87 Difference]: Start difference. First operand 195509 states and 330238 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 6 states have internal predecessors, (83), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)