/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:44:48,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:44:48,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-15 22:44:48,986 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:44:48,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:44:49,016 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:44:49,017 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:44:49,017 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:44:49,018 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:44:49,022 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:44:49,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:44:49,023 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:44:49,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:44:49,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:44:49,024 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:44:49,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:44:49,024 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:44:49,024 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:44:49,025 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:44:49,025 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:44:49,026 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:44:49,027 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:44:49,027 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:44:49,027 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:44:49,027 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:44:49,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:44:49,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:44:49,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:44:49,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:44:49,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:44:49,030 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: Use bitabs translation -> true [2023-12-15 22:44:49,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:44:49,250 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:44:49,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:44:49,255 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:44:49,255 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:44:49,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c [2023-12-15 22:44:50,219 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:44:50,483 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:44:50,485 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c [2023-12-15 22:44:50,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9163877d5/1f563eca04714fc4901e53aa29335687/FLAGa419ae955 [2023-12-15 22:44:50,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9163877d5/1f563eca04714fc4901e53aa29335687 [2023-12-15 22:44:50,523 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:44:50,524 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:44:50,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:44:50,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:44:50,530 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:44:50,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:44:50" (1/1) ... [2023-12-15 22:44:50,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46893c43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:50, skipping insertion in model container [2023-12-15 22:44:50,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:44:50" (1/1) ... [2023-12-15 22:44:50,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:44:50,999 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c[58327,58340] [2023-12-15 22:44:51,023 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:44:51,043 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:44:51,049 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2023-12-15 22:44:51,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [208] [2023-12-15 22:44:51,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [238] [2023-12-15 22:44:51,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] [2023-12-15 22:44:51,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [906] [2023-12-15 22:44:51,050 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1978] [2023-12-15 22:44:51,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2337] [2023-12-15 22:44:51,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2734] [2023-12-15 22:44:51,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2743] [2023-12-15 22:44:51,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2778] [2023-12-15 22:44:51,051 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2994] [2023-12-15 22:44:51,164 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/product-lines/email_spec1_product30.cil.c[58327,58340] [2023-12-15 22:44:51,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:44:51,202 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:44:51,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51 WrapperNode [2023-12-15 22:44:51,202 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:44:51,203 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:44:51,203 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:44:51,203 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:44:51,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,229 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,260 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 60, calls inlined = 50, statements flattened = 900 [2023-12-15 22:44:51,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:44:51,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:44:51,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:44:51,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:44:51,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,293 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]. [2023-12-15 22:44:51,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,304 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,315 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,320 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:44:51,321 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:44:51,321 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:44:51,321 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:44:51,321 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (1/1) ... [2023-12-15 22:44:51,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:44:51,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:51,358 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) [2023-12-15 22:44:51,361 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 [2023-12-15 22:44:51,393 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2023-12-15 22:44:51,393 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2023-12-15 22:44:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2023-12-15 22:44:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2023-12-15 22:44:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2023-12-15 22:44:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2023-12-15 22:44:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2023-12-15 22:44:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2023-12-15 22:44:51,394 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2023-12-15 22:44:51,394 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2023-12-15 22:44:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2023-12-15 22:44:51,395 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2023-12-15 22:44:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2023-12-15 22:44:51,395 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2023-12-15 22:44:51,395 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2023-12-15 22:44:51,396 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2023-12-15 22:44:51,396 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2023-12-15 22:44:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2023-12-15 22:44:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2023-12-15 22:44:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2023-12-15 22:44:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2023-12-15 22:44:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2023-12-15 22:44:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2023-12-15 22:44:51,397 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2023-12-15 22:44:51,397 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2023-12-15 22:44:51,398 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2023-12-15 22:44:51,398 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2023-12-15 22:44:51,399 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2023-12-15 22:44:51,399 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2023-12-15 22:44:51,399 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2023-12-15 22:44:51,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:44:51,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:44:51,584 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:44:51,585 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:44:52,042 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:44:52,101 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:44:52,101 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:44:52,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:44:52 BoogieIcfgContainer [2023-12-15 22:44:52,102 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:44:52,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:44:52,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:44:52,106 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:44:52,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:44:50" (1/3) ... [2023-12-15 22:44:52,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a91d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:44:52, skipping insertion in model container [2023-12-15 22:44:52,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:44:51" (2/3) ... [2023-12-15 22:44:52,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e3a91d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:44:52, skipping insertion in model container [2023-12-15 22:44:52,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:44:52" (3/3) ... [2023-12-15 22:44:52,108 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product30.cil.c [2023-12-15 22:44:52,120 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:44:52,121 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:44:52,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:44:52,204 INFO L357 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, mHoare=true, 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;@fa16ba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:44:52,204 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:44:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-15 22:44:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2023-12-15 22:44:52,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:52,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:52,232 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:52,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -392236607, now seen corresponding path program 1 times [2023-12-15 22:44:52,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:52,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842866251] [2023-12-15 22:44:52,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:52,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:52,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:44:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:44:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:44:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-15 22:44:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-15 22:44:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:44:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:44:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:44:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:44:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:44:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:52,803 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 22:44:52,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842866251] [2023-12-15 22:44:52,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842866251] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:44:52,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650562999] [2023-12-15 22:44:52,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:52,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:52,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:52,807 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) [2023-12-15 22:44:52,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-15 22:44:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,075 INFO L262 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-15 22:44:53,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:44:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 22:44:53,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:44:53,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650562999] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:53,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:44:53,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2023-12-15 22:44:53,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567937642] [2023-12-15 22:44:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:53,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 22:44:53,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:53,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 22:44:53,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:44:53,148 INFO L87 Difference]: Start difference. First operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:53,217 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2023-12-15 22:44:53,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 22:44:53,219 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2023-12-15 22:44:53,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:53,229 INFO L225 Difference]: With dead ends: 495 [2023-12-15 22:44:53,229 INFO L226 Difference]: Without dead ends: 317 [2023-12-15 22:44:53,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:44:53,236 INFO L413 NwaCegarLoop]: 470 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:53,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 470 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:44:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-12-15 22:44:53,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-12-15 22:44:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 240 states have (on average 1.5583333333333333) internal successors, (374), 243 states have internal predecessors, (374), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 22:44:53,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2023-12-15 22:44:53,284 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 95 [2023-12-15 22:44:53,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:53,285 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2023-12-15 22:44:53,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:53,285 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2023-12-15 22:44:53,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2023-12-15 22:44:53,288 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:53,288 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:53,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-15 22:44:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-15 22:44:53,495 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:53,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:53,496 INFO L85 PathProgramCache]: Analyzing trace with hash 122970567, now seen corresponding path program 1 times [2023-12-15 22:44:53,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:53,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676186333] [2023-12-15 22:44:53,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:53,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:53,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:44:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:44:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:44:53,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-12-15 22:44:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-15 22:44:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:44:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:44:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:44:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:44:53,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:44:53,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-15 22:44:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676186333] [2023-12-15 22:44:53,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676186333] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:44:53,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28900407] [2023-12-15 22:44:53,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:53,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:53,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:53,686 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) [2023-12-15 22:44:53,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-15 22:44:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:53,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-15 22:44:53,899 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:44:53,912 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 22:44:53,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:44:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28900407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:53,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:44:53,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 22:44:53,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895564493] [2023-12-15 22:44:53,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:53,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:44:53,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:53,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:44:53,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:44:53,915 INFO L87 Difference]: Start difference. First operand 317 states and 479 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:53,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:53,950 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2023-12-15 22:44:53,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:44:53,950 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2023-12-15 22:44:53,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:53,953 INFO L225 Difference]: With dead ends: 491 [2023-12-15 22:44:53,954 INFO L226 Difference]: Without dead ends: 319 [2023-12-15 22:44:53,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:44:53,955 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:53,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 933 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:44:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2023-12-15 22:44:53,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2023-12-15 22:44:53,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 245 states have internal predecessors, (376), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-15 22:44:53,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 481 transitions. [2023-12-15 22:44:53,970 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 481 transitions. Word has length 96 [2023-12-15 22:44:53,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:53,971 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 481 transitions. [2023-12-15 22:44:53,971 INFO L496 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, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:53,971 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 481 transitions. [2023-12-15 22:44:53,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-15 22:44:53,972 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:53,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:53,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 22:44:54,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-15 22:44:54,181 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:54,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:54,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1704534011, now seen corresponding path program 1 times [2023-12-15 22:44:54,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859139503] [2023-12-15 22:44:54,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:54,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:44:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:44:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:44:54,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-15 22:44:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:44:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:44:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:44:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:44:54,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:44:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:44:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,401 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 22:44:54,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:54,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859139503] [2023-12-15 22:44:54,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859139503] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:44:54,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949049922] [2023-12-15 22:44:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:54,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:54,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:54,403 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) [2023-12-15 22:44:54,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-15 22:44:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 22:44:54,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:44:54,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-15 22:44:54,629 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:44:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949049922] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:54,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:44:54,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2023-12-15 22:44:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622463082] [2023-12-15 22:44:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:54,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 22:44:54,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:54,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 22:44:54,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:44:54,631 INFO L87 Difference]: Start difference. First operand 319 states and 481 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:54,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:54,663 INFO L93 Difference]: Finished difference Result 668 states and 1021 transitions. [2023-12-15 22:44:54,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 22:44:54,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2023-12-15 22:44:54,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:54,666 INFO L225 Difference]: With dead ends: 668 [2023-12-15 22:44:54,666 INFO L226 Difference]: Without dead ends: 371 [2023-12-15 22:44:54,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-12-15 22:44:54,668 INFO L413 NwaCegarLoop]: 477 mSDtfsCounter, 102 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:54,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 900 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:44:54,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-12-15 22:44:54,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 366. [2023-12-15 22:44:54,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-15 22:44:54,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2023-12-15 22:44:54,684 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 103 [2023-12-15 22:44:54,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:54,684 INFO L495 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2023-12-15 22:44:54,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:44:54,684 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2023-12-15 22:44:54,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-15 22:44:54,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:54,686 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:54,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 22:44:54,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:54,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:54,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:54,895 INFO L85 PathProgramCache]: Analyzing trace with hash 357840441, now seen corresponding path program 1 times [2023-12-15 22:44:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494894499] [2023-12-15 22:44:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:54,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 22:44:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 22:44:55,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 22:44:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 22:44:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:44:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:44:55,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:44:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:44:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:44:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 22:44:55,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 22:44:55,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494894499] [2023-12-15 22:44:55,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494894499] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:44:55,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207077407] [2023-12-15 22:44:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:55,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:55,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:55,057 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) [2023-12-15 22:44:55,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-15 22:44:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-15 22:44:55,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:44:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 22:44:55,318 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:44:55,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207077407] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:55,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:44:55,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-12-15 22:44:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483130540] [2023-12-15 22:44:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:44:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:44:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:44:55,320 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:55,410 INFO L93 Difference]: Finished difference Result 727 states and 1120 transitions. [2023-12-15 22:44:55,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:44:55,410 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2023-12-15 22:44:55,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:55,412 INFO L225 Difference]: With dead ends: 727 [2023-12-15 22:44:55,412 INFO L226 Difference]: Without dead ends: 368 [2023-12-15 22:44:55,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:44:55,414 INFO L413 NwaCegarLoop]: 458 mSDtfsCounter, 8 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:55,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1821 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:44:55,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-15 22:44:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2023-12-15 22:44:55,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 283 states have internal predecessors, (437), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2023-12-15 22:44:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2023-12-15 22:44:55,424 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 104 [2023-12-15 22:44:55,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:55,424 INFO L495 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2023-12-15 22:44:55,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:55,424 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2023-12-15 22:44:55,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-15 22:44:55,426 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:55,426 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:55,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-15 22:44:55,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:55,632 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:55,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:55,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1965777925, now seen corresponding path program 1 times [2023-12-15 22:44:55,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:55,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032495002] [2023-12-15 22:44:55,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:55,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:44:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-12-15 22:44:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-12-15 22:44:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-15 22:44:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 22:44:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:44:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:44:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:44:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:44:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 22:44:55,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:55,776 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 22:44:55,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032495002] [2023-12-15 22:44:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032495002] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:44:55,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084908562] [2023-12-15 22:44:55,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:55,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:55,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:44:55,793 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) [2023-12-15 22:44:55,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-15 22:44:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-15 22:44:56,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:44:56,151 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-15 22:44:56,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:44:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084908562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:56,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-15 22:44:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2023-12-15 22:44:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423671998] [2023-12-15 22:44:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:56,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 22:44:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:56,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 22:44:56,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2023-12-15 22:44:56,153 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:56,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:56,223 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2023-12-15 22:44:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 22:44:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2023-12-15 22:44:56,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:56,225 INFO L225 Difference]: With dead ends: 729 [2023-12-15 22:44:56,225 INFO L226 Difference]: Without dead ends: 370 [2023-12-15 22:44:56,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-12-15 22:44:56,227 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 8 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:56,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1807 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:44:56,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-12-15 22:44:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2023-12-15 22:44:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2023-12-15 22:44:56,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 572 transitions. [2023-12-15 22:44:56,237 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 572 transitions. Word has length 105 [2023-12-15 22:44:56,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:56,237 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 572 transitions. [2023-12-15 22:44:56,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:56,238 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 572 transitions. [2023-12-15 22:44:56,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-15 22:44:56,239 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:56,239 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:56,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-15 22:44:56,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:44:56,450 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:56,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1037844344, now seen corresponding path program 1 times [2023-12-15 22:44:56,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:56,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567579977] [2023-12-15 22:44:56,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:56,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:44:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:44:56,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-12-15 22:44:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 22:44:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-15 22:44:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:44:56,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:44:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:44:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:44:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:44:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 22:44:56,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:56,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567579977] [2023-12-15 22:44:56,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567579977] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:44:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:44:56,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245842992] [2023-12-15 22:44:56,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:56,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:44:56,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:56,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:44:56,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:44:56,576 INFO L87 Difference]: Start difference. First operand 370 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:58,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:58,097 INFO L93 Difference]: Finished difference Result 807 states and 1260 transitions. [2023-12-15 22:44:58,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 22:44:58,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2023-12-15 22:44:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:58,106 INFO L225 Difference]: With dead ends: 807 [2023-12-15 22:44:58,106 INFO L226 Difference]: Without dead ends: 456 [2023-12-15 22:44:58,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:44:58,111 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1044 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2163 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 2163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:58,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 963 Invalid, 2498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 2163 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-15 22:44:58,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2023-12-15 22:44:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 370. [2023-12-15 22:44:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2023-12-15 22:44:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2023-12-15 22:44:58,157 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 106 [2023-12-15 22:44:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:58,158 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2023-12-15 22:44:58,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2023-12-15 22:44:58,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-15 22:44:58,159 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:58,159 INFO L195 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] [2023-12-15 22:44:58,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 22:44:58,159 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:58,160 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:58,160 INFO L85 PathProgramCache]: Analyzing trace with hash 289902940, now seen corresponding path program 2 times [2023-12-15 22:44:58,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:58,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435103368] [2023-12-15 22:44:58,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:58,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:58,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:44:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:44:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 22:44:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-12-15 22:44:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 22:44:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:44:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:44:58,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:44:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:44:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:44:58,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 22:44:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435103368] [2023-12-15 22:44:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435103368] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:58,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:44:58,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-15 22:44:58,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431120288] [2023-12-15 22:44:58,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:58,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-15 22:44:58,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:58,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-15 22:44:58,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-15 22:44:58,393 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:44:59,622 INFO L93 Difference]: Finished difference Result 809 states and 1263 transitions. [2023-12-15 22:44:59,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-15 22:44:59,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2023-12-15 22:44:59,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:44:59,625 INFO L225 Difference]: With dead ends: 809 [2023-12-15 22:44:59,625 INFO L226 Difference]: Without dead ends: 458 [2023-12-15 22:44:59,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:44:59,626 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 1039 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2180 mSolverCounterSat, 334 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 2514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 334 IncrementalHoareTripleChecker+Valid, 2180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:44:59,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 963 Invalid, 2514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [334 Valid, 2180 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:44:59,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-15 22:44:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2023-12-15 22:44:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2023-12-15 22:44:59,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 574 transitions. [2023-12-15 22:44:59,668 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 574 transitions. Word has length 107 [2023-12-15 22:44:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:44:59,668 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 574 transitions. [2023-12-15 22:44:59,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2023-12-15 22:44:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 574 transitions. [2023-12-15 22:44:59,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 22:44:59,670 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:44:59,670 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:44:59,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 22:44:59,670 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:44:59,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:44:59,670 INFO L85 PathProgramCache]: Analyzing trace with hash -172335405, now seen corresponding path program 1 times [2023-12-15 22:44:59,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:44:59,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364208141] [2023-12-15 22:44:59,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:44:59,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:44:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:44:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:44:59,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:44:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:44:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:44:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:44:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-12-15 22:44:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-12-15 22:44:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:44:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:44:59,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:44:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:44:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:44:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:44:59,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 22:44:59,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:44:59,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364208141] [2023-12-15 22:44:59,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364208141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:44:59,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:44:59,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 22:44:59,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915133839] [2023-12-15 22:44:59,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:44:59,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:44:59,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:44:59,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:44:59,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:44:59,897 INFO L87 Difference]: Start difference. First operand 372 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-15 22:45:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:01,779 INFO L93 Difference]: Finished difference Result 807 states and 1258 transitions. [2023-12-15 22:45:01,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:45:01,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2023-12-15 22:45:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:01,781 INFO L225 Difference]: With dead ends: 807 [2023-12-15 22:45:01,781 INFO L226 Difference]: Without dead ends: 458 [2023-12-15 22:45:01,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:45:01,783 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1049 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3639 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 3979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 3639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:01,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 1332 Invalid, 3979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 3639 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 22:45:01,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-15 22:45:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2023-12-15 22:45:01,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2023-12-15 22:45:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2023-12-15 22:45:01,798 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 108 [2023-12-15 22:45:01,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:01,798 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2023-12-15 22:45:01,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-15 22:45:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2023-12-15 22:45:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 22:45:01,800 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:01,800 INFO L195 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] [2023-12-15 22:45:01,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-15 22:45:01,800 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:01,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:01,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1381306204, now seen corresponding path program 2 times [2023-12-15 22:45:01,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:01,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475315315] [2023-12-15 22:45:01,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:01,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:01,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:01,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-15 22:45:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 22:45:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:45:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:45:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:45:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:45:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 22:45:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:01,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-12-15 22:45:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:01,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475315315] [2023-12-15 22:45:01,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475315315] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:01,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:01,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-15 22:45:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72691625] [2023-12-15 22:45:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:01,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-15 22:45:01,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:01,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-15 22:45:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-12-15 22:45:01,957 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-15 22:45:03,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:03,859 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2023-12-15 22:45:03,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-15 22:45:03,860 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2023-12-15 22:45:03,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:03,863 INFO L225 Difference]: With dead ends: 809 [2023-12-15 22:45:03,863 INFO L226 Difference]: Without dead ends: 460 [2023-12-15 22:45:03,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=440, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:45:03,865 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 1044 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 4012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 337 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:03,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1332 Invalid, 4012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [337 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 22:45:03,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-12-15 22:45:03,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 374. [2023-12-15 22:45:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 282 states have (on average 1.5602836879432624) internal successors, (440), 289 states have internal predecessors, (440), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2023-12-15 22:45:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2023-12-15 22:45:03,895 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 109 [2023-12-15 22:45:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:03,895 INFO L495 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2023-12-15 22:45:03,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2023-12-15 22:45:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2023-12-15 22:45:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 22:45:03,912 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:03,912 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:45:03,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-15 22:45:03,913 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:03,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 271481870, now seen corresponding path program 1 times [2023-12-15 22:45:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:03,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451234992] [2023-12-15 22:45:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:03,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:04,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:04,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 22:45:04,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:45:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:45:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:45:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:45:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:45:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 22:45:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,208 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-12-15 22:45:04,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451234992] [2023-12-15 22:45:04,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451234992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-15 22:45:04,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140852519] [2023-12-15 22:45:04,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:04,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:45:04,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:45:04,210 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) [2023-12-15 22:45:04,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-15 22:45:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:04,491 INFO L262 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-15 22:45:04,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:45:04,523 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:04,523 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:45:04,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:04,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [140852519] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:45:04,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-15 22:45:04,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2023-12-15 22:45:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257111800] [2023-12-15 22:45:04,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-15 22:45:04,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-15 22:45:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-15 22:45:04,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2023-12-15 22:45:04,597 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-15 22:45:06,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:06,551 INFO L93 Difference]: Finished difference Result 1138 states and 1875 transitions. [2023-12-15 22:45:06,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-15 22:45:06,551 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2023-12-15 22:45:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:06,555 INFO L225 Difference]: With dead ends: 1138 [2023-12-15 22:45:06,555 INFO L226 Difference]: Without dead ends: 790 [2023-12-15 22:45:06,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2023-12-15 22:45:06,557 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 2199 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 3573 mSolverCounterSat, 675 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2216 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 4248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 675 IncrementalHoareTripleChecker+Valid, 3573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:06,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2216 Valid, 1515 Invalid, 4248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [675 Valid, 3573 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-15 22:45:06,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2023-12-15 22:45:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 689. [2023-12-15 22:45:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 533 states have (on average 1.6097560975609757) internal successors, (858), 540 states have internal predecessors, (858), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2023-12-15 22:45:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1135 transitions. [2023-12-15 22:45:06,593 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1135 transitions. Word has length 110 [2023-12-15 22:45:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:06,594 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1135 transitions. [2023-12-15 22:45:06,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2023-12-15 22:45:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1135 transitions. [2023-12-15 22:45:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-15 22:45:06,597 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:06,597 INFO L195 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] [2023-12-15 22:45:06,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-15 22:45:06,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:45:06,803 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:06,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:06,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1738925346, now seen corresponding path program 1 times [2023-12-15 22:45:06,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:06,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541701399] [2023-12-15 22:45:06,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:06,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:06,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-12-15 22:45:06,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:45:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:45:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:45:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:45:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-12-15 22:45:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:45:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:06,879 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:06,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:06,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541701399] [2023-12-15 22:45:06,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541701399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:06,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:06,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:06,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216135135] [2023-12-15 22:45:06,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:06,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:06,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:06,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:06,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:06,880 INFO L87 Difference]: Start difference. First operand 689 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:07,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:07,848 INFO L93 Difference]: Finished difference Result 1693 states and 2864 transitions. [2023-12-15 22:45:07,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:07,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2023-12-15 22:45:07,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:07,853 INFO L225 Difference]: With dead ends: 1693 [2023-12-15 22:45:07,853 INFO L226 Difference]: Without dead ends: 1072 [2023-12-15 22:45:07,854 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:07,855 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 1132 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:07,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 746 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-15 22:45:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2023-12-15 22:45:07,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2023-12-15 22:45:07,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 761 states have (on average 1.6228646517739815) internal successors, (1235), 768 states have internal predecessors, (1235), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2023-12-15 22:45:07,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1650 transitions. [2023-12-15 22:45:07,888 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1650 transitions. Word has length 114 [2023-12-15 22:45:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:07,888 INFO L495 AbstractCegarLoop]: Abstraction has 981 states and 1650 transitions. [2023-12-15 22:45:07,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1650 transitions. [2023-12-15 22:45:07,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-15 22:45:07,891 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:07,892 INFO L195 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] [2023-12-15 22:45:07,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-15 22:45:07,892 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:07,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:07,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1928759165, now seen corresponding path program 1 times [2023-12-15 22:45:07,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:07,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727648406] [2023-12-15 22:45:07,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:07,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:07,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 22:45:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:45:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:45:07,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:45:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:45:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-12-15 22:45:07,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 22:45:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:07,963 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:07,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:07,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727648406] [2023-12-15 22:45:07,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727648406] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:07,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:07,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:07,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108596944] [2023-12-15 22:45:07,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:07,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:07,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:07,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:07,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:07,964 INFO L87 Difference]: Start difference. First operand 981 states and 1650 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:08,951 INFO L93 Difference]: Finished difference Result 2410 states and 4121 transitions. [2023-12-15 22:45:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2023-12-15 22:45:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:08,957 INFO L225 Difference]: With dead ends: 2410 [2023-12-15 22:45:08,957 INFO L226 Difference]: Without dead ends: 1547 [2023-12-15 22:45:08,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:08,959 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1130 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1213 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:08,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 703 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1213 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 22:45:08,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2023-12-15 22:45:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1456. [2023-12-15 22:45:09,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1141 states have (on average 1.6292725679228748) internal successors, (1859), 1148 states have internal predecessors, (1859), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2023-12-15 22:45:09,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2464 transitions. [2023-12-15 22:45:09,062 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2464 transitions. Word has length 115 [2023-12-15 22:45:09,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:09,062 INFO L495 AbstractCegarLoop]: Abstraction has 1456 states and 2464 transitions. [2023-12-15 22:45:09,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:09,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2464 transitions. [2023-12-15 22:45:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-15 22:45:09,067 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:09,068 INFO L195 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] [2023-12-15 22:45:09,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-15 22:45:09,084 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:09,084 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:09,084 INFO L85 PathProgramCache]: Analyzing trace with hash -216037200, now seen corresponding path program 1 times [2023-12-15 22:45:09,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:09,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290224032] [2023-12-15 22:45:09,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:09,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:09,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:09,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-15 22:45:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:45:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:45:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:45:09,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:45:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-12-15 22:45:09,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 22:45:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:09,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:09,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290224032] [2023-12-15 22:45:09,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290224032] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:09,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:09,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:09,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490419908] [2023-12-15 22:45:09,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:09,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:09,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:09,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:09,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:09,200 INFO L87 Difference]: Start difference. First operand 1456 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:10,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:10,889 INFO L93 Difference]: Finished difference Result 3472 states and 5999 transitions. [2023-12-15 22:45:10,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:10,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2023-12-15 22:45:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:10,899 INFO L225 Difference]: With dead ends: 3472 [2023-12-15 22:45:10,899 INFO L226 Difference]: Without dead ends: 2262 [2023-12-15 22:45:10,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:10,902 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 1128 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:10,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 705 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-15 22:45:10,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2023-12-15 22:45:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2171. [2023-12-15 22:45:10,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1733 states have (on average 1.634737449509521) internal successors, (2833), 1740 states have internal predecessors, (2833), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2023-12-15 22:45:10,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3700 transitions. [2023-12-15 22:45:10,983 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3700 transitions. Word has length 116 [2023-12-15 22:45:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:10,983 INFO L495 AbstractCegarLoop]: Abstraction has 2171 states and 3700 transitions. [2023-12-15 22:45:10,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:10,983 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3700 transitions. [2023-12-15 22:45:10,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-15 22:45:10,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:10,991 INFO L195 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] [2023-12-15 22:45:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-15 22:45:10,991 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:10,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:10,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1388657764, now seen corresponding path program 1 times [2023-12-15 22:45:10,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:10,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529598714] [2023-12-15 22:45:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:11,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:11,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:11,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-15 22:45:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:45:11,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 22:45:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-15 22:45:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:45:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-15 22:45:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 22:45:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:11,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:11,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529598714] [2023-12-15 22:45:11,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529598714] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:11,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:11,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:11,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562745174] [2023-12-15 22:45:11,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:11,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:11,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:11,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:11,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:11,069 INFO L87 Difference]: Start difference. First operand 2171 states and 3700 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:12,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:12,257 INFO L93 Difference]: Finished difference Result 5114 states and 8912 transitions. [2023-12-15 22:45:12,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2023-12-15 22:45:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:12,273 INFO L225 Difference]: With dead ends: 5114 [2023-12-15 22:45:12,273 INFO L226 Difference]: Without dead ends: 3398 [2023-12-15 22:45:12,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:12,278 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1126 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 386 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1141 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 386 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:12,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1141 Valid, 702 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [386 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:45:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2023-12-15 22:45:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3307. [2023-12-15 22:45:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2690 states have (on average 1.6382899628252787) internal successors, (4407), 2697 states have internal predecessors, (4407), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2023-12-15 22:45:12,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5658 transitions. [2023-12-15 22:45:12,393 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5658 transitions. Word has length 117 [2023-12-15 22:45:12,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:12,393 INFO L495 AbstractCegarLoop]: Abstraction has 3307 states and 5658 transitions. [2023-12-15 22:45:12,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:12,394 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5658 transitions. [2023-12-15 22:45:12,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-15 22:45:12,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:12,402 INFO L195 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] [2023-12-15 22:45:12,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-15 22:45:12,403 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:12,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:12,403 INFO L85 PathProgramCache]: Analyzing trace with hash 284689556, now seen corresponding path program 1 times [2023-12-15 22:45:12,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:12,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686434533] [2023-12-15 22:45:12,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:12,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 22:45:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:45:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-12-15 22:45:12,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-15 22:45:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:45:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-15 22:45:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-12-15 22:45:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:12,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:12,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686434533] [2023-12-15 22:45:12,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686434533] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:12,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:12,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:12,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137811594] [2023-12-15 22:45:12,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:12,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:12,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:12,476 INFO L87 Difference]: Start difference. First operand 3307 states and 5658 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:13,566 INFO L93 Difference]: Finished difference Result 8069 states and 14110 transitions. [2023-12-15 22:45:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:13,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2023-12-15 22:45:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:13,591 INFO L225 Difference]: With dead ends: 8069 [2023-12-15 22:45:13,591 INFO L226 Difference]: Without dead ends: 5456 [2023-12-15 22:45:13,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:13,601 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 1124 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:13,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 753 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 22:45:13,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2023-12-15 22:45:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5365. [2023-12-15 22:45:13,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4372 states have (on average 1.630832570905764) internal successors, (7130), 4379 states have internal predecessors, (7130), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2023-12-15 22:45:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 9177 transitions. [2023-12-15 22:45:13,830 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 9177 transitions. Word has length 118 [2023-12-15 22:45:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:13,831 INFO L495 AbstractCegarLoop]: Abstraction has 5365 states and 9177 transitions. [2023-12-15 22:45:13,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 9177 transitions. [2023-12-15 22:45:13,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-15 22:45:13,844 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:13,844 INFO L195 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] [2023-12-15 22:45:13,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-15 22:45:13,845 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:13,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:13,845 INFO L85 PathProgramCache]: Analyzing trace with hash -94214216, now seen corresponding path program 1 times [2023-12-15 22:45:13,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:13,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080642794] [2023-12-15 22:45:13,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:13,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:13,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-12-15 22:45:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:45:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-12-15 22:45:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-15 22:45:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-12-15 22:45:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-15 22:45:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2023-12-15 22:45:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:13,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:13,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080642794] [2023-12-15 22:45:13,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080642794] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:13,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:13,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51754861] [2023-12-15 22:45:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:13,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:13,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:13,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:13,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:13,917 INFO L87 Difference]: Start difference. First operand 5365 states and 9177 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:15,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:15,259 INFO L93 Difference]: Finished difference Result 13274 states and 23194 transitions. [2023-12-15 22:45:15,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:15,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2023-12-15 22:45:15,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:15,297 INFO L225 Difference]: With dead ends: 13274 [2023-12-15 22:45:15,297 INFO L226 Difference]: Without dead ends: 8989 [2023-12-15 22:45:15,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:15,311 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1122 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1137 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:15,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1137 Valid, 716 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:45:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2023-12-15 22:45:15,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8898. [2023-12-15 22:45:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7299 states have (on average 1.628579257432525) internal successors, (11887), 7306 states have internal predecessors, (11887), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2023-12-15 22:45:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15224 transitions. [2023-12-15 22:45:15,640 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15224 transitions. Word has length 119 [2023-12-15 22:45:15,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:15,640 INFO L495 AbstractCegarLoop]: Abstraction has 8898 states and 15224 transitions. [2023-12-15 22:45:15,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15224 transitions. [2023-12-15 22:45:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-15 22:45:15,659 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:15,659 INFO L195 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] [2023-12-15 22:45:15,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-15 22:45:15,659 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:15,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:15,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1189824782, now seen corresponding path program 1 times [2023-12-15 22:45:15,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:15,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740739833] [2023-12-15 22:45:15,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:15,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:15,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-12-15 22:45:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-12-15 22:45:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-15 22:45:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-12-15 22:45:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-12-15 22:45:15,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-15 22:45:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-12-15 22:45:15,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:15,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:15,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740739833] [2023-12-15 22:45:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740739833] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:15,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:15,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:15,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379590889] [2023-12-15 22:45:15,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:15,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:15,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:15,731 INFO L87 Difference]: Start difference. First operand 8898 states and 15224 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:17,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:17,136 INFO L93 Difference]: Finished difference Result 23046 states and 40223 transitions. [2023-12-15 22:45:17,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:17,136 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2023-12-15 22:45:17,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:17,185 INFO L225 Difference]: With dead ends: 23046 [2023-12-15 22:45:17,185 INFO L226 Difference]: Without dead ends: 15661 [2023-12-15 22:45:17,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:17,204 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1120 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1135 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:17,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1135 Valid, 716 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:45:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15661 states. [2023-12-15 22:45:17,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15661 to 15570. [2023-12-15 22:45:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15570 states, 12768 states have (on average 1.619360902255639) internal successors, (20676), 12775 states have internal predecessors, (20676), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2023-12-15 22:45:17,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 26563 transitions. [2023-12-15 22:45:17,697 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 26563 transitions. Word has length 120 [2023-12-15 22:45:17,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:17,698 INFO L495 AbstractCegarLoop]: Abstraction has 15570 states and 26563 transitions. [2023-12-15 22:45:17,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:17,698 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 26563 transitions. [2023-12-15 22:45:17,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-12-15 22:45:17,726 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:17,726 INFO L195 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] [2023-12-15 22:45:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-15 22:45:17,726 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:17,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash 914824247, now seen corresponding path program 1 times [2023-12-15 22:45:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006972684] [2023-12-15 22:45:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:17,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:17,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-15 22:45:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-12-15 22:45:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-15 22:45:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-12-15 22:45:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-12-15 22:45:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-15 22:45:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-15 22:45:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:17,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:17,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:17,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006972684] [2023-12-15 22:45:17,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006972684] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:17,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:17,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:17,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204134989] [2023-12-15 22:45:17,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:17,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:17,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:17,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:17,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:17,815 INFO L87 Difference]: Start difference. First operand 15570 states and 26563 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:19,586 INFO L93 Difference]: Finished difference Result 41213 states and 71821 transitions. [2023-12-15 22:45:19,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:19,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2023-12-15 22:45:19,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:19,681 INFO L225 Difference]: With dead ends: 41213 [2023-12-15 22:45:19,681 INFO L226 Difference]: Without dead ends: 27776 [2023-12-15 22:45:19,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:19,713 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1118 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1133 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:19,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1133 Valid, 703 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-15 22:45:19,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27776 states. [2023-12-15 22:45:20,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27776 to 27685. [2023-12-15 22:45:20,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27685 states, 22844 states have (on average 1.6154351251969883) internal successors, (36903), 22851 states have internal predecessors, (36903), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2023-12-15 22:45:20,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 47142 transitions. [2023-12-15 22:45:20,680 INFO L78 Accepts]: Start accepts. Automaton has 27685 states and 47142 transitions. Word has length 121 [2023-12-15 22:45:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:20,680 INFO L495 AbstractCegarLoop]: Abstraction has 27685 states and 47142 transitions. [2023-12-15 22:45:20,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:20,680 INFO L276 IsEmpty]: Start isEmpty. Operand 27685 states and 47142 transitions. [2023-12-15 22:45:20,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-12-15 22:45:20,716 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:20,716 INFO L195 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] [2023-12-15 22:45:20,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-15 22:45:20,716 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:20,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:20,716 INFO L85 PathProgramCache]: Analyzing trace with hash 856132848, now seen corresponding path program 1 times [2023-12-15 22:45:20,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:20,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279201856] [2023-12-15 22:45:20,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:20,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-15 22:45:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-15 22:45:20,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-15 22:45:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-12-15 22:45:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-15 22:45:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-15 22:45:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-12-15 22:45:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:20,794 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:20,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:20,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279201856] [2023-12-15 22:45:20,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279201856] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:20,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:20,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:20,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026309798] [2023-12-15 22:45:20,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:20,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:20,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:20,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:20,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:20,796 INFO L87 Difference]: Start difference. First operand 27685 states and 47142 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:23,046 INFO L93 Difference]: Finished difference Result 75405 states and 130615 transitions. [2023-12-15 22:45:23,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:23,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2023-12-15 22:45:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:23,245 INFO L225 Difference]: With dead ends: 75405 [2023-12-15 22:45:23,246 INFO L226 Difference]: Without dead ends: 50600 [2023-12-15 22:45:23,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:23,289 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 1116 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1240 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1131 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:23,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1131 Valid, 710 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1240 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-15 22:45:23,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50600 states. [2023-12-15 22:45:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50600 to 50509. [2023-12-15 22:45:25,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50509 states, 41953 states have (on average 1.6101589874383238) internal successors, (67551), 41960 states have internal predecessors, (67551), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2023-12-15 22:45:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50509 states to 50509 states and 85752 transitions. [2023-12-15 22:45:25,148 INFO L78 Accepts]: Start accepts. Automaton has 50509 states and 85752 transitions. Word has length 122 [2023-12-15 22:45:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:25,148 INFO L495 AbstractCegarLoop]: Abstraction has 50509 states and 85752 transitions. [2023-12-15 22:45:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 50509 states and 85752 transitions. [2023-12-15 22:45:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-15 22:45:25,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:25,177 INFO L195 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] [2023-12-15 22:45:25,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-15 22:45:25,177 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:25,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:25,178 INFO L85 PathProgramCache]: Analyzing trace with hash -789808905, now seen corresponding path program 1 times [2023-12-15 22:45:25,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:25,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315140274] [2023-12-15 22:45:25,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:25,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:25,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-15 22:45:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-15 22:45:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 22:45:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-15 22:45:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-15 22:45:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-15 22:45:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2023-12-15 22:45:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:25,255 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315140274] [2023-12-15 22:45:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315140274] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-15 22:45:25,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77672337] [2023-12-15 22:45:25,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:25,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-15 22:45:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-15 22:45:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-15 22:45:25,256 INFO L87 Difference]: Start difference. First operand 50509 states and 85752 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:28,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:28,298 INFO L93 Difference]: Finished difference Result 94152 states and 163521 transitions. [2023-12-15 22:45:28,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-15 22:45:28,298 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2023-12-15 22:45:28,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:28,776 INFO L225 Difference]: With dead ends: 94152 [2023-12-15 22:45:28,776 INFO L226 Difference]: Without dead ends: 93980 [2023-12-15 22:45:28,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:45:28,809 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1114 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1207 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:28,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 703 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1207 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-15 22:45:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93980 states. [2023-12-15 22:45:31,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93980 to 93889. [2023-12-15 22:45:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93889 states, 78534 states have (on average 1.6033692413476965) internal successors, (125919), 78541 states have internal predecessors, (125919), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2023-12-15 22:45:31,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 158764 transitions. [2023-12-15 22:45:31,671 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 158764 transitions. Word has length 123 [2023-12-15 22:45:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:45:31,672 INFO L495 AbstractCegarLoop]: Abstraction has 93889 states and 158764 transitions. [2023-12-15 22:45:31,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-15 22:45:31,672 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 158764 transitions. [2023-12-15 22:45:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-12-15 22:45:31,707 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:45:31,707 INFO L195 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] [2023-12-15 22:45:31,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-15 22:45:31,707 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:45:31,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:45:31,708 INFO L85 PathProgramCache]: Analyzing trace with hash 288645361, now seen corresponding path program 1 times [2023-12-15 22:45:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:45:31,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125613522] [2023-12-15 22:45:31,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:45:31,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:45:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 22:45:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 22:45:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 22:45:31,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-12-15 22:45:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-12-15 22:45:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-15 22:45:31,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 22:45:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:31,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-15 22:45:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-12-15 22:45:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-15 22:45:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-15 22:45:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-12-15 22:45:32,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-12-15 22:45:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:45:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-12-15 22:45:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:45:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125613522] [2023-12-15 22:45:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125613522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:45:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:45:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-12-15 22:45:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103958064] [2023-12-15 22:45:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:45:32,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 22:45:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:45:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 22:45:32,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:45:32,066 INFO L87 Difference]: Start difference. First operand 93889 states and 158764 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2023-12-15 22:45:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:45:41,696 INFO L93 Difference]: Finished difference Result 187565 states and 329112 transitions. [2023-12-15 22:45:41,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2023-12-15 22:45:41,696 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2023-12-15 22:45:41,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:45:42,601 INFO L225 Difference]: With dead ends: 187565 [2023-12-15 22:45:42,601 INFO L226 Difference]: Without dead ends: 187398 [2023-12-15 22:45:42,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1650 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=922, Invalid=4334, Unknown=0, NotChecked=0, Total=5256 [2023-12-15 22:45:42,670 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 4101 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 6980 mSolverCounterSat, 1318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4112 SdHoareTripleChecker+Valid, 2303 SdHoareTripleChecker+Invalid, 8298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1318 IncrementalHoareTripleChecker+Valid, 6980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:45:42,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4112 Valid, 2303 Invalid, 8298 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1318 Valid, 6980 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-12-15 22:45:42,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187398 states. [2023-12-15 22:45:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187398 to 187002. [2023-12-15 22:45:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187002 states, 156479 states have (on average 1.6042791684507187) internal successors, (251036), 156384 states have internal predecessors, (251036), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) Received shutdown request... [2023-12-15 22:45:50,645 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:45:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-15 22:45:50,646 WARN L619 AbstractCegarLoop]: Verification canceled: while ReachableStatesComputation was computing reachable states (96221 states constructed, input type DoubleDeckerAutomaton). [2023-12-15 22:45:50,662 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:45:50,663 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:45:50,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:45:50 BoogieIcfgContainer [2023-12-15 22:45:50,665 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:45:50,665 INFO L158 Benchmark]: Toolchain (without parser) took 60140.94ms. Allocated memory was 170.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 120.4MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 2.3GB. Max. memory is 8.0GB. [2023-12-15 22:45:50,665 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 170.9MB. Free memory was 125.4MB in the beginning and 125.3MB in the end (delta: 90.4kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:45:50,665 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.54ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 132.8MB in the end (delta: -12.7MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. [2023-12-15 22:45:50,665 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.65ms. Allocated memory is still 170.9MB. Free memory was 132.8MB in the beginning and 127.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 22:45:50,666 INFO L158 Benchmark]: Boogie Preprocessor took 59.00ms. Allocated memory is still 170.9MB. Free memory was 127.0MB in the beginning and 120.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-15 22:45:50,666 INFO L158 Benchmark]: RCFGBuilder took 781.31ms. Allocated memory is still 170.9MB. Free memory was 120.7MB in the beginning and 52.0MB in the end (delta: 68.7MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. [2023-12-15 22:45:50,666 INFO L158 Benchmark]: TraceAbstraction took 58561.12ms. Allocated memory was 170.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 51.0MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-12-15 22:45:50,667 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.55ms. Allocated memory is still 170.9MB. Free memory was 125.4MB in the beginning and 125.3MB in the end (delta: 90.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 677.54ms. Allocated memory is still 170.9MB. Free memory was 120.0MB in the beginning and 132.8MB in the end (delta: -12.7MB). Peak memory consumption was 42.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 57.65ms. Allocated memory is still 170.9MB. Free memory was 132.8MB in the beginning and 127.0MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 59.00ms. Allocated memory is still 170.9MB. Free memory was 127.0MB in the beginning and 120.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 781.31ms. Allocated memory is still 170.9MB. Free memory was 120.7MB in the beginning and 52.0MB in the end (delta: 68.7MB). Peak memory consumption was 68.2MB. Max. memory is 8.0GB. * TraceAbstraction took 58561.12ms. Allocated memory was 170.9MB in the beginning and 6.2GB in the end (delta: 6.1GB). Free memory was 51.0MB in the beginning and 4.7GB in the end (delta: -4.7GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] - GenericResultAtLocation [Line: 208]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [208] - GenericResultAtLocation [Line: 238]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [238] - GenericResultAtLocation [Line: 540]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [540] - GenericResultAtLocation [Line: 906]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [906] - GenericResultAtLocation [Line: 1978]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1978] - GenericResultAtLocation [Line: 2337]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2337] - GenericResultAtLocation [Line: 2734]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2734] - GenericResultAtLocation [Line: 2743]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2743] - GenericResultAtLocation [Line: 2778]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2778] - GenericResultAtLocation [Line: 2994]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2994] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 2739]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 2739). Cancelled while ReachableStatesComputation was computing reachable states (96221 states constructed, input type DoubleDeckerAutomaton). - StatisticsResult: Ultimate Automizer benchmark data CFG has 24 procedures, 320 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 58.5s, OverallIterations: 21, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 36.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22023 SdHoareTripleChecker+Valid, 21.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 21824 mSDsluCounter, 21496 SdHoareTripleChecker+Invalid, 18.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16539 mSDsCounter, 7248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34732 IncrementalHoareTripleChecker+Invalid, 41980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7248 mSolverCounterUnsat, 4957 mSDtfsCounter, 34732 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1606 GetRequests, 1273 SyntacticMatches, 0 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2158 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93889occurred in iteration=20, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1360 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2965 NumberOfCodeBlocks, 2965 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3047 ConstructedInterpolants, 0 QuantifiedInterpolants, 5445 SizeOfPredicates, 8 NumberOfNonLiveVariables, 6159 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 28 InterpolantComputations, 20 PerfectInterpolantSequences, 816/842 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown