./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product15.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product15.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 3a5e24a2ecd4f1b82ac6c9f3672db1eec2c6845bb52ab38fa9dd83ecce424f6f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:12:58,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:12:58,223 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:12:58,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:12:58,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:12:58,250 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:12:58,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:12:58,251 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:12:58,251 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:12:58,252 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:12:58,252 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:12:58,252 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:12:58,253 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:12:58,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:12:58,254 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:12:58,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:12:58,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:12:58,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:12:58,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:12:58,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:12:58,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:12:58,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:12:58,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:12:58,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:12:58,257 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:12:58,258 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:12:58,258 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:12:58,258 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:12:58,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:12:58,259 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:12:58,259 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:12:58,259 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:12:58,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:12:58,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:12:58,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:12:58,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:12:58,261 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:12:58,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:12:58,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:12:58,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:12:58,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:12:58,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:12:58,262 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 -> 3a5e24a2ecd4f1b82ac6c9f3672db1eec2c6845bb52ab38fa9dd83ecce424f6f [2024-11-09 23:12:58,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:12:58,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:12:58,547 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:12:58,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:12:58,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:12:58,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product15.cil.c [2024-11-09 23:12:59,989 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:13:00,343 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:13:00,344 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product15.cil.c [2024-11-09 23:13:00,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede571ab2/0b00fdd7edeb4f93acdcfc257328b808/FLAG1b4048aa4 [2024-11-09 23:13:00,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ede571ab2/0b00fdd7edeb4f93acdcfc257328b808 [2024-11-09 23:13:00,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:13:00,383 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:13:00,384 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:13:00,384 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:13:00,389 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:13:00,390 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:13:00" (1/1) ... [2024-11-09 23:13:00,390 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7558c31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:00, skipping insertion in model container [2024-11-09 23:13:00,391 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:13:00" (1/1) ... [2024-11-09 23:13:00,451 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:13:00,967 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product15.cil.c[51080,51093] [2024-11-09 23:13:01,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:13:01,061 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:13:01,071 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-09 23:13:01,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [97] [2024-11-09 23:13:01,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [509] [2024-11-09 23:13:01,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [734] [2024-11-09 23:13:01,073 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [752] [2024-11-09 23:13:01,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1118] [2024-11-09 23:13:01,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2198] [2024-11-09 23:13:01,074 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2207] [2024-11-09 23:13:01,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2479] [2024-11-09 23:13:01,075 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2521] [2024-11-09 23:13:01,076 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2796] [2024-11-09 23:13:01,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product15.cil.c[51080,51093] [2024-11-09 23:13:01,151 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:13:01,184 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:13:01,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01 WrapperNode [2024-11-09 23:13:01,185 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:13:01,186 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:13:01,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:13:01,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:13:01,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,217 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,269 INFO L138 Inliner]: procedures = 126, calls = 185, calls flagged for inlining = 55, calls inlined = 46, statements flattened = 891 [2024-11-09 23:13:01,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:13:01,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:13:01,270 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:13:01,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:13:01,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,317 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-09 23:13:01,317 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,317 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,349 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,382 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:13:01,383 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:13:01,384 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:13:01,384 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:13:01,384 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (1/1) ... [2024-11-09 23:13:01,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:13:01,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:01,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:13:01,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:13:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-09 23:13:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-09 23:13:01,485 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-09 23:13:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-09 23:13:01,486 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:13:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:13:01,486 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:13:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:13:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-09 23:13:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-09 23:13:01,487 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:13:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:13:01,488 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:13:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:13:01,489 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:13:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:13:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:13:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:13:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:13:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:13:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:13:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:13:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:13:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:13:01,491 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:13:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-09 23:13:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-09 23:13:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:13:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:13:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 23:13:01,492 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 23:13:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:13:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:13:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:13:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:13:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:13:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:13:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:13:01,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:13:01,709 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:13:01,711 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:13:02,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2175-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2024-11-09 23:13:02,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1740-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~26#1; [2024-11-09 23:13:02,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2451-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~38#1; [2024-11-09 23:13:02,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2056-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~31#1; [2024-11-09 23:13:02,016 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1693-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2024-11-09 23:13:02,052 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L227: #res := ~retValue_acc~5; [2024-11-09 23:13:02,153 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1787-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2024-11-09 23:13:02,153 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1832: #res#1 := ~retValue_acc~28#1; [2024-11-09 23:13:02,187 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2897-1: createEmail_#res#1 := createEmail_~retValue_acc~43#1; [2024-11-09 23:13:02,199 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L342: #res := ~retValue_acc~8; [2024-11-09 23:13:02,449 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L94-1: valid_product_#res#1 := valid_product_~retValue_acc~1#1; [2024-11-09 23:13:02,449 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2002-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2024-11-09 23:13:02,449 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1895-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2024-11-09 23:13:02,449 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2408-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2024-11-09 23:13:02,449 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2417-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2024-11-09 23:13:02,450 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2426-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2024-11-09 23:13:02,456 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: #res := ~retValue_acc~4; [2024-11-09 23:13:02,484 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L379: #res := ~retValue_acc~9; [2024-11-09 23:13:02,589 INFO L? ?]: Removed 379 outVars from TransFormulas that were not future-live. [2024-11-09 23:13:02,589 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:13:02,610 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:13:02,610 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:13:02,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:13:02 BoogieIcfgContainer [2024-11-09 23:13:02,611 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:13:02,613 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:13:02,613 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:13:02,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:13:02,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:13:00" (1/3) ... [2024-11-09 23:13:02,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8c9010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:13:02, skipping insertion in model container [2024-11-09 23:13:02,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:13:01" (2/3) ... [2024-11-09 23:13:02,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8c9010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:13:02, skipping insertion in model container [2024-11-09 23:13:02,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:13:02" (3/3) ... [2024-11-09 23:13:02,618 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product15.cil.c [2024-11-09 23:13:02,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:13:02,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:13:02,704 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:13:02,710 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;@51b3e296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:13:02,710 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:13:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 299 states, 238 states have (on average 1.5210084033613445) internal successors, (362), 242 states have internal predecessors, (362), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-09 23:13:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 23:13:02,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:02,735 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:02,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:02,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:02,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2106516446, now seen corresponding path program 1 times [2024-11-09 23:13:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715149490] [2024-11-09 23:13:02,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:02,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:13:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:13:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:13:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:13:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:13:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:13:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 23:13:03,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:13:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,457 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:13:03,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715149490] [2024-11-09 23:13:03,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715149490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:03,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32072254] [2024-11-09 23:13:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:03,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:03,466 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:03,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:13:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:03,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 920 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:13:03,792 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:03,815 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:13:03,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:13:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32072254] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:13:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 23:13:03,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836597692] [2024-11-09 23:13:03,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:03,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:13:03,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:13:03,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:13:03,864 INFO L87 Difference]: Start difference. First operand has 299 states, 238 states have (on average 1.5210084033613445) internal successors, (362), 242 states have internal predecessors, (362), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:03,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:03,916 INFO L93 Difference]: Finished difference Result 433 states and 635 transitions. [2024-11-09 23:13:03,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:13:03,920 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2024-11-09 23:13:03,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:03,944 INFO L225 Difference]: With dead ends: 433 [2024-11-09 23:13:03,944 INFO L226 Difference]: Without dead ends: 291 [2024-11-09 23:13:03,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:13:03,954 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:03,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:13:03,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-09 23:13:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-09 23:13:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 231 states have (on average 1.5151515151515151) internal successors, (350), 234 states have internal predecessors, (350), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-09 23:13:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 433 transitions. [2024-11-09 23:13:04,038 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 433 transitions. Word has length 90 [2024-11-09 23:13:04,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:04,041 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 433 transitions. [2024-11-09 23:13:04,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:04,042 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 433 transitions. [2024-11-09 23:13:04,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-09 23:13:04,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:04,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:04,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 23:13:04,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 23:13:04,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:04,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2106455128, now seen corresponding path program 1 times [2024-11-09 23:13:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:04,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775088862] [2024-11-09 23:13:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:04,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:13:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:13:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:13:04,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:13:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 23:13:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:13:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 23:13:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:13:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,625 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:13:04,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:04,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775088862] [2024-11-09 23:13:04,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775088862] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:04,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445225872] [2024-11-09 23:13:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:04,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:04,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:04,628 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:04,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:13:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:04,904 INFO L255 TraceCheckSpWp]: Trace formula consists of 922 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:13:04,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:13:04,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:13:04,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445225872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:04,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:13:04,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:13:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791026238] [2024-11-09 23:13:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:04,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:13:04,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:04,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:13:04,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:13:04,941 INFO L87 Difference]: Start difference. First operand 291 states and 433 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:04,981 INFO L93 Difference]: Finished difference Result 422 states and 615 transitions. [2024-11-09 23:13:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:13:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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 92 [2024-11-09 23:13:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:04,987 INFO L225 Difference]: With dead ends: 422 [2024-11-09 23:13:04,987 INFO L226 Difference]: Without dead ends: 294 [2024-11-09 23:13:04,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:13:04,989 INFO L432 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:04,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 862 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:13:04,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-09 23:13:05,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2024-11-09 23:13:05,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 234 states have (on average 1.5085470085470085) internal successors, (353), 237 states have internal predecessors, (353), 42 states have call successors, (42), 17 states have call predecessors, (42), 17 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-09 23:13:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 436 transitions. [2024-11-09 23:13:05,022 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 436 transitions. Word has length 92 [2024-11-09 23:13:05,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:05,022 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 436 transitions. [2024-11-09 23:13:05,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:05,023 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 436 transitions. [2024-11-09 23:13:05,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 23:13:05,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:05,025 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:05,039 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 23:13:05,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 23:13:05,226 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:05,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:05,227 INFO L85 PathProgramCache]: Analyzing trace with hash 109057816, now seen corresponding path program 1 times [2024-11-09 23:13:05,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:05,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826525893] [2024-11-09 23:13:05,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:05,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:13:05,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:13:05,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:13:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:13:05,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:13:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:13:05,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:13:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:13:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:13:05,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:05,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826525893] [2024-11-09 23:13:05,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826525893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:05,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589121184] [2024-11-09 23:13:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:05,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:05,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:05,489 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:05,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:13:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:05,753 INFO L255 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:13:05,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:13:05,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:13:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589121184] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:05,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:13:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:13:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612621505] [2024-11-09 23:13:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:05,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:13:05,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:13:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:13:05,785 INFO L87 Difference]: Start difference. First operand 294 states and 436 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:05,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:05,820 INFO L93 Difference]: Finished difference Result 627 states and 940 transitions. [2024-11-09 23:13:05,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:13:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 102 [2024-11-09 23:13:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:05,824 INFO L225 Difference]: With dead ends: 627 [2024-11-09 23:13:05,825 INFO L226 Difference]: Without dead ends: 361 [2024-11-09 23:13:05,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:13:05,827 INFO L432 NwaCegarLoop]: 452 mSDtfsCounter, 117 mSDsluCounter, 387 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:05,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 839 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:13:05,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2024-11-09 23:13:05,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 353. [2024-11-09 23:13:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 282 states have (on average 1.5070921985815602) internal successors, (425), 285 states have internal predecessors, (425), 53 states have call successors, (53), 17 states have call predecessors, (53), 17 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 23:13:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 530 transitions. [2024-11-09 23:13:05,848 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 530 transitions. Word has length 102 [2024-11-09 23:13:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:05,848 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 530 transitions. [2024-11-09 23:13:05,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:05,849 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 530 transitions. [2024-11-09 23:13:05,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 23:13:05,851 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:05,851 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:05,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:13:06,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:06,052 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:06,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:06,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1959346824, now seen corresponding path program 1 times [2024-11-09 23:13:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448153459] [2024-11-09 23:13:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:06,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:13:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:13:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:13:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:13:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:13:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-09 23:13:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:13:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:13:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,340 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:13:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448153459] [2024-11-09 23:13:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448153459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962090869] [2024-11-09 23:13:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:06,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:06,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:06,343 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:06,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:13:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:06,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:13:06,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:06,704 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:13:06,704 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:13:06,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962090869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:06,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:13:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:13:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538671539] [2024-11-09 23:13:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:13:06,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:06,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:13:06,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:13:06,708 INFO L87 Difference]: Start difference. First operand 353 states and 530 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:06,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:06,773 INFO L93 Difference]: Finished difference Result 697 states and 1050 transitions. [2024-11-09 23:13:06,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:13:06,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 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 103 [2024-11-09 23:13:06,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:06,777 INFO L225 Difference]: With dead ends: 697 [2024-11-09 23:13:06,778 INFO L226 Difference]: Without dead ends: 355 [2024-11-09 23:13:06,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:13:06,780 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 2 mSDsluCounter, 1264 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1689 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:06,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1689 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:13:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2024-11-09 23:13:06,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2024-11-09 23:13:06,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 283 states have (on average 1.5053003533568905) internal successors, (426), 287 states have internal predecessors, (426), 53 states have call successors, (53), 17 states have call predecessors, (53), 18 states have return successors, (54), 52 states have call predecessors, (54), 52 states have call successors, (54) [2024-11-09 23:13:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 533 transitions. [2024-11-09 23:13:06,811 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 533 transitions. Word has length 103 [2024-11-09 23:13:06,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:06,812 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 533 transitions. [2024-11-09 23:13:06,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 533 transitions. [2024-11-09 23:13:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 23:13:06,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:06,817 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:06,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:13:07,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:07,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:07,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:07,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1581215852, now seen corresponding path program 1 times [2024-11-09 23:13:07,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:07,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403805293] [2024-11-09 23:13:07,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:07,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:07,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:13:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:13:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:13:07,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:13:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:13:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:13:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:13:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:13:07,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:07,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403805293] [2024-11-09 23:13:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403805293] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:07,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1536358891] [2024-11-09 23:13:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:07,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:07,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:07,292 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:07,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:13:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:07,546 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:13:07,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:07,604 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:13:07,605 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:13:07,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1536358891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:07,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:13:07,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 23:13:07,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805729220] [2024-11-09 23:13:07,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:07,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:13:07,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:07,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:13:07,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:13:07,607 INFO L87 Difference]: Start difference. First operand 355 states and 533 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:07,669 INFO L93 Difference]: Finished difference Result 699 states and 1055 transitions. [2024-11-09 23:13:07,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:13:07,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 104 [2024-11-09 23:13:07,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:07,673 INFO L225 Difference]: With dead ends: 699 [2024-11-09 23:13:07,673 INFO L226 Difference]: Without dead ends: 357 [2024-11-09 23:13:07,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:13:07,675 INFO L432 NwaCegarLoop]: 423 mSDtfsCounter, 2 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:07,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1675 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:13:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-09 23:13:07,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2024-11-09 23:13:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 289 states have internal predecessors, (427), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-09 23:13:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 539 transitions. [2024-11-09 23:13:07,689 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 539 transitions. Word has length 104 [2024-11-09 23:13:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:07,691 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 539 transitions. [2024-11-09 23:13:07,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 539 transitions. [2024-11-09 23:13:07,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-09 23:13:07,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:07,694 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] [2024-11-09 23:13:07,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 23:13:07,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:07,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:07,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1320602671, now seen corresponding path program 1 times [2024-11-09 23:13:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232919839] [2024-11-09 23:13:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:13:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:13:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:13:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 23:13:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:13:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:13:08,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:13:08,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:08,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232919839] [2024-11-09 23:13:08,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232919839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:08,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:08,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:13:08,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238804280] [2024-11-09 23:13:08,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:08,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:13:08,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:08,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:13:08,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:13:08,114 INFO L87 Difference]: Start difference. First operand 357 states and 539 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:09,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:09,725 INFO L93 Difference]: Finished difference Result 785 states and 1190 transitions. [2024-11-09 23:13:09,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:13:09,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2024-11-09 23:13:09,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:09,730 INFO L225 Difference]: With dead ends: 785 [2024-11-09 23:13:09,730 INFO L226 Difference]: Without dead ends: 451 [2024-11-09 23:13:09,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:13:09,732 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 870 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:09,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1188 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 23:13:09,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2024-11-09 23:13:09,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 357. [2024-11-09 23:13:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 284 states have (on average 1.5035211267605635) internal successors, (427), 289 states have internal predecessors, (427), 53 states have call successors, (53), 17 states have call predecessors, (53), 19 states have return successors, (58), 52 states have call predecessors, (58), 52 states have call successors, (58) [2024-11-09 23:13:09,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 538 transitions. [2024-11-09 23:13:09,760 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 538 transitions. Word has length 105 [2024-11-09 23:13:09,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:09,761 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 538 transitions. [2024-11-09 23:13:09,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:09,761 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 538 transitions. [2024-11-09 23:13:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 23:13:09,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:09,763 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-11-09 23:13:09,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:13:09,764 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:09,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:09,764 INFO L85 PathProgramCache]: Analyzing trace with hash 2066700759, now seen corresponding path program 2 times [2024-11-09 23:13:09,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:09,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488971856] [2024-11-09 23:13:09,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:09,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:09,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:13:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:13:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:13:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:13:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:13:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:13:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:09,970 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:13:09,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488971856] [2024-11-09 23:13:09,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488971856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:09,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:09,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:13:09,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411087746] [2024-11-09 23:13:09,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:09,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:13:09,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:09,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:13:09,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:13:09,972 INFO L87 Difference]: Start difference. First operand 357 states and 538 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:11,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:11,516 INFO L93 Difference]: Finished difference Result 787 states and 1193 transitions. [2024-11-09 23:13:11,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:13:11,517 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 106 [2024-11-09 23:13:11,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:11,520 INFO L225 Difference]: With dead ends: 787 [2024-11-09 23:13:11,520 INFO L226 Difference]: Without dead ends: 453 [2024-11-09 23:13:11,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:13:11,522 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 866 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1841 mSolverCounterSat, 246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 246 IncrementalHoareTripleChecker+Valid, 1841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:11,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1188 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [246 Valid, 1841 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:13:11,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-09 23:13:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 359. [2024-11-09 23:13:11,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 285 states have (on average 1.5017543859649123) internal successors, (428), 291 states have internal predecessors, (428), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (60), 52 states have call predecessors, (60), 52 states have call successors, (60) [2024-11-09 23:13:11,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 541 transitions. [2024-11-09 23:13:11,546 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 541 transitions. Word has length 106 [2024-11-09 23:13:11,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:11,546 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 541 transitions. [2024-11-09 23:13:11,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-09 23:13:11,546 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 541 transitions. [2024-11-09 23:13:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-09 23:13:11,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:11,548 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] [2024-11-09 23:13:11,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:13:11,548 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:11,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash -861651436, now seen corresponding path program 1 times [2024-11-09 23:13:11,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:11,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678540950] [2024-11-09 23:13:11,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:11,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:11,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:13:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:13:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:13:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:13:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:13:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:11,792 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:13:11,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:11,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678540950] [2024-11-09 23:13:11,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678540950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:11,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:11,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:13:11,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212240103] [2024-11-09 23:13:11,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:11,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:13:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:11,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:13:11,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:13:11,794 INFO L87 Difference]: Start difference. First operand 359 states and 541 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:13:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:13,690 INFO L93 Difference]: Finished difference Result 785 states and 1188 transitions. [2024-11-09 23:13:13,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:13:13,691 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 107 [2024-11-09 23:13:13,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:13,694 INFO L225 Difference]: With dead ends: 785 [2024-11-09 23:13:13,697 INFO L226 Difference]: Without dead ends: 453 [2024-11-09 23:13:13,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:13:13,698 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 870 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3047 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 3300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 3047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:13,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1645 Invalid, 3300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 3047 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 23:13:13,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2024-11-09 23:13:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 359. [2024-11-09 23:13:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 285 states have (on average 1.5017543859649123) internal successors, (428), 291 states have internal predecessors, (428), 53 states have call successors, (53), 17 states have call predecessors, (53), 20 states have return successors, (59), 52 states have call predecessors, (59), 52 states have call successors, (59) [2024-11-09 23:13:13,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 540 transitions. [2024-11-09 23:13:13,733 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 540 transitions. Word has length 107 [2024-11-09 23:13:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:13,736 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 540 transitions. [2024-11-09 23:13:13,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:13:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 540 transitions. [2024-11-09 23:13:13,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-09 23:13:13,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:13,738 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-11-09 23:13:13,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:13:13,739 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:13,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:13,739 INFO L85 PathProgramCache]: Analyzing trace with hash 621230209, now seen corresponding path program 2 times [2024-11-09 23:13:13,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:13,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55161993] [2024-11-09 23:13:13,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:13,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:13,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:13:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-09 23:13:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:13:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:13:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:13:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:13:13,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:13,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55161993] [2024-11-09 23:13:13,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55161993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:13,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:13,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:13:13,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468324007] [2024-11-09 23:13:13,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:13,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:13:13,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:13,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:13:13,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:13:13,982 INFO L87 Difference]: Start difference. First operand 359 states and 540 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:13:15,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:15,855 INFO L93 Difference]: Finished difference Result 787 states and 1194 transitions. [2024-11-09 23:13:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:13:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 108 [2024-11-09 23:13:15,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:15,860 INFO L225 Difference]: With dead ends: 787 [2024-11-09 23:13:15,860 INFO L226 Difference]: Without dead ends: 455 [2024-11-09 23:13:15,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:13:15,862 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 866 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3092 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 867 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 3092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:15,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [867 Valid, 1646 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 3092 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 23:13:15,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2024-11-09 23:13:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 361. [2024-11-09 23:13:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 286 states have (on average 1.5) internal successors, (429), 293 states have internal predecessors, (429), 53 states have call successors, (53), 17 states have call predecessors, (53), 21 states have return successors, (64), 52 states have call predecessors, (64), 52 states have call successors, (64) [2024-11-09 23:13:15,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 546 transitions. [2024-11-09 23:13:15,895 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 546 transitions. Word has length 108 [2024-11-09 23:13:15,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:15,896 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 546 transitions. [2024-11-09 23:13:15,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (13), 6 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-09 23:13:15,896 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 546 transitions. [2024-11-09 23:13:15,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:13:15,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:15,898 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] [2024-11-09 23:13:15,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:13:15,898 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:15,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:15,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1382282103, now seen corresponding path program 1 times [2024-11-09 23:13:15,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:15,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728151687] [2024-11-09 23:13:15,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:15,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:13:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 23:13:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:13:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:13:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:13:16,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-09 23:13:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728151687] [2024-11-09 23:13:16,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728151687] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:13:16,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962619733] [2024-11-09 23:13:16,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:13:16,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:13:16,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:13:16,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:16,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:13:16,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:13:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:16,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:13:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962619733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:13:16,508 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:13:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-09 23:13:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168442178] [2024-11-09 23:13:16,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:13:16,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 23:13:16,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:16,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 23:13:16,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:13:16,510 INFO L87 Difference]: Start difference. First operand 361 states and 546 transitions. Second operand has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 11 states have internal predecessors, (127), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 23:13:19,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:19,216 INFO L93 Difference]: Finished difference Result 1187 states and 1876 transitions. [2024-11-09 23:13:19,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 23:13:19,217 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 11 states have internal predecessors, (127), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) Word has length 109 [2024-11-09 23:13:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:19,225 INFO L225 Difference]: With dead ends: 1187 [2024-11-09 23:13:19,226 INFO L226 Difference]: Without dead ends: 858 [2024-11-09 23:13:19,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-09 23:13:19,228 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 1801 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 3842 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1818 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 4372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 3842 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:19,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1818 Valid, 2017 Invalid, 4372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 3842 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 23:13:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2024-11-09 23:13:19,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 740. [2024-11-09 23:13:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 740 states, 601 states have (on average 1.5158069883527454) internal successors, (911), 608 states have internal predecessors, (911), 117 states have call successors, (117), 17 states have call predecessors, (117), 21 states have return successors, (138), 116 states have call predecessors, (138), 116 states have call successors, (138) [2024-11-09 23:13:19,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1166 transitions. [2024-11-09 23:13:19,310 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1166 transitions. Word has length 109 [2024-11-09 23:13:19,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:19,311 INFO L471 AbstractCegarLoop]: Abstraction has 740 states and 1166 transitions. [2024-11-09 23:13:19,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.071428571428571) internal successors, (127), 11 states have internal predecessors, (127), 4 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (20), 3 states have call predecessors, (20), 4 states have call successors, (20) [2024-11-09 23:13:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1166 transitions. [2024-11-09 23:13:19,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:13:19,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:19,315 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:19,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 23:13:19,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:13:19,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1264962753, now seen corresponding path program 1 times [2024-11-09 23:13:19,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:19,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611397309] [2024-11-09 23:13:19,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:13:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:13:19,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:13:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:13:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:13:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:19,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611397309] [2024-11-09 23:13:19,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611397309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:19,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151720776] [2024-11-09 23:13:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:19,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:19,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:19,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:19,658 INFO L87 Difference]: Start difference. First operand 740 states and 1166 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:20,754 INFO L93 Difference]: Finished difference Result 1854 states and 2977 transitions. [2024-11-09 23:13:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 120 [2024-11-09 23:13:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:20,761 INFO L225 Difference]: With dead ends: 1854 [2024-11-09 23:13:20,761 INFO L226 Difference]: Without dead ends: 1194 [2024-11-09 23:13:20,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:20,764 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 978 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 1353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:20,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 880 Invalid, 1353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2024-11-09 23:13:20,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1092. [2024-11-09 23:13:20,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 889 states have (on average 1.516310461192351) internal successors, (1348), 896 states have internal predecessors, (1348), 181 states have call successors, (181), 17 states have call predecessors, (181), 21 states have return successors, (212), 180 states have call predecessors, (212), 180 states have call successors, (212) [2024-11-09 23:13:20,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1741 transitions. [2024-11-09 23:13:20,840 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1741 transitions. Word has length 120 [2024-11-09 23:13:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:20,840 INFO L471 AbstractCegarLoop]: Abstraction has 1092 states and 1741 transitions. [2024-11-09 23:13:20,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1741 transitions. [2024-11-09 23:13:20,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:13:20,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:20,845 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:20,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 23:13:20,845 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:20,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 821116749, now seen corresponding path program 1 times [2024-11-09 23:13:20,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:20,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426392287] [2024-11-09 23:13:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:20,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:13:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:13:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:13:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:13:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:13:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:20,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:20,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426392287] [2024-11-09 23:13:20,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426392287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:20,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:20,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695367259] [2024-11-09 23:13:20,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:20,946 INFO L87 Difference]: Start difference. First operand 1092 states and 1741 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:22,076 INFO L93 Difference]: Finished difference Result 2724 states and 4387 transitions. [2024-11-09 23:13:22,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:22,076 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 121 [2024-11-09 23:13:22,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:22,087 INFO L225 Difference]: With dead ends: 2724 [2024-11-09 23:13:22,088 INFO L226 Difference]: Without dead ends: 1771 [2024-11-09 23:13:22,092 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:22,092 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 975 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 990 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:22,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [990 Valid, 866 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:22,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2024-11-09 23:13:22,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1669. [2024-11-09 23:13:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1371 states have (on average 1.512764405543399) internal successors, (2074), 1378 states have internal predecessors, (2074), 276 states have call successors, (276), 17 states have call predecessors, (276), 21 states have return successors, (307), 275 states have call predecessors, (307), 275 states have call successors, (307) [2024-11-09 23:13:22,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2657 transitions. [2024-11-09 23:13:22,221 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2657 transitions. Word has length 121 [2024-11-09 23:13:22,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:22,221 INFO L471 AbstractCegarLoop]: Abstraction has 1669 states and 2657 transitions. [2024-11-09 23:13:22,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:22,222 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2657 transitions. [2024-11-09 23:13:22,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:13:22,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:22,228 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:22,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:13:22,228 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:22,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:22,229 INFO L85 PathProgramCache]: Analyzing trace with hash -192680449, now seen corresponding path program 1 times [2024-11-09 23:13:22,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:22,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678307135] [2024-11-09 23:13:22,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:22,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:22,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:13:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:13:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:13:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:13:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:13:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:22,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678307135] [2024-11-09 23:13:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678307135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:22,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:22,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:22,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812008123] [2024-11-09 23:13:22,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:22,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:22,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:22,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:22,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:22,342 INFO L87 Difference]: Start difference. First operand 1669 states and 2657 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:23,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:23,381 INFO L93 Difference]: Finished difference Result 4033 states and 6512 transitions. [2024-11-09 23:13:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:23,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 122 [2024-11-09 23:13:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:23,394 INFO L225 Difference]: With dead ends: 4033 [2024-11-09 23:13:23,395 INFO L226 Difference]: Without dead ends: 2652 [2024-11-09 23:13:23,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:23,400 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 972 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 987 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:23,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [987 Valid, 868 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:13:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2024-11-09 23:13:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2550. [2024-11-09 23:13:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2550 states, 2129 states have (on average 1.509628933771724) internal successors, (3214), 2136 states have internal predecessors, (3214), 399 states have call successors, (399), 17 states have call predecessors, (399), 21 states have return successors, (446), 398 states have call predecessors, (446), 398 states have call successors, (446) [2024-11-09 23:13:23,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2550 states to 2550 states and 4059 transitions. [2024-11-09 23:13:23,513 INFO L78 Accepts]: Start accepts. Automaton has 2550 states and 4059 transitions. Word has length 122 [2024-11-09 23:13:23,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:23,514 INFO L471 AbstractCegarLoop]: Abstraction has 2550 states and 4059 transitions. [2024-11-09 23:13:23,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2550 states and 4059 transitions. [2024-11-09 23:13:23,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:13:23,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:23,524 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:23,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:13:23,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:23,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:23,524 INFO L85 PathProgramCache]: Analyzing trace with hash -301627667, now seen corresponding path program 1 times [2024-11-09 23:13:23,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:23,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019861731] [2024-11-09 23:13:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:23,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:23,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:13:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:13:23,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:13:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:13:23,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:13:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:23,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:23,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019861731] [2024-11-09 23:13:23,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019861731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:23,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:23,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:23,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585306579] [2024-11-09 23:13:23,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:23,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:23,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:23,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:23,631 INFO L87 Difference]: Start difference. First operand 2550 states and 4059 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:24,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:24,642 INFO L93 Difference]: Finished difference Result 6084 states and 9834 transitions. [2024-11-09 23:13:24,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:24,642 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 123 [2024-11-09 23:13:24,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:24,662 INFO L225 Difference]: With dead ends: 6084 [2024-11-09 23:13:24,662 INFO L226 Difference]: Without dead ends: 4067 [2024-11-09 23:13:24,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:24,670 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 969 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:24,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 868 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:13:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4067 states. [2024-11-09 23:13:24,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4067 to 3965. [2024-11-09 23:13:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3965 states, 3365 states have (on average 1.5057949479940564) internal successors, (5067), 3372 states have internal predecessors, (5067), 578 states have call successors, (578), 17 states have call predecessors, (578), 21 states have return successors, (651), 577 states have call predecessors, (651), 577 states have call successors, (651) [2024-11-09 23:13:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3965 states to 3965 states and 6296 transitions. [2024-11-09 23:13:24,823 INFO L78 Accepts]: Start accepts. Automaton has 3965 states and 6296 transitions. Word has length 123 [2024-11-09 23:13:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 3965 states and 6296 transitions. [2024-11-09 23:13:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3965 states and 6296 transitions. [2024-11-09 23:13:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:13:24,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:24,834 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:13:24,834 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1030010143, now seen corresponding path program 1 times [2024-11-09 23:13:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084526215] [2024-11-09 23:13:24,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:24,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:24,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:13:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:13:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:13:24,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:13:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:13:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084526215] [2024-11-09 23:13:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084526215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:24,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798323516] [2024-11-09 23:13:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:24,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:24,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:24,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:24,935 INFO L87 Difference]: Start difference. First operand 3965 states and 6296 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:26,023 INFO L93 Difference]: Finished difference Result 9752 states and 15745 transitions. [2024-11-09 23:13:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 124 [2024-11-09 23:13:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:26,058 INFO L225 Difference]: With dead ends: 9752 [2024-11-09 23:13:26,059 INFO L226 Difference]: Without dead ends: 6614 [2024-11-09 23:13:26,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:26,071 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 966 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:26,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 956 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:26,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6614 states. [2024-11-09 23:13:26,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6614 to 6512. [2024-11-09 23:13:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6512 states, 5536 states have (on average 1.4954841040462428) internal successors, (8279), 5543 states have internal predecessors, (8279), 954 states have call successors, (954), 17 states have call predecessors, (954), 21 states have return successors, (1071), 953 states have call predecessors, (1071), 953 states have call successors, (1071) [2024-11-09 23:13:26,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 10304 transitions. [2024-11-09 23:13:26,393 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 10304 transitions. Word has length 124 [2024-11-09 23:13:26,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:26,394 INFO L471 AbstractCegarLoop]: Abstraction has 6512 states and 10304 transitions. [2024-11-09 23:13:26,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:26,394 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 10304 transitions. [2024-11-09 23:13:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 23:13:26,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:26,406 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:13:26,407 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:26,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:26,407 INFO L85 PathProgramCache]: Analyzing trace with hash 554134989, now seen corresponding path program 1 times [2024-11-09 23:13:26,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:26,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793795158] [2024-11-09 23:13:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:26,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:26,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:13:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:13:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:13:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:13:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:13:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793795158] [2024-11-09 23:13:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793795158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041690866] [2024-11-09 23:13:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:26,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:26,514 INFO L87 Difference]: Start difference. First operand 6512 states and 10304 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:27,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:27,740 INFO L93 Difference]: Finished difference Result 16260 states and 26132 transitions. [2024-11-09 23:13:27,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:27,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 125 [2024-11-09 23:13:27,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:27,804 INFO L225 Difference]: With dead ends: 16260 [2024-11-09 23:13:27,805 INFO L226 Difference]: Without dead ends: 11039 [2024-11-09 23:13:27,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:27,825 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 963 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1038 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1038 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:27,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 872 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1038 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11039 states. [2024-11-09 23:13:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11039 to 10937. [2024-11-09 23:13:28,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10937 states, 9355 states have (on average 1.4888295029396046) internal successors, (13928), 9362 states have internal predecessors, (13928), 1560 states have call successors, (1560), 17 states have call predecessors, (1560), 21 states have return successors, (1755), 1559 states have call predecessors, (1755), 1559 states have call successors, (1755) [2024-11-09 23:13:28,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10937 states to 10937 states and 17243 transitions. [2024-11-09 23:13:28,340 INFO L78 Accepts]: Start accepts. Automaton has 10937 states and 17243 transitions. Word has length 125 [2024-11-09 23:13:28,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:28,340 INFO L471 AbstractCegarLoop]: Abstraction has 10937 states and 17243 transitions. [2024-11-09 23:13:28,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:28,340 INFO L276 IsEmpty]: Start isEmpty. Operand 10937 states and 17243 transitions. [2024-11-09 23:13:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-09 23:13:28,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:28,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:28,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:13:28,392 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:28,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1417722847, now seen corresponding path program 1 times [2024-11-09 23:13:28,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:28,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278791923] [2024-11-09 23:13:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:28,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:28,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:28,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:28,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:28,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:13:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:13:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:13:28,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:13:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:13:28,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:28,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:28,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:28,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278791923] [2024-11-09 23:13:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278791923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:28,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:28,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:28,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637528900] [2024-11-09 23:13:28,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:28,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:28,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:28,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:28,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:28,498 INFO L87 Difference]: Start difference. First operand 10937 states and 17243 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:29,866 INFO L93 Difference]: Finished difference Result 28499 states and 45628 transitions. [2024-11-09 23:13:29,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 126 [2024-11-09 23:13:29,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:29,944 INFO L225 Difference]: With dead ends: 28499 [2024-11-09 23:13:29,944 INFO L226 Difference]: Without dead ends: 19391 [2024-11-09 23:13:29,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:29,976 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 960 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 1357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:29,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 898 Invalid, 1357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:29,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19391 states. [2024-11-09 23:13:30,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19391 to 19289. [2024-11-09 23:13:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19289 states, 16504 states have (on average 1.478247697527872) internal successors, (24397), 16511 states have internal predecessors, (24397), 2763 states have call successors, (2763), 17 states have call predecessors, (2763), 21 states have return successors, (3102), 2762 states have call predecessors, (3102), 2762 states have call successors, (3102) [2024-11-09 23:13:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19289 states to 19289 states and 30262 transitions. [2024-11-09 23:13:30,824 INFO L78 Accepts]: Start accepts. Automaton has 19289 states and 30262 transitions. Word has length 126 [2024-11-09 23:13:30,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:30,825 INFO L471 AbstractCegarLoop]: Abstraction has 19289 states and 30262 transitions. [2024-11-09 23:13:30,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:30,826 INFO L276 IsEmpty]: Start isEmpty. Operand 19289 states and 30262 transitions. [2024-11-09 23:13:30,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 23:13:30,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:30,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:30,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:13:30,853 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:30,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1096574803, now seen corresponding path program 1 times [2024-11-09 23:13:30,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064300554] [2024-11-09 23:13:30,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:13:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:13:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:13:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:13:30,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:13:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:30,990 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:30,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:30,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064300554] [2024-11-09 23:13:30,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064300554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:30,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:30,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:30,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329802964] [2024-11-09 23:13:30,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:30,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:30,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:30,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:30,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:30,993 INFO L87 Difference]: Start difference. First operand 19289 states and 30262 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:32,699 INFO L93 Difference]: Finished difference Result 51447 states and 82007 transitions. [2024-11-09 23:13:32,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:32,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 127 [2024-11-09 23:13:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:32,837 INFO L225 Difference]: With dead ends: 51447 [2024-11-09 23:13:32,837 INFO L226 Difference]: Without dead ends: 34743 [2024-11-09 23:13:32,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:32,883 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 957 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 972 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:32,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [972 Valid, 866 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:13:32,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34743 states. [2024-11-09 23:13:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34743 to 34641. [2024-11-09 23:13:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34641 states, 29817 states have (on average 1.4710064728175203) internal successors, (43861), 29824 states have internal predecessors, (43861), 4802 states have call successors, (4802), 17 states have call predecessors, (4802), 21 states have return successors, (5415), 4801 states have call predecessors, (5415), 4801 states have call successors, (5415) [2024-11-09 23:13:34,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 54078 transitions. [2024-11-09 23:13:34,327 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 54078 transitions. Word has length 127 [2024-11-09 23:13:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:34,328 INFO L471 AbstractCegarLoop]: Abstraction has 34641 states and 54078 transitions. [2024-11-09 23:13:34,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:34,329 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 54078 transitions. [2024-11-09 23:13:34,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 23:13:34,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:34,358 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:34,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:13:34,359 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:34,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1663633023, now seen corresponding path program 1 times [2024-11-09 23:13:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:34,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827853946] [2024-11-09 23:13:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:34,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:34,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:13:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:13:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:13:34,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:13:34,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:13:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:34,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:34,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:34,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827853946] [2024-11-09 23:13:34,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827853946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:34,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:34,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:34,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237046854] [2024-11-09 23:13:34,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:34,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:34,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:34,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:34,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:34,495 INFO L87 Difference]: Start difference. First operand 34641 states and 54078 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:36,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:36,901 INFO L93 Difference]: Finished difference Result 95036 states and 150198 transitions. [2024-11-09 23:13:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:36,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 128 [2024-11-09 23:13:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:37,178 INFO L225 Difference]: With dead ends: 95036 [2024-11-09 23:13:37,178 INFO L226 Difference]: Without dead ends: 63898 [2024-11-09 23:13:37,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:37,272 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 954 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 969 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:37,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [969 Valid, 873 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:13:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63898 states. [2024-11-09 23:13:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63898 to 63796. [2024-11-09 23:13:39,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63796 states, 55257 states have (on average 1.4629820656206454) internal successors, (80840), 55264 states have internal predecessors, (80840), 8517 states have call successors, (8517), 17 states have call predecessors, (8517), 21 states have return successors, (9662), 8516 states have call predecessors, (9662), 8516 states have call successors, (9662) [2024-11-09 23:13:39,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63796 states to 63796 states and 99019 transitions. [2024-11-09 23:13:39,597 INFO L78 Accepts]: Start accepts. Automaton has 63796 states and 99019 transitions. Word has length 128 [2024-11-09 23:13:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 63796 states and 99019 transitions. [2024-11-09 23:13:39,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 63796 states and 99019 transitions. [2024-11-09 23:13:39,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-09 23:13:39,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:39,621 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:39,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:13:39,621 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:39,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:39,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1552169965, now seen corresponding path program 1 times [2024-11-09 23:13:39,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:39,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117991262] [2024-11-09 23:13:39,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:39,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:40,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:13:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:13:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:13:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:13:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 23:13:40,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:40,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:40,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:40,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117991262] [2024-11-09 23:13:40,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117991262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:40,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:40,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:13:40,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000127599] [2024-11-09 23:13:40,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:40,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:13:40,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:40,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:13:40,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:13:40,198 INFO L87 Difference]: Start difference. First operand 63796 states and 99019 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:43,138 INFO L93 Difference]: Finished difference Result 119900 states and 189221 transitions. [2024-11-09 23:13:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:13:43,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 129 [2024-11-09 23:13:43,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:43,754 INFO L225 Difference]: With dead ends: 119900 [2024-11-09 23:13:43,754 INFO L226 Difference]: Without dead ends: 119772 [2024-11-09 23:13:43,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:13:43,796 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 948 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:43,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 906 Invalid, 1349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 23:13:43,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119772 states. [2024-11-09 23:13:46,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119772 to 119670. [2024-11-09 23:13:47,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119670 states, 104332 states have (on average 1.4540313614231493) internal successors, (151702), 104339 states have internal predecessors, (151702), 15316 states have call successors, (15316), 17 states have call predecessors, (15316), 21 states have return successors, (17507), 15315 states have call predecessors, (17507), 15315 states have call successors, (17507) [2024-11-09 23:13:47,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119670 states to 119670 states and 184525 transitions. [2024-11-09 23:13:47,848 INFO L78 Accepts]: Start accepts. Automaton has 119670 states and 184525 transitions. Word has length 129 [2024-11-09 23:13:47,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:13:47,849 INFO L471 AbstractCegarLoop]: Abstraction has 119670 states and 184525 transitions. [2024-11-09 23:13:47,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (13), 6 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-09 23:13:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 119670 states and 184525 transitions. [2024-11-09 23:13:47,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-09 23:13:47,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:13:47,874 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:13:47,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:13:47,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:13:47,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:13:47,875 INFO L85 PathProgramCache]: Analyzing trace with hash -322839265, now seen corresponding path program 1 times [2024-11-09 23:13:47,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:13:47,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243614738] [2024-11-09 23:13:47,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:13:47,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:13:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:13:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:13:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:13:48,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:13:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:13:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:13:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:13:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:13:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:13:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:13:48,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 23:13:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:13:48,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:13:48,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:13:48,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243614738] [2024-11-09 23:13:48,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243614738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:13:48,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:13:48,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 23:13:48,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328188459] [2024-11-09 23:13:48,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:13:48,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 23:13:48,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:13:48,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 23:13:48,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-09 23:13:48,342 INFO L87 Difference]: Start difference. First operand 119670 states and 184525 transitions. Second operand has 16 states, 15 states have (on average 6.2) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 23:13:56,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:13:56,856 INFO L93 Difference]: Finished difference Result 238649 states and 380014 transitions. [2024-11-09 23:13:56,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-09 23:13:56,857 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.2) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 130 [2024-11-09 23:13:56,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:13:57,861 INFO L225 Difference]: With dead ends: 238649 [2024-11-09 23:13:57,862 INFO L226 Difference]: Without dead ends: 238527 [2024-11-09 23:13:58,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 955 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=715, Invalid=2825, Unknown=0, NotChecked=0, Total=3540 [2024-11-09 23:13:58,210 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 3396 mSDsluCounter, 2521 mSDsCounter, 0 mSdLazyCounter, 5388 mSolverCounterSat, 921 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3396 SdHoareTripleChecker+Valid, 2765 SdHoareTripleChecker+Invalid, 6309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 921 IncrementalHoareTripleChecker+Valid, 5388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:13:58,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3396 Valid, 2765 Invalid, 6309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [921 Valid, 5388 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 23:13:58,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238527 states. [2024-11-09 23:14:05,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238527 to 238240. [2024-11-09 23:14:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238240 states, 207770 states have (on average 1.4548924291283631) internal successors, (302283), 207673 states have internal predecessors, (302283), 30417 states have call successors, (30417), 44 states have call predecessors, (30417), 52 states have return successors, (38073), 30528 states have call predecessors, (38073), 30414 states have call successors, (38073) [2024-11-09 23:14:07,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238240 states to 238240 states and 370773 transitions. [2024-11-09 23:14:07,058 INFO L78 Accepts]: Start accepts. Automaton has 238240 states and 370773 transitions. Word has length 130 [2024-11-09 23:14:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:14:07,058 INFO L471 AbstractCegarLoop]: Abstraction has 238240 states and 370773 transitions. [2024-11-09 23:14:07,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.2) internal successors, (93), 10 states have internal predecessors, (93), 5 states have call successors, (13), 7 states have call predecessors, (13), 3 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-11-09 23:14:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 238240 states and 370773 transitions. [2024-11-09 23:14:07,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-09 23:14:07,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:14:07,090 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:14:07,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:14:07,090 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:14:07,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:14:07,091 INFO L85 PathProgramCache]: Analyzing trace with hash 334464976, now seen corresponding path program 1 times [2024-11-09 23:14:07,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:14:07,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060733643] [2024-11-09 23:14:07,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:14:07,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:14:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:14:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:14:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:14:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:14:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:14:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:14:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:14:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:14:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:14:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:14:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:14:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:14:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:14:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:14:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060733643] [2024-11-09 23:14:07,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060733643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:14:07,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:14:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:14:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456333591] [2024-11-09 23:14:07,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:14:07,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:14:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:14:07,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:14:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:14:07,381 INFO L87 Difference]: Start difference. First operand 238240 states and 370773 transitions. Second operand has 12 states, 12 states have (on average 7.833333333333333) internal successors, (94), 6 states have internal predecessors, (94), 4 states have call successors, (13), 7 states have call predecessors, (13), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11)