./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product31.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_spec8_product31.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 aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:49:11,163 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:49:11,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:49:11,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:49:11,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:49:11,260 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:49:11,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:49:11,261 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:49:11,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:49:11,263 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:49:11,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:49:11,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:49:11,264 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:49:11,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:49:11,265 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:49:11,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:49:11,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:49:11,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:49:11,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:49:11,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:49:11,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:49:11,272 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:49:11,272 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:49:11,273 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:49:11,273 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:49:11,273 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:49:11,273 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:49:11,274 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:49:11,274 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:49:11,274 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:49:11,275 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:49:11,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:49:11,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:11,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:49:11,276 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:49:11,276 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:49:11,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:49:11,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:49:11,277 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:49:11,277 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:49:11,277 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:49:11,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:49:11,278 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 -> aa31ba7b6b6c5a20100c4ed7bd6bb53a6560ae9fc8557479e094a44cc1bad058 [2024-11-11 20:49:11,526 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:49:11,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:49:11,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:49:11,553 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:49:11,553 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:49:11,554 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2024-11-11 20:49:12,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:49:13,330 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:49:13,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c [2024-11-11 20:49:13,372 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480d3dfd7/3f957b34a1f646ca8ab7ce0ec1127c17/FLAG0c8ba9ca6 [2024-11-11 20:49:13,392 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/480d3dfd7/3f957b34a1f646ca8ab7ce0ec1127c17 [2024-11-11 20:49:13,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:49:13,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:49:13,400 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:13,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:49:13,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:49:13,417 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:13" (1/1) ... [2024-11-11 20:49:13,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20b4adc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:13, skipping insertion in model container [2024-11-11 20:49:13,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:13" (1/1) ... [2024-11-11 20:49:13,478 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:49:13,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c[36672,36685] [2024-11-11 20:49:14,032 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:14,047 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:49:14,056 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2024-11-11 20:49:14,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1128] [2024-11-11 20:49:14,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1494] [2024-11-11 20:49:14,058 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1503] [2024-11-11 20:49:14,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1521] [2024-11-11 20:49:14,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1680] [2024-11-11 20:49:14,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2082] [2024-11-11 20:49:14,059 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2120] [2024-11-11 20:49:14,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2484] [2024-11-11 20:49:14,060 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2769] [2024-11-11 20:49:14,061 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [2985] [2024-11-11 20:49:14,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product31.cil.c[36672,36685] [2024-11-11 20:49:14,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:14,194 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:49:14,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14 WrapperNode [2024-11-11 20:49:14,194 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:14,195 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:14,195 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:49:14,195 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:49:14,200 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:49:14" (1/1) ... [2024-11-11 20:49:14,230 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:49:14" (1/1) ... [2024-11-11 20:49:14,290 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1043 [2024-11-11 20:49:14,290 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:14,292 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:49:14,292 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:49:14,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:49:14,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,313 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,348 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:49:14,349 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,349 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,383 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,410 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:49:14,416 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:49:14,416 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:49:14,416 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:49:14,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (1/1) ... [2024-11-11 20:49:14,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:14,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:14,459 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:49:14,461 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:49:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:49:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:49:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:49:14,511 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:49:14,511 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:49:14,512 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:49:14,512 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:49:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:49:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:49:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:49:14,513 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:49:14,513 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:49:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:49:14,514 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:49:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:49:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:49:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:49:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:49:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:49:14,516 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:49:14,516 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:49:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:49:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:49:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:49:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:49:14,517 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:49:14,517 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:49:14,518 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:49:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:49:14,518 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:49:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:49:14,518 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:49:14,518 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:49:14,519 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:49:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:49:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:49:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:49:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:49:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:49:14,520 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:49:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:49:14,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:49:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:49:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:49:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:49:14,521 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:49:14,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:49:14,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:49:14,761 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:49:14,763 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:49:15,663 INFO L? ?]: Removed 479 outVars from TransFormulas that were not future-live. [2024-11-11 20:49:15,663 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:49:15,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:49:15,683 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:49:15,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:15 BoogieIcfgContainer [2024-11-11 20:49:15,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:49:15,686 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:49:15,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:49:15,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:49:15,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:49:13" (1/3) ... [2024-11-11 20:49:15,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a45fa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:15, skipping insertion in model container [2024-11-11 20:49:15,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:14" (2/3) ... [2024-11-11 20:49:15,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a45fa7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:15, skipping insertion in model container [2024-11-11 20:49:15,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:15" (3/3) ... [2024-11-11 20:49:15,696 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product31.cil.c [2024-11-11 20:49:15,711 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:49:15,712 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:49:15,811 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:49:15,818 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;@53e0797b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:49:15,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:49:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand has 370 states, 286 states have (on average 1.5) internal successors, (429), 290 states have internal predecessors, (429), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-11 20:49:15,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:49:15,847 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:15,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:15,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:15,855 INFO L85 PathProgramCache]: Analyzing trace with hash -873528409, now seen corresponding path program 1 times [2024-11-11 20:49:15,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:15,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933387918] [2024-11-11 20:49:15,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:15,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:16,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:16,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:16,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:16,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:49:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:49:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:16,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,659 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:49:16,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:16,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933387918] [2024-11-11 20:49:16,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933387918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:16,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1484486242] [2024-11-11 20:49:16,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:16,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:16,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:16,664 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:49:16,665 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:49:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:49:17,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:17,079 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:49:17,083 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:17,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1484486242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:49:17,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101494006] [2024-11-11 20:49:17,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:17,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:49:17,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:17,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:49:17,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:17,127 INFO L87 Difference]: Start difference. First operand has 370 states, 286 states have (on average 1.5) internal successors, (429), 290 states have internal predecessors, (429), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:17,200 INFO L93 Difference]: Finished difference Result 586 states and 848 transitions. [2024-11-11 20:49:17,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:49:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-11-11 20:49:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:17,220 INFO L225 Difference]: With dead ends: 586 [2024-11-11 20:49:17,221 INFO L226 Difference]: Without dead ends: 363 [2024-11-11 20:49:17,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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:49:17,231 INFO L435 NwaCegarLoop]: 543 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, 543 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:49:17,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-11 20:49:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2024-11-11 20:49:17,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.4928571428571429) internal successors, (418), 283 states have internal predecessors, (418), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-11 20:49:17,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2024-11-11 20:49:17,303 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 101 [2024-11-11 20:49:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:17,305 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2024-11-11 20:49:17,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:17,306 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2024-11-11 20:49:17,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:49:17,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:17,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:17,328 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:49:17,514 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:49:17,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:17,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:17,515 INFO L85 PathProgramCache]: Analyzing trace with hash -238493020, now seen corresponding path program 1 times [2024-11-11 20:49:17,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:17,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276331776] [2024-11-11 20:49:17,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:17,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:17,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:17,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:49:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:49:17,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:17,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:17,908 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:49:17,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:17,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276331776] [2024-11-11 20:49:17,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276331776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:17,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884110274] [2024-11-11 20:49:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:17,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:17,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:17,914 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:49:17,915 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:49:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:49:18,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:18,270 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:49:18,271 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884110274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012676441] [2024-11-11 20:49:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:18,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:18,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:18,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:18,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:18,276 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:18,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:18,338 INFO L93 Difference]: Finished difference Result 576 states and 829 transitions. [2024-11-11 20:49:18,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:18,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2024-11-11 20:49:18,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:18,343 INFO L225 Difference]: With dead ends: 576 [2024-11-11 20:49:18,344 INFO L226 Difference]: Without dead ends: 366 [2024-11-11 20:49:18,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 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:49:18,351 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 1 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1064 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:49:18,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1064 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:18,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-11 20:49:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 365. [2024-11-11 20:49:18,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 282 states have (on average 1.4893617021276595) internal successors, (420), 285 states have internal predecessors, (420), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-11 20:49:18,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 537 transitions. [2024-11-11 20:49:18,384 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 537 transitions. Word has length 102 [2024-11-11 20:49:18,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:18,385 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 537 transitions. [2024-11-11 20:49:18,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:18,385 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 537 transitions. [2024-11-11 20:49:18,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:49:18,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:18,389 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:18,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:49:18,589 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:49:18,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:18,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:18,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1960641683, now seen corresponding path program 1 times [2024-11-11 20:49:18,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:18,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84126398] [2024-11-11 20:49:18,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:18,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:18,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:18,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:49:18,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:49:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:18,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,873 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:49:18,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:18,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84126398] [2024-11-11 20:49:18,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84126398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:18,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863879106] [2024-11-11 20:49:18,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:18,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:18,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:18,876 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:49:18,878 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:49:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:19,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:19,209 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:49:19,209 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:19,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863879106] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:19,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:19,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:19,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246866762] [2024-11-11 20:49:19,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:19,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:19,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:19,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:19,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:19,215 INFO L87 Difference]: Start difference. First operand 365 states and 537 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:19,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:19,261 INFO L93 Difference]: Finished difference Result 760 states and 1133 transitions. [2024-11-11 20:49:19,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:19,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 108 [2024-11-11 20:49:19,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:19,267 INFO L225 Difference]: With dead ends: 760 [2024-11-11 20:49:19,267 INFO L226 Difference]: Without dead ends: 422 [2024-11-11 20:49:19,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 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:49:19,270 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 107 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1029 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:49:19,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1029 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-11 20:49:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 414. [2024-11-11 20:49:19,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 320 states have (on average 1.50625) internal successors, (482), 323 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-11 20:49:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 621 transitions. [2024-11-11 20:49:19,310 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 621 transitions. Word has length 108 [2024-11-11 20:49:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:19,311 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 621 transitions. [2024-11-11 20:49:19,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:19,312 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 621 transitions. [2024-11-11 20:49:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:49:19,316 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:19,316 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:19,334 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:49:19,517 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:49:19,517 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1642716370, now seen corresponding path program 1 times [2024-11-11 20:49:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253158965] [2024-11-11 20:49:19,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:49:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:49:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:19,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:19,747 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:49:19,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253158965] [2024-11-11 20:49:19,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253158965] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:19,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922761286] [2024-11-11 20:49:19,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:19,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:19,751 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:49:19,752 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:49:20,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:49:20,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:20,126 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:49:20,127 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:20,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922761286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:20,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:20,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:49:20,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171035158] [2024-11-11 20:49:20,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:20,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:20,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:20,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:20,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:20,130 INFO L87 Difference]: Start difference. First operand 414 states and 621 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:20,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:20,201 INFO L93 Difference]: Finished difference Result 819 states and 1232 transitions. [2024-11-11 20:49:20,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:20,202 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2024-11-11 20:49:20,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:20,206 INFO L225 Difference]: With dead ends: 819 [2024-11-11 20:49:20,206 INFO L226 Difference]: Without dead ends: 416 [2024-11-11 20:49:20,209 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 128 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:49:20,209 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 2 mSDsluCounter, 1570 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2097 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:49:20,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2097 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:20,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-11 20:49:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-11 20:49:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 325 states have internal predecessors, (483), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2024-11-11 20:49:20,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 624 transitions. [2024-11-11 20:49:20,238 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 624 transitions. Word has length 109 [2024-11-11 20:49:20,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:20,240 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 624 transitions. [2024-11-11 20:49:20,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:20,240 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 624 transitions. [2024-11-11 20:49:20,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:49:20,244 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:20,244 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:20,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:49:20,448 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:49:20,449 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:20,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1181584103, now seen corresponding path program 1 times [2024-11-11 20:49:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228113123] [2024-11-11 20:49:20,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:49:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:49:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:49:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:20,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,708 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:49:20,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:20,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228113123] [2024-11-11 20:49:20,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228113123] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981149517] [2024-11-11 20:49:20,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:20,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:20,711 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:49:20,712 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:49:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:49:21,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:21,107 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:49:21,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:21,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981149517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:21,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:21,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:49:21,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827833758] [2024-11-11 20:49:21,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:21,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:21,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:21,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:21,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:21,112 INFO L87 Difference]: Start difference. First operand 416 states and 624 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:21,181 INFO L93 Difference]: Finished difference Result 821 states and 1237 transitions. [2024-11-11 20:49:21,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:21,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2024-11-11 20:49:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:21,185 INFO L225 Difference]: With dead ends: 821 [2024-11-11 20:49:21,186 INFO L226 Difference]: Without dead ends: 418 [2024-11-11 20:49:21,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 128 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:49:21,188 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2083 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:49:21,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2083 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-11 20:49:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-11-11 20:49:21,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 322 states have (on average 1.5031055900621118) internal successors, (484), 327 states have internal predecessors, (484), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-11 20:49:21,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 630 transitions. [2024-11-11 20:49:21,210 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 630 transitions. Word has length 110 [2024-11-11 20:49:21,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:21,211 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 630 transitions. [2024-11-11 20:49:21,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 630 transitions. [2024-11-11 20:49:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:49:21,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:21,214 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:21,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:49:21,414 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:49:21,415 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:21,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:21,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1225166785, now seen corresponding path program 1 times [2024-11-11 20:49:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:21,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164028613] [2024-11-11 20:49:21,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:49:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:49:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:21,615 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:49:21,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:21,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164028613] [2024-11-11 20:49:21,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164028613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:21,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:21,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044010496] [2024-11-11 20:49:21,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:21,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:21,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:21,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:21,617 INFO L87 Difference]: Start difference. First operand 418 states and 630 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:23,980 INFO L93 Difference]: Finished difference Result 999 states and 1504 transitions. [2024-11-11 20:49:23,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:23,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2024-11-11 20:49:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:23,985 INFO L225 Difference]: With dead ends: 999 [2024-11-11 20:49:23,985 INFO L226 Difference]: Without dead ends: 604 [2024-11-11 20:49:23,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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:49:23,987 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1306 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 427 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 3098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 427 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:23,988 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1108 Invalid, 3098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [427 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:49:23,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-11 20:49:24,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 418. [2024-11-11 20:49:24,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 322 states have (on average 1.5031055900621118) internal successors, (484), 327 states have internal predecessors, (484), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2024-11-11 20:49:24,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 629 transitions. [2024-11-11 20:49:24,030 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 629 transitions. Word has length 111 [2024-11-11 20:49:24,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:24,030 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 629 transitions. [2024-11-11 20:49:24,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:24,032 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 629 transitions. [2024-11-11 20:49:24,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:49:24,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:24,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:24,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:49:24,034 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:24,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1394398968, now seen corresponding path program 2 times [2024-11-11 20:49:24,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:24,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463486426] [2024-11-11 20:49:24,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:24,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:49:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:49:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:49:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:24,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:49:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:24,242 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:49:24,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:24,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463486426] [2024-11-11 20:49:24,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463486426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:24,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:24,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:24,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065822981] [2024-11-11 20:49:24,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:24,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:24,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:24,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:24,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:24,244 INFO L87 Difference]: Start difference. First operand 418 states and 629 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:26,546 INFO L93 Difference]: Finished difference Result 1001 states and 1507 transitions. [2024-11-11 20:49:26,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-11-11 20:49:26,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:26,552 INFO L225 Difference]: With dead ends: 1001 [2024-11-11 20:49:26,552 INFO L226 Difference]: Without dead ends: 606 [2024-11-11 20:49:26,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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:49:26,555 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1247 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2728 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 3137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 2728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:26,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 1108 Invalid, 3137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 2728 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:49:26,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-11 20:49:26,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 420. [2024-11-11 20:49:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 323 states have (on average 1.501547987616099) internal successors, (485), 329 states have internal predecessors, (485), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (77), 69 states have call predecessors, (77), 69 states have call successors, (77) [2024-11-11 20:49:26,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 632 transitions. [2024-11-11 20:49:26,603 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 632 transitions. Word has length 112 [2024-11-11 20:49:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:26,604 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 632 transitions. [2024-11-11 20:49:26,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:26,604 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 632 transitions. [2024-11-11 20:49:26,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:49:26,606 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:26,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:49:26,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:26,608 INFO L85 PathProgramCache]: Analyzing trace with hash 2017001956, now seen corresponding path program 1 times [2024-11-11 20:49:26,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:26,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88782797] [2024-11-11 20:49:26,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:26,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:26,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:49:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:49:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:26,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:26,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:26,848 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:49:26,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:26,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88782797] [2024-11-11 20:49:26,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88782797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:26,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:26,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:26,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709329198] [2024-11-11 20:49:26,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:26,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:26,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:26,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:26,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:26,851 INFO L87 Difference]: Start difference. First operand 420 states and 632 transitions. Second operand has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:29,480 INFO L93 Difference]: Finished difference Result 999 states and 1502 transitions. [2024-11-11 20:49:29,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:29,481 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 113 [2024-11-11 20:49:29,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:29,485 INFO L225 Difference]: With dead ends: 999 [2024-11-11 20:49:29,485 INFO L226 Difference]: Without dead ends: 606 [2024-11-11 20:49:29,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:49:29,488 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1368 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 4092 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1369 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 4554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 4092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:29,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1369 Valid, 1535 Invalid, 4554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 4092 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:49:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2024-11-11 20:49:29,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 420. [2024-11-11 20:49:29,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 323 states have (on average 1.501547987616099) internal successors, (485), 329 states have internal predecessors, (485), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2024-11-11 20:49:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 631 transitions. [2024-11-11 20:49:29,543 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 631 transitions. Word has length 113 [2024-11-11 20:49:29,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:29,544 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 631 transitions. [2024-11-11 20:49:29,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.0) internal successors, (77), 8 states have internal predecessors, (77), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:29,544 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 631 transitions. [2024-11-11 20:49:29,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:49:29,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:29,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:29,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:49:29,546 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:29,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:29,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1618188784, now seen corresponding path program 2 times [2024-11-11 20:49:29,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:29,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383596882] [2024-11-11 20:49:29,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:49:29,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:49:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:29,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,807 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:49:29,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:29,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383596882] [2024-11-11 20:49:29,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383596882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:29,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:29,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:29,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398485162] [2024-11-11 20:49:29,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:29,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:29,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:29,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:29,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:29,810 INFO L87 Difference]: Start difference. First operand 420 states and 631 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:32,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:32,391 INFO L93 Difference]: Finished difference Result 1001 states and 1508 transitions. [2024-11-11 20:49:32,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:32,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2024-11-11 20:49:32,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:32,395 INFO L225 Difference]: With dead ends: 1001 [2024-11-11 20:49:32,395 INFO L226 Difference]: Without dead ends: 608 [2024-11-11 20:49:32,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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:49:32,397 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1251 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1252 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 4999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:32,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1252 Valid, 1536 Invalid, 4999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:49:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-11 20:49:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 422. [2024-11-11 20:49:32,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 324 states have (on average 1.5) internal successors, (486), 331 states have internal predecessors, (486), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2024-11-11 20:49:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 637 transitions. [2024-11-11 20:49:32,452 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 637 transitions. Word has length 114 [2024-11-11 20:49:32,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:32,453 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 637 transitions. [2024-11-11 20:49:32,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:32,454 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 637 transitions. [2024-11-11 20:49:32,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:49:32,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:32,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:32,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:49:32,457 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:32,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:32,458 INFO L85 PathProgramCache]: Analyzing trace with hash -278494295, now seen corresponding path program 1 times [2024-11-11 20:49:32,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:32,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048441432] [2024-11-11 20:49:32,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:32,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:32,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:32,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:32,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:49:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,663 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:49:32,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:32,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048441432] [2024-11-11 20:49:32,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048441432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:32,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980337805] [2024-11-11 20:49:32,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:32,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:32,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:32,666 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:49:32,668 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:49:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 1047 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:32,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:32,994 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:49:32,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:49:33,091 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:49:33,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980337805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:49:33,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:49:33,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:49:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592276323] [2024-11-11 20:49:33,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:49:33,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:49:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:33,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:49:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:49:33,095 INFO L87 Difference]: Start difference. First operand 422 states and 637 transitions. Second operand has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-11 20:49:34,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:34,794 INFO L93 Difference]: Finished difference Result 1170 states and 1836 transitions. [2024-11-11 20:49:34,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:49:34,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 115 [2024-11-11 20:49:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:34,801 INFO L225 Difference]: With dead ends: 1170 [2024-11-11 20:49:34,801 INFO L226 Difference]: Without dead ends: 960 [2024-11-11 20:49:34,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 253 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:49:34,804 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 1859 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 1716 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1904 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 1716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:34,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1904 Valid, 1313 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 1716 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 20:49:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-11 20:49:34,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 750. [2024-11-11 20:49:34,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 588 states have (on average 1.5714285714285714) internal successors, (924), 595 states have internal predecessors, (924), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2024-11-11 20:49:34,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1213 transitions. [2024-11-11 20:49:34,852 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1213 transitions. Word has length 115 [2024-11-11 20:49:34,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:34,852 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1213 transitions. [2024-11-11 20:49:34,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.090909090909092) internal successors, (111), 7 states have internal predecessors, (111), 2 states have call successors, (31), 6 states have call predecessors, (31), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-11 20:49:34,853 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1213 transitions. [2024-11-11 20:49:34,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:49:34,856 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:34,856 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:34,876 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:49:35,057 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:49:35,057 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:35,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 2073879302, now seen corresponding path program 1 times [2024-11-11 20:49:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:35,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611878920] [2024-11-11 20:49:35,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:35,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:35,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:35,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:35,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:49:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:35,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:49:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,167 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:49:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611878920] [2024-11-11 20:49:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611878920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:35,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:35,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:35,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795256214] [2024-11-11 20:49:35,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:35,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:35,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:35,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:35,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:35,169 INFO L87 Difference]: Start difference. First operand 750 states and 1213 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:36,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:36,529 INFO L93 Difference]: Finished difference Result 1951 states and 3207 transitions. [2024-11-11 20:49:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:36,530 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-11-11 20:49:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:36,539 INFO L225 Difference]: With dead ends: 1951 [2024-11-11 20:49:36,539 INFO L226 Difference]: Without dead ends: 1269 [2024-11-11 20:49:36,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:36,542 INFO L435 NwaCegarLoop]: 198 mSDtfsCounter, 1369 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1384 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 2024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:36,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1384 Valid, 870 Invalid, 2024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2024-11-11 20:49:36,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 1075. [2024-11-11 20:49:36,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 849 states have (on average 1.5889281507656066) internal successors, (1349), 856 states have internal predecessors, (1349), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2024-11-11 20:49:36,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1776 transitions. [2024-11-11 20:49:36,603 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1776 transitions. Word has length 121 [2024-11-11 20:49:36,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:36,603 INFO L471 AbstractCegarLoop]: Abstraction has 1075 states and 1776 transitions. [2024-11-11 20:49:36,604 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:36,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1776 transitions. [2024-11-11 20:49:36,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:49:36,609 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:36,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:36,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:49:36,610 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:36,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:36,610 INFO L85 PathProgramCache]: Analyzing trace with hash -337144750, now seen corresponding path program 1 times [2024-11-11 20:49:36,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:36,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413866543] [2024-11-11 20:49:36,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:36,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:36,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:49:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:36,720 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:49:36,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:36,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413866543] [2024-11-11 20:49:36,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413866543] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:36,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:36,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:36,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470128218] [2024-11-11 20:49:36,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:36,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:36,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:36,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:36,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:36,723 INFO L87 Difference]: Start difference. First operand 1075 states and 1776 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:38,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:38,097 INFO L93 Difference]: Finished difference Result 2731 states and 4556 transitions. [2024-11-11 20:49:38,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:38,098 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-11-11 20:49:38,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:38,107 INFO L225 Difference]: With dead ends: 2731 [2024-11-11 20:49:38,108 INFO L226 Difference]: Without dead ends: 1777 [2024-11-11 20:49:38,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:38,113 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 1395 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 487 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:38,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 856 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [487 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-11 20:49:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1583. [2024-11-11 20:49:38,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1262 states have (on average 1.6006339144215531) internal successors, (2020), 1269 states have internal predecessors, (2020), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2024-11-11 20:49:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2637 transitions. [2024-11-11 20:49:38,216 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2637 transitions. Word has length 122 [2024-11-11 20:49:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:38,217 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2637 transitions. [2024-11-11 20:49:38,217 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, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2637 transitions. [2024-11-11 20:49:38,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:49:38,225 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:38,225 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:38,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:49:38,225 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:38,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:38,226 INFO L85 PathProgramCache]: Analyzing trace with hash 740211048, now seen corresponding path program 1 times [2024-11-11 20:49:38,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:38,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988924442] [2024-11-11 20:49:38,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:38,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:38,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:38,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:38,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:38,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:49:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:38,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:38,335 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:49:38,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:38,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988924442] [2024-11-11 20:49:38,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988924442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:38,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:38,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:38,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507614098] [2024-11-11 20:49:38,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:38,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:38,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:38,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:38,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:38,338 INFO L87 Difference]: Start difference. First operand 1583 states and 2637 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:39,801 INFO L93 Difference]: Finished difference Result 3883 states and 6565 transitions. [2024-11-11 20:49:39,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:39,801 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-11-11 20:49:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:39,816 INFO L225 Difference]: With dead ends: 3883 [2024-11-11 20:49:39,816 INFO L226 Difference]: Without dead ends: 2546 [2024-11-11 20:49:39,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:39,822 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1387 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1501 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 1501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:39,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1402 Valid, 814 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 1501 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2024-11-11 20:49:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2352. [2024-11-11 20:49:39,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2352 states, 1908 states have (on average 1.609538784067086) internal successors, (3071), 1915 states have internal predecessors, (3071), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2024-11-11 20:49:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2352 states to 2352 states and 3950 transitions. [2024-11-11 20:49:39,952 INFO L78 Accepts]: Start accepts. Automaton has 2352 states and 3950 transitions. Word has length 123 [2024-11-11 20:49:39,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:39,952 INFO L471 AbstractCegarLoop]: Abstraction has 2352 states and 3950 transitions. [2024-11-11 20:49:39,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2352 states and 3950 transitions. [2024-11-11 20:49:39,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:49:39,962 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:39,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:39,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:49:39,962 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:39,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:39,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1646975283, now seen corresponding path program 1 times [2024-11-11 20:49:39,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:39,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835326225] [2024-11-11 20:49:39,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:39,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:49:40,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:49:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:49:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:40,081 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:49:40,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:40,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835326225] [2024-11-11 20:49:40,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835326225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:40,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:40,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:40,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538062824] [2024-11-11 20:49:40,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:40,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:40,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:40,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:40,083 INFO L87 Difference]: Start difference. First operand 2352 states and 3950 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:41,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:41,517 INFO L93 Difference]: Finished difference Result 5677 states and 9699 transitions. [2024-11-11 20:49:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:41,518 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-11-11 20:49:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:41,541 INFO L225 Difference]: With dead ends: 5677 [2024-11-11 20:49:41,541 INFO L226 Difference]: Without dead ends: 3775 [2024-11-11 20:49:41,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:41,551 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1326 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1567 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 814 SdHoareTripleChecker+Invalid, 2055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:41,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 814 Invalid, 2055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1567 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3775 states. [2024-11-11 20:49:41,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3775 to 3581. [2024-11-11 20:49:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 2958 states have (on average 1.6152805949966194) internal successors, (4778), 2965 states have internal predecessors, (4778), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2024-11-11 20:49:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 6041 transitions. [2024-11-11 20:49:41,708 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 6041 transitions. Word has length 124 [2024-11-11 20:49:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:41,708 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 6041 transitions. [2024-11-11 20:49:41,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 6041 transitions. [2024-11-11 20:49:41,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:49:41,721 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:41,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:41,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:49:41,722 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:41,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:41,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1632985316, now seen corresponding path program 1 times [2024-11-11 20:49:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116448430] [2024-11-11 20:49:41,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:41,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:41,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:49:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:49:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:41,872 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:49:41,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:41,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116448430] [2024-11-11 20:49:41,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116448430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:41,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:41,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:41,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694569916] [2024-11-11 20:49:41,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:41,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:41,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:41,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:41,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:41,873 INFO L87 Difference]: Start difference. First operand 3581 states and 6041 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:43,358 INFO L93 Difference]: Finished difference Result 8625 states and 14846 transitions. [2024-11-11 20:49:43,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-11-11 20:49:43,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:43,386 INFO L225 Difference]: With dead ends: 8625 [2024-11-11 20:49:43,387 INFO L226 Difference]: Without dead ends: 5806 [2024-11-11 20:49:43,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:43,395 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1355 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 1530 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1370 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:43,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1370 Valid, 847 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1530 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:43,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5806 states. [2024-11-11 20:49:43,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5806 to 5612. [2024-11-11 20:49:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 4613 states have (on average 1.6106655105137655) internal successors, (7430), 4620 states have internal predecessors, (7430), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2024-11-11 20:49:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 9489 transitions. [2024-11-11 20:49:43,645 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 9489 transitions. Word has length 125 [2024-11-11 20:49:43,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:43,646 INFO L471 AbstractCegarLoop]: Abstraction has 5612 states and 9489 transitions. [2024-11-11 20:49:43,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 9489 transitions. [2024-11-11 20:49:43,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:49:43,663 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:43,663 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:43,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:49:43,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 569175479, now seen corresponding path program 1 times [2024-11-11 20:49:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:43,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402491632] [2024-11-11 20:49:43,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:43,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:43,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:43,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:49:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:49:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:43,766 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:49:43,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:43,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402491632] [2024-11-11 20:49:43,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402491632] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:43,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:43,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:43,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175737039] [2024-11-11 20:49:43,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:43,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:43,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:43,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:43,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:43,768 INFO L87 Difference]: Start difference. First operand 5612 states and 9489 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:45,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:45,322 INFO L93 Difference]: Finished difference Result 13962 states and 24067 transitions. [2024-11-11 20:49:45,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:45,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-11 20:49:45,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:45,419 INFO L225 Difference]: With dead ends: 13962 [2024-11-11 20:49:45,420 INFO L226 Difference]: Without dead ends: 9489 [2024-11-11 20:49:45,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:45,434 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1299 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 463 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1314 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 2065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 463 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:45,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1314 Valid, 849 Invalid, 2065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [463 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9489 states. [2024-11-11 20:49:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9489 to 9295. [2024-11-11 20:49:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9295 states, 7690 states have (on average 1.6093628088426528) internal successors, (12376), 7697 states have internal predecessors, (12376), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2024-11-11 20:49:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9295 states to 9295 states and 15725 transitions. [2024-11-11 20:49:45,809 INFO L78 Accepts]: Start accepts. Automaton has 9295 states and 15725 transitions. Word has length 126 [2024-11-11 20:49:45,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:45,809 INFO L471 AbstractCegarLoop]: Abstraction has 9295 states and 15725 transitions. [2024-11-11 20:49:45,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:45,810 INFO L276 IsEmpty]: Start isEmpty. Operand 9295 states and 15725 transitions. [2024-11-11 20:49:45,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:49:45,833 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:45,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:45,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:49:45,834 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:45,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 856995474, now seen corresponding path program 1 times [2024-11-11 20:49:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:45,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634130141] [2024-11-11 20:49:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:45,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:45,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:45,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:49:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:49:45,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:45,997 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:49:45,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:45,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634130141] [2024-11-11 20:49:45,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634130141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:45,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:45,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:45,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92529751] [2024-11-11 20:49:45,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:45,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:45,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:45,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:45,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:45,999 INFO L87 Difference]: Start difference. First operand 9295 states and 15725 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:47,722 INFO L93 Difference]: Finished difference Result 24146 states and 41613 transitions. [2024-11-11 20:49:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:47,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-11 20:49:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:47,789 INFO L225 Difference]: With dead ends: 24146 [2024-11-11 20:49:47,790 INFO L226 Difference]: Without dead ends: 16442 [2024-11-11 20:49:47,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:47,821 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 1331 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1346 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 468 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:47,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1346 Valid, 877 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [468 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:47,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16442 states. [2024-11-11 20:49:48,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16442 to 16248. [2024-11-11 20:49:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16248 states, 13440 states have (on average 1.6010416666666667) internal successors, (21518), 13447 states have internal predecessors, (21518), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2024-11-11 20:49:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 27417 transitions. [2024-11-11 20:49:48,620 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 27417 transitions. Word has length 127 [2024-11-11 20:49:48,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:48,621 INFO L471 AbstractCegarLoop]: Abstraction has 16248 states and 27417 transitions. [2024-11-11 20:49:48,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:48,621 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 27417 transitions. [2024-11-11 20:49:48,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:49:48,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:48,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:48,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:49:48,658 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:48,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1671109704, now seen corresponding path program 1 times [2024-11-11 20:49:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:48,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103818296] [2024-11-11 20:49:48,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:49:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:49:48,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:48,790 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:49:48,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:48,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103818296] [2024-11-11 20:49:48,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103818296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:48,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:48,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813066078] [2024-11-11 20:49:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:48,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:48,792 INFO L87 Difference]: Start difference. First operand 16248 states and 27417 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:50,549 INFO L93 Difference]: Finished difference Result 43112 states and 74212 transitions. [2024-11-11 20:49:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:50,549 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-11-11 20:49:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:50,665 INFO L225 Difference]: With dead ends: 43112 [2024-11-11 20:49:50,665 INFO L226 Difference]: Without dead ends: 29097 [2024-11-11 20:49:50,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:50,709 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1401 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:50,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 815 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29097 states. [2024-11-11 20:49:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29097 to 28903. [2024-11-11 20:49:51,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28903 states, 24056 states have (on average 1.5971898902560693) internal successors, (38422), 24063 states have internal predecessors, (38422), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2024-11-11 20:49:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28903 states to 28903 states and 48673 transitions. [2024-11-11 20:49:52,003 INFO L78 Accepts]: Start accepts. Automaton has 28903 states and 48673 transitions. Word has length 128 [2024-11-11 20:49:52,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:52,005 INFO L471 AbstractCegarLoop]: Abstraction has 28903 states and 48673 transitions. [2024-11-11 20:49:52,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:52,005 INFO L276 IsEmpty]: Start isEmpty. Operand 28903 states and 48673 transitions. [2024-11-11 20:49:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:49:52,040 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:52,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:52,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:49:52,041 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:52,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:52,043 INFO L85 PathProgramCache]: Analyzing trace with hash 104454580, now seen corresponding path program 1 times [2024-11-11 20:49:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924672476] [2024-11-11 20:49:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:52,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:52,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:52,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:49:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:49:52,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:49:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:52,185 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:49:52,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:52,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924672476] [2024-11-11 20:49:52,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924672476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:52,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:52,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:52,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265329821] [2024-11-11 20:49:52,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:52,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:52,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:52,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:52,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:52,189 INFO L87 Difference]: Start difference. First operand 28903 states and 48673 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:54,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:54,819 INFO L93 Difference]: Finished difference Result 78874 states and 134971 transitions. [2024-11-11 20:49:54,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:54,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-11 20:49:54,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:55,056 INFO L225 Difference]: With dead ends: 78874 [2024-11-11 20:49:55,057 INFO L226 Difference]: Without dead ends: 52976 [2024-11-11 20:49:55,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:49:55,138 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 1422 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 484 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 484 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:55,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 819 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [484 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:55,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52976 states. [2024-11-11 20:49:57,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52976 to 52782. [2024-11-11 20:49:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52782 states, 44220 states have (on average 1.5918362731795568) internal successors, (70391), 44227 states have internal predecessors, (70391), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2024-11-11 20:49:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52782 states to 52782 states and 88604 transitions. [2024-11-11 20:49:57,565 INFO L78 Accepts]: Start accepts. Automaton has 52782 states and 88604 transitions. Word has length 129 [2024-11-11 20:49:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:57,567 INFO L471 AbstractCegarLoop]: Abstraction has 52782 states and 88604 transitions. [2024-11-11 20:49:57,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:57,567 INFO L276 IsEmpty]: Start isEmpty. Operand 52782 states and 88604 transitions. [2024-11-11 20:49:57,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:49:57,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:57,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:57,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:49:57,602 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:57,603 INFO L85 PathProgramCache]: Analyzing trace with hash 395645336, now seen corresponding path program 1 times [2024-11-11 20:49:57,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:57,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308527936] [2024-11-11 20:49:57,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:57,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:57,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:57,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:49:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:57,700 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:49:57,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308527936] [2024-11-11 20:49:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308527936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:57,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361648396] [2024-11-11 20:49:57,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:57,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:57,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:57,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:57,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:57,702 INFO L87 Difference]: Start difference. First operand 52782 states and 88604 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:50:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:01,183 INFO L93 Difference]: Finished difference Result 98645 states and 169158 transitions. [2024-11-11 20:50:01,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:50:01,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-11 20:50:01,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:01,626 INFO L225 Difference]: With dead ends: 98645 [2024-11-11 20:50:01,626 INFO L226 Difference]: Without dead ends: 98435 [2024-11-11 20:50:01,675 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 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:50:01,676 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1277 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 1612 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1291 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 1612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:01,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1291 Valid, 821 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 1612 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:50:01,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98435 states. [2024-11-11 20:50:05,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98435 to 98241. [2024-11-11 20:50:05,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98241 states, 82880 states have (on average 1.5849541505791507) internal successors, (131361), 82887 states have internal predecessors, (131361), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2024-11-11 20:50:06,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98241 states to 98241 states and 164218 transitions. [2024-11-11 20:50:06,158 INFO L78 Accepts]: Start accepts. Automaton has 98241 states and 164218 transitions. Word has length 130 [2024-11-11 20:50:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 98241 states and 164218 transitions. [2024-11-11 20:50:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:50:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 98241 states and 164218 transitions. [2024-11-11 20:50:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:50:06,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:06,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:50:06,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:50:06,206 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:06,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1107027763, now seen corresponding path program 1 times [2024-11-11 20:50:06,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:06,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660004690] [2024-11-11 20:50:06,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:06,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:50:06,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:50:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:50:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:50:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:50:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:06,613 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:50:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:06,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660004690] [2024-11-11 20:50:06,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660004690] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:06,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:06,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:50:06,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728650121] [2024-11-11 20:50:06,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:06,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:50:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:06,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:50:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:50:06,615 INFO L87 Difference]: Start difference. First operand 98241 states and 164218 transitions. Second operand has 18 states, 16 states have (on average 5.625) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-11 20:50:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:17,167 INFO L93 Difference]: Finished difference Result 196793 states and 340735 transitions. [2024-11-11 20:50:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 20:50:17,167 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.625) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 131 [2024-11-11 20:50:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:18,415 INFO L225 Difference]: With dead ends: 196793 [2024-11-11 20:50:18,416 INFO L226 Difference]: Without dead ends: 196589 [2024-11-11 20:50:18,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:50:18,480 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 5267 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 9341 mSolverCounterSat, 1898 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5267 SdHoareTripleChecker+Valid, 2996 SdHoareTripleChecker+Invalid, 11239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1898 IncrementalHoareTripleChecker+Valid, 9341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:18,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5267 Valid, 2996 Invalid, 11239 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1898 Valid, 9341 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-11 20:50:18,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196589 states.