./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.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 a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:58:44,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:58:44,265 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:58:44,272 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:58:44,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:58:44,307 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:58:44,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:58:44,308 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:58:44,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:58:44,310 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:58:44,311 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:58:44,311 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:58:44,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:58:44,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:58:44,314 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:58:44,314 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:58:44,314 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:58:44,315 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:58:44,315 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:58:44,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:58:44,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:58:44,319 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:58:44,319 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:58:44,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:58:44,320 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:58:44,320 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:58:44,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:58:44,321 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:58:44,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:58:44,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:58:44,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:58:44,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:58:44,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:58:44,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:58:44,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:58:44,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:58:44,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:58:44,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:58:44,325 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:58:44,325 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:58:44,325 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:58:44,326 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:58:44,326 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 -> a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f [2024-10-14 02:58:44,568 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:58:44,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:58:44,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:58:44,595 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:58:44,596 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:58:44,597 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-10-14 02:58:46,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:58:46,331 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:58:46,332 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-10-14 02:58:46,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e269aff/36b3ad920b6f4db59b4578ec8a1ef84a/FLAG8c87c30a6 [2024-10-14 02:58:46,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e269aff/36b3ad920b6f4db59b4578ec8a1ef84a [2024-10-14 02:58:46,367 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:58:46,368 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:58:46,369 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:58:46,369 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:58:46,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:58:46,376 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:58:46" (1/1) ... [2024-10-14 02:58:46,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@563c311d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:46, skipping insertion in model container [2024-10-14 02:58:46,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:58:46" (1/1) ... [2024-10-14 02:58:46,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:58:46,982 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-10-14 02:58:47,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:58:47,115 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:58:47,127 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2024-10-14 02:58:47,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [90] [2024-10-14 02:58:47,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [456] [2024-10-14 02:58:47,129 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2024-10-14 02:58:47,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [512] [2024-10-14 02:58:47,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1591] [2024-10-14 02:58:47,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1871] [2024-10-14 02:58:47,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1880] [2024-10-14 02:58:47,130 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2093] [2024-10-14 02:58:47,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2504] [2024-10-14 02:58:47,131 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2758] [2024-10-14 02:58:47,194 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-10-14 02:58:47,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:58:47,258 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:58:47,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47 WrapperNode [2024-10-14 02:58:47,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:58:47,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:58:47,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:58:47,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:58:47,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,293 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,343 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 53, calls inlined = 44, statements flattened = 843 [2024-10-14 02:58:47,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:58:47,344 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:58:47,344 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:58:47,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:58:47,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,372 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,397 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-14 02:58:47,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,446 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:58:47,461 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:58:47,461 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:58:47,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:58:47,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (1/1) ... [2024-10-14 02:58:47,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:58:47,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:47,492 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-10-14 02:58:47,494 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-10-14 02:58:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-14 02:58:47,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-14 02:58:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-14 02:58:47,530 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-14 02:58:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-14 02:58:47,530 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-14 02:58:47,530 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-14 02:58:47,530 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-14 02:58:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-14 02:58:47,531 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-14 02:58:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-14 02:58:47,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-14 02:58:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-14 02:58:47,531 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-14 02:58:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-14 02:58:47,531 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-14 02:58:47,531 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-14 02:58:47,531 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-14 02:58:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:58:47,532 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-14 02:58:47,532 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-14 02:58:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-14 02:58:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-14 02:58:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-14 02:58:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-14 02:58:47,533 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-14 02:58:47,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:58:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 02:58:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 02:58:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 02:58:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-14 02:58:47,534 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-14 02:58:47,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:58:47,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:58:47,704 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:58:47,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:58:48,381 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2024-10-14 02:58:48,381 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:58:48,447 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:58:48,449 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:58:48,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:58:48 BoogieIcfgContainer [2024-10-14 02:58:48,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:58:48,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:58:48,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:58:48,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:58:48,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:58:46" (1/3) ... [2024-10-14 02:58:48,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce9cbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:58:48, skipping insertion in model container [2024-10-14 02:58:48,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:58:47" (2/3) ... [2024-10-14 02:58:48,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ce9cbc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:58:48, skipping insertion in model container [2024-10-14 02:58:48,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:58:48" (3/3) ... [2024-10-14 02:58:48,459 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product13.cil.c [2024-10-14 02:58:48,476 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:58:48,477 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:58:48,568 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:58:48,577 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;@6f553a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:58:48,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:58:48,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 196 states have internal predecessors, (313), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-14 02:58:48,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-14 02:58:48,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:48,604 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:48,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:48,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash 607664055, now seen corresponding path program 1 times [2024-10-14 02:58:48,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:48,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914903587] [2024-10-14 02:58:48,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:48,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:49,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:58:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:58:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:58:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 02:58:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:58:49,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:58:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:58:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:58:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,315 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 02:58:49,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:49,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914903587] [2024-10-14 02:58:49,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914903587] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:58:49,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747505379] [2024-10-14 02:58:49,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:49,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:58:49,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:49,319 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-10-14 02:58:49,321 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-10-14 02:58:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:49,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 02:58:49,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:58:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 02:58:49,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:58:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747505379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:49,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:58:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-14 02:58:49,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096122457] [2024-10-14 02:58:49,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:49,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:58:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:49,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:58:49,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:58:49,723 INFO L87 Difference]: Start difference. First operand has 249 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 196 states have internal predecessors, (313), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:49,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:49,804 INFO L93 Difference]: Finished difference Result 357 states and 544 transitions. [2024-10-14 02:58:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:58:49,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-14 02:58:49,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:49,821 INFO L225 Difference]: With dead ends: 357 [2024-10-14 02:58:49,821 INFO L226 Difference]: Without dead ends: 246 [2024-10-14 02:58:49,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:58:49,828 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:49,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:58:49,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-14 02:58:49,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-14 02:58:49,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.59375) internal successors, (306), 193 states have internal predecessors, (306), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 02:58:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 379 transitions. [2024-10-14 02:58:49,889 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 379 transitions. Word has length 83 [2024-10-14 02:58:49,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:49,890 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 379 transitions. [2024-10-14 02:58:49,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 379 transitions. [2024-10-14 02:58:49,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-14 02:58:49,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:49,897 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:49,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:58:50,098 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-10-14 02:58:50,098 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:50,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:50,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1089372931, now seen corresponding path program 1 times [2024-10-14 02:58:50,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:50,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712594862] [2024-10-14 02:58:50,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:50,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:58:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:58:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:58:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-14 02:58:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:58:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:58:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:58:50,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:58:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-14 02:58:50,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712594862] [2024-10-14 02:58:50,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712594862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:58:50,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639315743] [2024-10-14 02:58:50,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:58:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:50,392 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-10-14 02:58:50,393 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-10-14 02:58:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:50,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 02:58:50,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:58:50,694 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 02:58:50,698 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:58:50,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639315743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:50,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:58:50,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-14 02:58:50,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669288930] [2024-10-14 02:58:50,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:50,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:58:50,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:50,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:58:50,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:58:50,703 INFO L87 Difference]: Start difference. First operand 246 states and 379 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:50,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:50,764 INFO L93 Difference]: Finished difference Result 353 states and 531 transitions. [2024-10-14 02:58:50,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:58:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-14 02:58:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:50,768 INFO L225 Difference]: With dead ends: 353 [2024-10-14 02:58:50,768 INFO L226 Difference]: Without dead ends: 248 [2024-10-14 02:58:50,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 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-10-14 02:58:50,770 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:50,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 739 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:58:50,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-14 02:58:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-14 02:58:50,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.5876288659793814) internal successors, (308), 195 states have internal predecessors, (308), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-14 02:58:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 381 transitions. [2024-10-14 02:58:50,798 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 381 transitions. Word has length 84 [2024-10-14 02:58:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:50,799 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 381 transitions. [2024-10-14 02:58:50,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 381 transitions. [2024-10-14 02:58:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-14 02:58:50,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:50,802 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-14 02:58:50,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:58:51,002 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-10-14 02:58:51,003 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:51,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:51,003 INFO L85 PathProgramCache]: Analyzing trace with hash -870597441, now seen corresponding path program 1 times [2024-10-14 02:58:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:51,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755631268] [2024-10-14 02:58:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:51,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:51,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:58:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:58:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:58:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-14 02:58:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 02:58:51,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:58:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:58:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:58:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,262 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:58:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755631268] [2024-10-14 02:58:51,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755631268] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:58:51,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574838449] [2024-10-14 02:58:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:58:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:51,270 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-10-14 02:58:51,272 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-10-14 02:58:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:58:51,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:58:51,546 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-14 02:58:51,546 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:58:51,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574838449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:51,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:58:51,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-14 02:58:51,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902987789] [2024-10-14 02:58:51,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:51,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:58:51,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:58:51,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:58:51,549 INFO L87 Difference]: Start difference. First operand 248 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:51,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:51,591 INFO L93 Difference]: Finished difference Result 522 states and 814 transitions. [2024-10-14 02:58:51,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:58:51,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-14 02:58:51,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:51,595 INFO L225 Difference]: With dead ends: 522 [2024-10-14 02:58:51,595 INFO L226 Difference]: Without dead ends: 296 [2024-10-14 02:58:51,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:58:51,597 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 95 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:51,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 707 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:58:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-14 02:58:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2024-10-14 02:58:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 226 states have (on average 1.5973451327433628) internal successors, (361), 227 states have internal predecessors, (361), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-14 02:58:51,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 456 transitions. [2024-10-14 02:58:51,623 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 456 transitions. Word has length 89 [2024-10-14 02:58:51,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:51,624 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 456 transitions. [2024-10-14 02:58:51,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:58:51,624 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 456 transitions. [2024-10-14 02:58:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-14 02:58:51,626 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:51,627 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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] [2024-10-14 02:58:51,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:58:51,830 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-10-14 02:58:51,831 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:51,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:51,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1674334953, now seen corresponding path program 1 times [2024-10-14 02:58:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:51,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101617600] [2024-10-14 02:58:51,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:51,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:51,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 02:58:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 02:58:52,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:58:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-14 02:58:52,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:58:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:58:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:58:52,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:58:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,026 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:58:52,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101617600] [2024-10-14 02:58:52,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101617600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:58:52,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185561657] [2024-10-14 02:58:52,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:52,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:58:52,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:52,030 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-10-14 02:58:52,031 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-10-14 02:58:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,272 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 02:58:52,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:58:52,355 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 02:58:52,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:58:52,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185561657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:52,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:58:52,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-14 02:58:52,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910225871] [2024-10-14 02:58:52,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:52,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:58:52,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:52,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:58:52,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:58:52,359 INFO L87 Difference]: Start difference. First operand 291 states and 456 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:52,447 INFO L93 Difference]: Finished difference Result 577 states and 906 transitions. [2024-10-14 02:58:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:58:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-14 02:58:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:52,452 INFO L225 Difference]: With dead ends: 577 [2024-10-14 02:58:52,452 INFO L226 Difference]: Without dead ends: 293 [2024-10-14 02:58:52,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:58:52,455 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 2 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:52,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1437 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:58:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-14 02:58:52,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-10-14 02:58:52,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.5947136563876652) internal successors, (362), 229 states have internal predecessors, (362), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2024-10-14 02:58:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 459 transitions. [2024-10-14 02:58:52,472 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 459 transitions. Word has length 90 [2024-10-14 02:58:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:52,472 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 459 transitions. [2024-10-14 02:58:52,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 459 transitions. [2024-10-14 02:58:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-14 02:58:52,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:52,474 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:52,491 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-10-14 02:58:52,675 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-10-14 02:58:52,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:52,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:52,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1310549939, now seen corresponding path program 1 times [2024-10-14 02:58:52,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:52,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766220995] [2024-10-14 02:58:52,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:52,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-14 02:58:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-14 02:58:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:58:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-14 02:58:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:58:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:58:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:58:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:58:52,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766220995] [2024-10-14 02:58:52,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766220995] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:58:52,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052567850] [2024-10-14 02:58:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:52,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:58:52,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:58:52,904 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-10-14 02:58:52,906 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-10-14 02:58:53,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 02:58:53,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:58:53,198 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 02:58:53,202 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:58:53,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052567850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:53,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 02:58:53,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-14 02:58:53,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750792103] [2024-10-14 02:58:53,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:53,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:58:53,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:53,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:58:53,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:58:53,207 INFO L87 Difference]: Start difference. First operand 293 states and 459 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:53,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:53,301 INFO L93 Difference]: Finished difference Result 579 states and 911 transitions. [2024-10-14 02:58:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:58:53,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-14 02:58:53,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:53,304 INFO L225 Difference]: With dead ends: 579 [2024-10-14 02:58:53,305 INFO L226 Difference]: Without dead ends: 295 [2024-10-14 02:58:53,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:58:53,307 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 2 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:53,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1423 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:58:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-14 02:58:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-14 02:58:53,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 228 states have (on average 1.5921052631578947) internal successors, (363), 231 states have internal predecessors, (363), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-10-14 02:58:53,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 465 transitions. [2024-10-14 02:58:53,332 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 465 transitions. Word has length 91 [2024-10-14 02:58:53,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:53,332 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 465 transitions. [2024-10-14 02:58:53,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:53,333 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 465 transitions. [2024-10-14 02:58:53,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-14 02:58:53,334 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:53,335 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:53,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:58:53,536 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-10-14 02:58:53,536 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:53,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:53,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1685829560, now seen corresponding path program 1 times [2024-10-14 02:58:53,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:53,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248303733] [2024-10-14 02:58:53,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:53,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-14 02:58:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 02:58:53,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:58:53,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:58:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:58:53,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:58:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:53,707 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:58:53,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248303733] [2024-10-14 02:58:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248303733] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:58:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321432136] [2024-10-14 02:58:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:53,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:58:53,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:58:53,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:58:53,709 INFO L87 Difference]: Start difference. First operand 295 states and 465 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:54,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:54,947 INFO L93 Difference]: Finished difference Result 628 states and 999 transitions. [2024-10-14 02:58:54,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:54,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-10-14 02:58:54,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:54,951 INFO L225 Difference]: With dead ends: 628 [2024-10-14 02:58:54,951 INFO L226 Difference]: Without dead ends: 352 [2024-10-14 02:58:54,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:58:54,953 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 593 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:54,953 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 817 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:58:54,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-14 02:58:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 295. [2024-10-14 02:58:54,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 228 states have (on average 1.5921052631578947) internal successors, (363), 231 states have internal predecessors, (363), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2024-10-14 02:58:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 464 transitions. [2024-10-14 02:58:54,978 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 464 transitions. Word has length 92 [2024-10-14 02:58:54,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:54,979 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 464 transitions. [2024-10-14 02:58:54,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 464 transitions. [2024-10-14 02:58:54,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-14 02:58:54,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:54,981 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:54,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 02:58:54,981 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:54,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:54,982 INFO L85 PathProgramCache]: Analyzing trace with hash 202497312, now seen corresponding path program 2 times [2024-10-14 02:58:54,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:54,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665981110] [2024-10-14 02:58:54,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:54,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 02:58:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 02:58:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:58:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:58:55,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:58:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:58:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:55,153 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-14 02:58:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665981110] [2024-10-14 02:58:55,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665981110] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:55,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:55,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 02:58:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244980128] [2024-10-14 02:58:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:55,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:58:55,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:58:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:58:55,155 INFO L87 Difference]: Start difference. First operand 295 states and 464 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:56,385 INFO L93 Difference]: Finished difference Result 630 states and 1002 transitions. [2024-10-14 02:58:56,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 02:58:56,386 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-14 02:58:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:56,389 INFO L225 Difference]: With dead ends: 630 [2024-10-14 02:58:56,389 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 02:58:56,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:58:56,391 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 590 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:56,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 817 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:58:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 02:58:56,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-10-14 02:58:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 229 states have (on average 1.5895196506550218) internal successors, (364), 233 states have internal predecessors, (364), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (55), 47 states have call predecessors, (55), 47 states have call successors, (55) [2024-10-14 02:58:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 467 transitions. [2024-10-14 02:58:56,414 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 467 transitions. Word has length 93 [2024-10-14 02:58:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:56,415 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 467 transitions. [2024-10-14 02:58:56,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-14 02:58:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 467 transitions. [2024-10-14 02:58:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-14 02:58:56,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:56,417 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:56,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 02:58:56,417 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:56,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:56,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1838214813, now seen corresponding path program 1 times [2024-10-14 02:58:56,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:56,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239200555] [2024-10-14 02:58:56,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:56,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:56,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 02:58:56,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:58:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:58:56,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:58:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:58:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:58:56,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:56,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239200555] [2024-10-14 02:58:56,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239200555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:56,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:56,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:58:56,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708005950] [2024-10-14 02:58:56,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:56,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:58:56,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:56,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:58:56,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:58:56,624 INFO L87 Difference]: Start difference. First operand 297 states and 467 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 02:58:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:58:58,346 INFO L93 Difference]: Finished difference Result 628 states and 997 transitions. [2024-10-14 02:58:58,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:58:58,346 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2024-10-14 02:58:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:58:58,350 INFO L225 Difference]: With dead ends: 628 [2024-10-14 02:58:58,351 INFO L226 Difference]: Without dead ends: 354 [2024-10-14 02:58:58,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:58:58,353 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 593 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:58:58,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1174 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 02:58:58,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-14 02:58:58,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-10-14 02:58:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 229 states have (on average 1.5895196506550218) internal successors, (364), 233 states have internal predecessors, (364), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-10-14 02:58:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 466 transitions. [2024-10-14 02:58:58,378 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 466 transitions. Word has length 94 [2024-10-14 02:58:58,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:58:58,379 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 466 transitions. [2024-10-14 02:58:58,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 02:58:58,379 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 466 transitions. [2024-10-14 02:58:58,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-14 02:58:58,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:58:58,382 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:58:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 02:58:58,383 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:58:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:58:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1039142886, now seen corresponding path program 2 times [2024-10-14 02:58:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:58:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738606237] [2024-10-14 02:58:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:58:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:58:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:58:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:58:58,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:58:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:58:58,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:58:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:58:58,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-14 02:58:58,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:58:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:58:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:58:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:58:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:58:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-14 02:58:58,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:58:58,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738606237] [2024-10-14 02:58:58,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738606237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:58:58,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:58:58,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:58:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81309906] [2024-10-14 02:58:58,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:58:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:58:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:58:58,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:58:58,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:58:58,595 INFO L87 Difference]: Start difference. First operand 297 states and 466 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 02:59:00,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:00,211 INFO L93 Difference]: Finished difference Result 630 states and 1003 transitions. [2024-10-14 02:59:00,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:59:00,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2024-10-14 02:59:00,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:00,214 INFO L225 Difference]: With dead ends: 630 [2024-10-14 02:59:00,214 INFO L226 Difference]: Without dead ends: 356 [2024-10-14 02:59:00,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:59:00,218 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 590 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:00,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1175 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-14 02:59:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-14 02:59:00,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 299. [2024-10-14 02:59:00,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 230 states have (on average 1.5869565217391304) internal successors, (365), 235 states have internal predecessors, (365), 48 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (59), 47 states have call predecessors, (59), 47 states have call successors, (59) [2024-10-14 02:59:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2024-10-14 02:59:00,242 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 95 [2024-10-14 02:59:00,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:00,243 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2024-10-14 02:59:00,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-14 02:59:00,243 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2024-10-14 02:59:00,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-14 02:59:00,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:00,245 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:00,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 02:59:00,245 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:00,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1936030050, now seen corresponding path program 1 times [2024-10-14 02:59:00,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:00,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886877644] [2024-10-14 02:59:00,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:00,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-14 02:59:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:59:00,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:59:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:59:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886877644] [2024-10-14 02:59:00,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886877644] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:59:00,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698466963] [2024-10-14 02:59:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:00,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:59:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:59:00,382 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-10-14 02:59:00,383 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-10-14 02:59:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:00,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 02:59:00,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:59:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:00,670 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:59:00,756 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:00,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698466963] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:59:00,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:59:00,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-14 02:59:00,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667461543] [2024-10-14 02:59:00,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:59:00,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:59:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:00,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:59:00,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:00,761 INFO L87 Difference]: Start difference. First operand 299 states and 472 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:59:01,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:01,990 INFO L93 Difference]: Finished difference Result 771 states and 1288 transitions. [2024-10-14 02:59:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:59:01,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2024-10-14 02:59:01,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:01,996 INFO L225 Difference]: With dead ends: 771 [2024-10-14 02:59:01,996 INFO L226 Difference]: Without dead ends: 666 [2024-10-14 02:59:01,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:59:01,998 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 868 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:01,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1056 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-14 02:59:02,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-14 02:59:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 594. [2024-10-14 02:59:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 461 states have (on average 1.6377440347071583) internal successors, (755), 466 states have internal predecessors, (755), 112 states have call successors, (112), 16 states have call predecessors, (112), 20 states have return successors, (133), 111 states have call predecessors, (133), 111 states have call successors, (133) [2024-10-14 02:59:02,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1000 transitions. [2024-10-14 02:59:02,036 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1000 transitions. Word has length 96 [2024-10-14 02:59:02,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:02,037 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 1000 transitions. [2024-10-14 02:59:02,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-14 02:59:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1000 transitions. [2024-10-14 02:59:02,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-14 02:59:02,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:02,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:02,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:59:02,242 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-10-14 02:59:02,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:02,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1120568895, now seen corresponding path program 1 times [2024-10-14 02:59:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328904166] [2024-10-14 02:59:02,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:02,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:02,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:02,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-14 02:59:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:59:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:59:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:59:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:02,348 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:02,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328904166] [2024-10-14 02:59:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328904166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221078610] [2024-10-14 02:59:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:02,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:02,350 INFO L87 Difference]: Start difference. First operand 594 states and 1000 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:03,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:03,289 INFO L93 Difference]: Finished difference Result 1482 states and 2557 transitions. [2024-10-14 02:59:03,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:03,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-14 02:59:03,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:03,295 INFO L225 Difference]: With dead ends: 1482 [2024-10-14 02:59:03,296 INFO L226 Difference]: Without dead ends: 948 [2024-10-14 02:59:03,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:03,298 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 682 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:03,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 608 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 02:59:03,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-14 02:59:03,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 886. [2024-10-14 02:59:03,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 689 states have (on average 1.6429608127721336) internal successors, (1132), 694 states have internal predecessors, (1132), 176 states have call successors, (176), 16 states have call predecessors, (176), 20 states have return successors, (207), 175 states have call predecessors, (207), 175 states have call successors, (207) [2024-10-14 02:59:03,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1515 transitions. [2024-10-14 02:59:03,344 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1515 transitions. Word has length 102 [2024-10-14 02:59:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:03,344 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1515 transitions. [2024-10-14 02:59:03,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:03,344 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1515 transitions. [2024-10-14 02:59:03,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-14 02:59:03,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:03,349 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:03,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 02:59:03,349 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:03,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:03,350 INFO L85 PathProgramCache]: Analyzing trace with hash 434925720, now seen corresponding path program 1 times [2024-10-14 02:59:03,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:03,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196867673] [2024-10-14 02:59:03,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:03,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:03,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:03,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:03,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 02:59:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 02:59:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-14 02:59:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:59:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:59:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:03,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196867673] [2024-10-14 02:59:03,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196867673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:03,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:03,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051491690] [2024-10-14 02:59:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:03,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:03,451 INFO L87 Difference]: Start difference. First operand 886 states and 1515 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:04,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:04,413 INFO L93 Difference]: Finished difference Result 2179 states and 3784 transitions. [2024-10-14 02:59:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-14 02:59:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:04,422 INFO L225 Difference]: With dead ends: 2179 [2024-10-14 02:59:04,422 INFO L226 Difference]: Without dead ends: 1403 [2024-10-14 02:59:04,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:04,426 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 680 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:04,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 573 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 02:59:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-10-14 02:59:04,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1341. [2024-10-14 02:59:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1049 states have (on average 1.6453765490943757) internal successors, (1726), 1054 states have internal predecessors, (1726), 271 states have call successors, (271), 16 states have call predecessors, (271), 20 states have return successors, (302), 270 states have call predecessors, (302), 270 states have call successors, (302) [2024-10-14 02:59:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2299 transitions. [2024-10-14 02:59:04,482 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2299 transitions. Word has length 103 [2024-10-14 02:59:04,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:04,482 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 2299 transitions. [2024-10-14 02:59:04,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2299 transitions. [2024-10-14 02:59:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 02:59:04,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:04,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:04,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 02:59:04,490 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:04,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:04,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1379442561, now seen corresponding path program 1 times [2024-10-14 02:59:04,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:04,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703162501] [2024-10-14 02:59:04,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:04,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 02:59:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 02:59:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 02:59:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:59:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:59:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:04,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:04,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703162501] [2024-10-14 02:59:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703162501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:04,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870269601] [2024-10-14 02:59:04,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:04,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:04,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:04,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:04,590 INFO L87 Difference]: Start difference. First operand 1341 states and 2299 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:05,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:05,521 INFO L93 Difference]: Finished difference Result 3197 states and 5596 transitions. [2024-10-14 02:59:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:05,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-14 02:59:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:05,537 INFO L225 Difference]: With dead ends: 3197 [2024-10-14 02:59:05,537 INFO L226 Difference]: Without dead ends: 2086 [2024-10-14 02:59:05,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:05,542 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 678 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1056 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:05,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 570 Invalid, 1056 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 02:59:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2024-10-14 02:59:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2024. [2024-10-14 02:59:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1609 states have (on average 1.6482287134866376) internal successors, (2652), 1614 states have internal predecessors, (2652), 394 states have call successors, (394), 16 states have call predecessors, (394), 20 states have return successors, (441), 393 states have call predecessors, (441), 393 states have call successors, (441) [2024-10-14 02:59:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3487 transitions. [2024-10-14 02:59:05,631 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3487 transitions. Word has length 104 [2024-10-14 02:59:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:05,632 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3487 transitions. [2024-10-14 02:59:05,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3487 transitions. [2024-10-14 02:59:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 02:59:05,640 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:05,640 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:05,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 02:59:05,641 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash 126478775, now seen corresponding path program 1 times [2024-10-14 02:59:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362180516] [2024-10-14 02:59:05,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:05,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 02:59:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 02:59:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 02:59:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:59:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:59:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:05,789 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:05,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:05,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362180516] [2024-10-14 02:59:05,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362180516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:05,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:05,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:05,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96322560] [2024-10-14 02:59:05,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:05,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:05,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:05,791 INFO L87 Difference]: Start difference. First operand 2024 states and 3487 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:06,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:06,737 INFO L93 Difference]: Finished difference Result 4767 states and 8401 transitions. [2024-10-14 02:59:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:06,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-14 02:59:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:06,757 INFO L225 Difference]: With dead ends: 4767 [2024-10-14 02:59:06,758 INFO L226 Difference]: Without dead ends: 3170 [2024-10-14 02:59:06,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:06,766 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 676 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:06,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 570 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 02:59:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2024-10-14 02:59:06,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3108. [2024-10-14 02:59:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 2514 states have (on average 1.6499602227525856) internal successors, (4148), 2519 states have internal predecessors, (4148), 573 states have call successors, (573), 16 states have call predecessors, (573), 20 states have return successors, (646), 572 states have call predecessors, (646), 572 states have call successors, (646) [2024-10-14 02:59:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 5367 transitions. [2024-10-14 02:59:06,928 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 5367 transitions. Word has length 105 [2024-10-14 02:59:06,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:06,929 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 5367 transitions. [2024-10-14 02:59:06,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:06,929 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 5367 transitions. [2024-10-14 02:59:06,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-14 02:59:06,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:06,938 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:06,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 02:59:06,938 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:06,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 362355683, now seen corresponding path program 1 times [2024-10-14 02:59:06,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:06,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5527410] [2024-10-14 02:59:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-14 02:59:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 02:59:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 02:59:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:59:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-14 02:59:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:07,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:07,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5527410] [2024-10-14 02:59:07,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5527410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:07,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:07,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:07,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395426660] [2024-10-14 02:59:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:07,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:07,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:07,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:07,042 INFO L87 Difference]: Start difference. First operand 3108 states and 5367 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:07,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:07,900 INFO L93 Difference]: Finished difference Result 7598 states and 13413 transitions. [2024-10-14 02:59:07,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:07,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-14 02:59:07,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:07,936 INFO L225 Difference]: With dead ends: 7598 [2024-10-14 02:59:07,936 INFO L226 Difference]: Without dead ends: 5140 [2024-10-14 02:59:07,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:07,950 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 674 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:07,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 601 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 02:59:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2024-10-14 02:59:08,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 5078. [2024-10-14 02:59:08,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4108 states have (on average 1.6404576436222005) internal successors, (6739), 4113 states have internal predecessors, (6739), 949 states have call successors, (949), 16 states have call predecessors, (949), 20 states have return successors, (1066), 948 states have call predecessors, (1066), 948 states have call successors, (1066) [2024-10-14 02:59:08,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 8754 transitions. [2024-10-14 02:59:08,270 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 8754 transitions. Word has length 106 [2024-10-14 02:59:08,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:08,271 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 8754 transitions. [2024-10-14 02:59:08,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:08,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 8754 transitions. [2024-10-14 02:59:08,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-14 02:59:08,283 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:08,283 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:08,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 02:59:08,283 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:08,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:08,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1327070803, now seen corresponding path program 1 times [2024-10-14 02:59:08,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:08,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324395081] [2024-10-14 02:59:08,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:08,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-14 02:59:08,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-14 02:59:08,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:59:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 02:59:08,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 02:59:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:08,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:08,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324395081] [2024-10-14 02:59:08,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324395081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:08,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:08,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:08,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143812785] [2024-10-14 02:59:08,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:08,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:08,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:08,391 INFO L87 Difference]: Start difference. First operand 5078 states and 8754 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:09,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:09,346 INFO L93 Difference]: Finished difference Result 12579 states and 22161 transitions. [2024-10-14 02:59:09,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:09,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-14 02:59:09,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:09,396 INFO L225 Difference]: With dead ends: 12579 [2024-10-14 02:59:09,397 INFO L226 Difference]: Without dead ends: 8517 [2024-10-14 02:59:09,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:09,412 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 672 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:09,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 571 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 02:59:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2024-10-14 02:59:09,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 8455. [2024-10-14 02:59:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 6879 states have (on average 1.6371565634539904) internal successors, (11262), 6884 states have internal predecessors, (11262), 1555 states have call successors, (1555), 16 states have call predecessors, (1555), 20 states have return successors, (1750), 1554 states have call predecessors, (1750), 1554 states have call successors, (1750) [2024-10-14 02:59:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 14567 transitions. [2024-10-14 02:59:09,843 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 14567 transitions. Word has length 107 [2024-10-14 02:59:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:09,845 INFO L471 AbstractCegarLoop]: Abstraction has 8455 states and 14567 transitions. [2024-10-14 02:59:09,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:09,846 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 14567 transitions. [2024-10-14 02:59:09,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:59:09,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:09,867 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 02:59:09,867 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:09,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:09,868 INFO L85 PathProgramCache]: Analyzing trace with hash -16444223, now seen corresponding path program 1 times [2024-10-14 02:59:09,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:09,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194119104] [2024-10-14 02:59:09,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:09,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 02:59:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:59:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-14 02:59:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 02:59:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-14 02:59:09,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:09,990 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:09,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:09,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194119104] [2024-10-14 02:59:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194119104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:09,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:09,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:09,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752034633] [2024-10-14 02:59:09,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:09,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:09,993 INFO L87 Difference]: Start difference. First operand 8455 states and 14567 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:10,992 INFO L93 Difference]: Finished difference Result 21931 states and 38560 transitions. [2024-10-14 02:59:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-14 02:59:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:11,060 INFO L225 Difference]: With dead ends: 21931 [2024-10-14 02:59:11,060 INFO L226 Difference]: Without dead ends: 14901 [2024-10-14 02:59:11,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:11,091 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 670 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:11,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 612 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 02:59:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14901 states. [2024-10-14 02:59:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14901 to 14839. [2024-10-14 02:59:11,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14839 states, 12060 states have (on average 1.626782752902156) internal successors, (19619), 12065 states have internal predecessors, (19619), 2758 states have call successors, (2758), 16 states have call predecessors, (2758), 20 states have return successors, (3097), 2757 states have call predecessors, (3097), 2757 states have call successors, (3097) [2024-10-14 02:59:11,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14839 states to 14839 states and 25474 transitions. [2024-10-14 02:59:11,769 INFO L78 Accepts]: Start accepts. Automaton has 14839 states and 25474 transitions. Word has length 108 [2024-10-14 02:59:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 14839 states and 25474 transitions. [2024-10-14 02:59:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 14839 states and 25474 transitions. [2024-10-14 02:59:11,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-14 02:59:11,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:11,793 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:11,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 02:59:11,793 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:11,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:11,794 INFO L85 PathProgramCache]: Analyzing trace with hash -29769774, now seen corresponding path program 1 times [2024-10-14 02:59:11,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:11,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281238505] [2024-10-14 02:59:11,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:11,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:59:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 02:59:11,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-14 02:59:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 02:59:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:59:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:11,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:11,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281238505] [2024-10-14 02:59:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281238505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:11,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378271956] [2024-10-14 02:59:11,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:11,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:11,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:11,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:11,891 INFO L87 Difference]: Start difference. First operand 14839 states and 25474 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:13,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:13,238 INFO L93 Difference]: Finished difference Result 39290 states and 68946 transitions. [2024-10-14 02:59:13,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:13,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-10-14 02:59:13,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:13,465 INFO L225 Difference]: With dead ends: 39290 [2024-10-14 02:59:13,465 INFO L226 Difference]: Without dead ends: 26468 [2024-10-14 02:59:13,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:13,500 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 668 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:13,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 571 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 02:59:13,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26468 states. [2024-10-14 02:59:14,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26468 to 26406. [2024-10-14 02:59:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26406 states, 21588 states have (on average 1.6223828052621827) internal successors, (35024), 21593 states have internal predecessors, (35024), 4797 states have call successors, (4797), 16 states have call predecessors, (4797), 20 states have return successors, (5410), 4796 states have call predecessors, (5410), 4796 states have call successors, (5410) [2024-10-14 02:59:14,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26406 states to 26406 states and 45231 transitions. [2024-10-14 02:59:14,693 INFO L78 Accepts]: Start accepts. Automaton has 26406 states and 45231 transitions. Word has length 109 [2024-10-14 02:59:14,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:14,694 INFO L471 AbstractCegarLoop]: Abstraction has 26406 states and 45231 transitions. [2024-10-14 02:59:14,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 26406 states and 45231 transitions. [2024-10-14 02:59:14,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-14 02:59:14,719 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:14,719 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:14,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 02:59:14,720 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:14,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:14,720 INFO L85 PathProgramCache]: Analyzing trace with hash 369312063, now seen corresponding path program 1 times [2024-10-14 02:59:14,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446901227] [2024-10-14 02:59:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:14,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 02:59:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 02:59:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 02:59:14,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:59:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:14,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 02:59:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:15,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:15,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446901227] [2024-10-14 02:59:15,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446901227] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:15,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:15,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:15,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122537395] [2024-10-14 02:59:15,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:15,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:15,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:15,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:15,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:15,004 INFO L87 Difference]: Start difference. First operand 26406 states and 45231 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:16,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:16,711 INFO L93 Difference]: Finished difference Result 71902 states and 125370 transitions. [2024-10-14 02:59:16,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:16,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-14 02:59:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:17,035 INFO L225 Difference]: With dead ends: 71902 [2024-10-14 02:59:17,035 INFO L226 Difference]: Without dead ends: 48228 [2024-10-14 02:59:17,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:17,096 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 666 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:17,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 581 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 02:59:17,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2024-10-14 02:59:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 48166. [2024-10-14 02:59:19,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48166 states, 39633 states have (on average 1.6167335301390255) internal successors, (64076), 39638 states have internal predecessors, (64076), 8512 states have call successors, (8512), 16 states have call predecessors, (8512), 20 states have return successors, (9657), 8511 states have call predecessors, (9657), 8511 states have call successors, (9657) [2024-10-14 02:59:19,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48166 states to 48166 states and 82245 transitions. [2024-10-14 02:59:19,984 INFO L78 Accepts]: Start accepts. Automaton has 48166 states and 82245 transitions. Word has length 110 [2024-10-14 02:59:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:19,985 INFO L471 AbstractCegarLoop]: Abstraction has 48166 states and 82245 transitions. [2024-10-14 02:59:19,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 48166 states and 82245 transitions. [2024-10-14 02:59:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 02:59:20,017 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:20,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:20,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 02:59:20,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:20,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1128571666, now seen corresponding path program 1 times [2024-10-14 02:59:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:20,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472439818] [2024-10-14 02:59:20,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:20,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:20,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-14 02:59:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 02:59:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 02:59:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 02:59:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-14 02:59:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:20,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472439818] [2024-10-14 02:59:20,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472439818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:20,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:20,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:59:20,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223596249] [2024-10-14 02:59:20,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:20,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:59:20,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:20,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:59:20,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:59:20,112 INFO L87 Difference]: Start difference. First operand 48166 states and 82245 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:22,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:22,654 INFO L93 Difference]: Finished difference Result 89621 states and 156734 transitions. [2024-10-14 02:59:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:59:22,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-14 02:59:22,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:23,014 INFO L225 Difference]: With dead ends: 89621 [2024-10-14 02:59:23,014 INFO L226 Difference]: Without dead ends: 89516 [2024-10-14 02:59:23,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:59:23,061 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 661 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:23,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 583 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 02:59:23,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89516 states. [2024-10-14 02:59:25,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89516 to 89454. [2024-10-14 02:59:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89454 states, 74122 states have (on average 1.609589595531691) internal successors, (119306), 74127 states have internal predecessors, (119306), 15311 states have call successors, (15311), 16 states have call predecessors, (15311), 20 states have return successors, (17502), 15310 states have call predecessors, (17502), 15310 states have call successors, (17502) [2024-10-14 02:59:26,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89454 states to 89454 states and 152119 transitions. [2024-10-14 02:59:26,898 INFO L78 Accepts]: Start accepts. Automaton has 89454 states and 152119 transitions. Word has length 111 [2024-10-14 02:59:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:26,898 INFO L471 AbstractCegarLoop]: Abstraction has 89454 states and 152119 transitions. [2024-10-14 02:59:26,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:26,899 INFO L276 IsEmpty]: Start isEmpty. Operand 89454 states and 152119 transitions. [2024-10-14 02:59:26,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-14 02:59:26,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:26,921 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:26,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 02:59:26,921 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:26,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:26,922 INFO L85 PathProgramCache]: Analyzing trace with hash 215070784, now seen corresponding path program 1 times [2024-10-14 02:59:26,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:26,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965788283] [2024-10-14 02:59:26,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:26,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:59:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:59:27,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:59:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:59:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:27,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:27,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965788283] [2024-10-14 02:59:27,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965788283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:27,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:27,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 02:59:27,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757868976] [2024-10-14 02:59:27,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:27,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 02:59:27,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:27,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 02:59:27,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 02:59:27,124 INFO L87 Difference]: Start difference. First operand 89454 states and 152119 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:30,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:30,795 INFO L93 Difference]: Finished difference Result 89757 states and 155850 transitions. [2024-10-14 02:59:30,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 02:59:30,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-10-14 02:59:30,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:31,163 INFO L225 Difference]: With dead ends: 89757 [2024-10-14 02:59:31,164 INFO L226 Difference]: Without dead ends: 89661 [2024-10-14 02:59:31,211 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-10-14 02:59:31,212 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1007 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:31,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 811 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 02:59:31,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89661 states. [2024-10-14 02:59:34,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89661 to 89552. [2024-10-14 02:59:34,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89552 states, 74200 states have (on average 1.609487870619946) internal successors, (119424), 74205 states have internal predecessors, (119424), 15321 states have call successors, (15321), 24 states have call predecessors, (15321), 30 states have return successors, (17515), 15322 states have call predecessors, (17515), 15319 states have call successors, (17515) [2024-10-14 02:59:34,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89552 states to 89552 states and 152260 transitions. [2024-10-14 02:59:34,631 INFO L78 Accepts]: Start accepts. Automaton has 89552 states and 152260 transitions. Word has length 112 [2024-10-14 02:59:34,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:34,632 INFO L471 AbstractCegarLoop]: Abstraction has 89552 states and 152260 transitions. [2024-10-14 02:59:34,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:34,632 INFO L276 IsEmpty]: Start isEmpty. Operand 89552 states and 152260 transitions. [2024-10-14 02:59:34,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-14 02:59:34,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:34,658 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:34,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 02:59:34,659 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:34,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:34,660 INFO L85 PathProgramCache]: Analyzing trace with hash -264129549, now seen corresponding path program 1 times [2024-10-14 02:59:34,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:34,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390816620] [2024-10-14 02:59:34,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:34,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:34,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:34,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:59:34,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 02:59:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-14 02:59:34,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 02:59:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:34,922 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:34,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:34,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390816620] [2024-10-14 02:59:34,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390816620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:34,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:34,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 02:59:34,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492747882] [2024-10-14 02:59:34,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:34,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 02:59:34,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:34,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 02:59:34,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-14 02:59:34,924 INFO L87 Difference]: Start difference. First operand 89552 states and 152260 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-14 02:59:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:39,052 INFO L93 Difference]: Finished difference Result 90037 states and 156299 transitions. [2024-10-14 02:59:39,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 02:59:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 113 [2024-10-14 02:59:39,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:39,394 INFO L225 Difference]: With dead ends: 90037 [2024-10-14 02:59:39,395 INFO L226 Difference]: Without dead ends: 89707 [2024-10-14 02:59:39,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-10-14 02:59:39,447 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1072 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:39,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1440 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 02:59:39,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89707 states. [2024-10-14 02:59:42,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89707 to 89589. [2024-10-14 02:59:42,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89589 states, 74229 states have (on average 1.6093979441997064) internal successors, (119464), 74237 states have internal predecessors, (119464), 15327 states have call successors, (15327), 25 states have call predecessors, (15327), 32 states have return successors, (17523), 15326 states have call predecessors, (17523), 15325 states have call successors, (17523) [2024-10-14 02:59:42,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89589 states to 89589 states and 152314 transitions. [2024-10-14 02:59:42,563 INFO L78 Accepts]: Start accepts. Automaton has 89589 states and 152314 transitions. Word has length 113 [2024-10-14 02:59:42,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:42,563 INFO L471 AbstractCegarLoop]: Abstraction has 89589 states and 152314 transitions. [2024-10-14 02:59:42,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-14 02:59:42,564 INFO L276 IsEmpty]: Start isEmpty. Operand 89589 states and 152314 transitions. [2024-10-14 02:59:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-14 02:59:42,595 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:42,596 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:42,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 02:59:42,596 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:42,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1263317386, now seen corresponding path program 1 times [2024-10-14 02:59:42,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:42,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540158662] [2024-10-14 02:59:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:42,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:59:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:59:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:59:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:59:42,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-14 02:59:42,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:42,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540158662] [2024-10-14 02:59:42,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540158662] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:42,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:42,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 02:59:42,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154480437] [2024-10-14 02:59:42,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:42,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 02:59:42,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:42,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 02:59:42,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-14 02:59:42,831 INFO L87 Difference]: Start difference. First operand 89589 states and 152314 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:46,440 INFO L93 Difference]: Finished difference Result 90121 states and 156393 transitions. [2024-10-14 02:59:46,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 02:59:46,441 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-10-14 02:59:46,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:46,777 INFO L225 Difference]: With dead ends: 90121 [2024-10-14 02:59:46,777 INFO L226 Difference]: Without dead ends: 90053 [2024-10-14 02:59:46,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-14 02:59:46,825 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1123 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:46,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1192 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 02:59:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90053 states. [2024-10-14 02:59:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90053 to 89832. [2024-10-14 02:59:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89832 states, 74422 states have (on average 1.609067211308484) internal successors, (119750), 74433 states have internal predecessors, (119750), 15352 states have call successors, (15352), 41 states have call predecessors, (15352), 57 states have return successors, (17563), 15357 states have call predecessors, (17563), 15348 states have call successors, (17563) [2024-10-14 02:59:50,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89832 states to 89832 states and 152665 transitions. [2024-10-14 02:59:50,031 INFO L78 Accepts]: Start accepts. Automaton has 89832 states and 152665 transitions. Word has length 116 [2024-10-14 02:59:50,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:59:50,031 INFO L471 AbstractCegarLoop]: Abstraction has 89832 states and 152665 transitions. [2024-10-14 02:59:50,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-14 02:59:50,031 INFO L276 IsEmpty]: Start isEmpty. Operand 89832 states and 152665 transitions. [2024-10-14 02:59:50,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-14 02:59:50,063 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:59:50,063 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:59:50,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 02:59:50,063 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:59:50,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:59:50,064 INFO L85 PathProgramCache]: Analyzing trace with hash -243949583, now seen corresponding path program 1 times [2024-10-14 02:59:50,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:59:50,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626893930] [2024-10-14 02:59:50,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:59:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:59:50,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 02:59:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 02:59:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:59:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-14 02:59:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-14 02:59:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 02:59:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 02:59:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-14 02:59:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:59:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 02:59:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 02:59:50,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:59:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-14 02:59:50,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:59:50,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626893930] [2024-10-14 02:59:50,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626893930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:59:50,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:59:50,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-14 02:59:50,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059026573] [2024-10-14 02:59:50,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:59:50,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 02:59:50,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:59:50,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 02:59:50,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:59:50,344 INFO L87 Difference]: Start difference. First operand 89832 states and 152665 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-14 02:59:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:59:54,411 INFO L93 Difference]: Finished difference Result 90243 states and 156571 transitions. [2024-10-14 02:59:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 02:59:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 117 [2024-10-14 02:59:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:59:54,691 INFO L225 Difference]: With dead ends: 90243 [2024-10-14 02:59:54,692 INFO L226 Difference]: Without dead ends: 90039 [2024-10-14 02:59:54,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-10-14 02:59:54,732 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1247 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 02:59:54,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1369 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 02:59:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90039 states.