./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 619b5b07f7bee6d460265c38ff6f46d0f3c88b87f6fc28a24021d9529c74e42f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 00:51:19,284 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 00:51:19,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 00:51:19,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 00:51:19,360 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 00:51:19,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 00:51:19,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 00:51:19,412 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 00:51:19,429 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 00:51:19,430 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 00:51:19,430 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 00:51:19,430 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 00:51:19,431 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 00:51:19,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 00:51:19,433 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 00:51:19,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 00:51:19,434 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 00:51:19,434 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 00:51:19,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 00:51:19,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 00:51:19,438 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 00:51:19,438 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 00:51:19,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 00:51:19,439 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 00:51:19,439 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 00:51:19,439 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 00:51:19,440 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 00:51:19,440 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 00:51:19,440 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 00:51:19,441 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 00:51:19,441 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 00:51:19,441 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 00:51:19,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:51:19,442 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 00:51:19,442 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 00:51:19,442 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 00:51:19,442 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 00:51:19,442 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 00:51:19,443 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 00:51:19,443 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 00:51:19,443 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 00:51:19,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 00:51:19,445 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 619b5b07f7bee6d460265c38ff6f46d0f3c88b87f6fc28a24021d9529c74e42f [2024-10-24 00:51:19,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 00:51:19,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 00:51:19,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 00:51:19,727 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 00:51:19,727 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 00:51:19,729 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c [2024-10-24 00:51:21,167 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 00:51:21,479 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 00:51:21,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c [2024-10-24 00:51:21,508 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36eed7da/07f4c95352794d8fb3fe46c37574460f/FLAG68b56a7d2 [2024-10-24 00:51:21,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d36eed7da/07f4c95352794d8fb3fe46c37574460f [2024-10-24 00:51:21,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 00:51:21,751 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 00:51:21,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 00:51:21,752 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 00:51:21,756 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 00:51:21,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:21" (1/1) ... [2024-10-24 00:51:21,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e96c1d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:21, skipping insertion in model container [2024-10-24 00:51:21,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:51:21" (1/1) ... [2024-10-24 00:51:21,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 00:51:22,164 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c[8467,8480] [2024-10-24 00:51:22,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:51:22,491 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 00:51:22,500 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-10-24 00:51:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [97] [2024-10-24 00:51:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [445] [2024-10-24 00:51:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [454] [2024-10-24 00:51:22,502 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [471] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [871] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1092] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2167] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2303] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2568] [2024-10-24 00:51:22,503 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2595] [2024-10-24 00:51:22,516 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product28.cil.c[8467,8480] [2024-10-24 00:51:22,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 00:51:22,617 INFO L204 MainTranslator]: Completed translation [2024-10-24 00:51:22,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22 WrapperNode [2024-10-24 00:51:22,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 00:51:22,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 00:51:22,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 00:51:22,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 00:51:22,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,653 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,700 INFO L138 Inliner]: procedures = 128, calls = 196, calls flagged for inlining = 55, calls inlined = 45, statements flattened = 859 [2024-10-24 00:51:22,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 00:51:22,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 00:51:22,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 00:51:22,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 00:51:22,713 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,746 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-10-24 00:51:22,747 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,747 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,799 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 00:51:22,809 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 00:51:22,809 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 00:51:22,809 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 00:51:22,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (1/1) ... [2024-10-24 00:51:22,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 00:51:22,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:22,843 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 00:51:22,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 00:51:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-24 00:51:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-24 00:51:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-24 00:51:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-24 00:51:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-24 00:51:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-24 00:51:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-24 00:51:22,893 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-24 00:51:22,893 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-24 00:51:22,893 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-24 00:51:22,893 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-24 00:51:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-24 00:51:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-24 00:51:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-24 00:51:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-24 00:51:22,895 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-24 00:51:22,895 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-24 00:51:22,895 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-24 00:51:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-24 00:51:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-24 00:51:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-24 00:51:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-24 00:51:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-24 00:51:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-24 00:51:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 00:51:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-24 00:51:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-24 00:51:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-24 00:51:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-24 00:51:22,899 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-24 00:51:22,899 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-24 00:51:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 00:51:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 00:51:23,110 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 00:51:23,112 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 00:51:23,944 INFO L? ?]: Removed 399 outVars from TransFormulas that were not future-live. [2024-10-24 00:51:23,944 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 00:51:24,007 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 00:51:24,007 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 00:51:24,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:24 BoogieIcfgContainer [2024-10-24 00:51:24,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 00:51:24,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 00:51:24,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 00:51:24,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 00:51:24,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:51:21" (1/3) ... [2024-10-24 00:51:24,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309ccd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:24, skipping insertion in model container [2024-10-24 00:51:24,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:51:22" (2/3) ... [2024-10-24 00:51:24,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309ccd20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:51:24, skipping insertion in model container [2024-10-24 00:51:24,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:51:24" (3/3) ... [2024-10-24 00:51:24,016 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product28.cil.c [2024-10-24 00:51:24,030 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 00:51:24,030 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 00:51:24,094 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 00:51:24,100 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@66d3223e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 00:51:24,100 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 00:51:24,106 INFO L276 IsEmpty]: Start isEmpty. Operand has 303 states, 229 states have (on average 1.5764192139737991) internal successors, (361), 233 states have internal predecessors, (361), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-24 00:51:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-24 00:51:24,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:24,123 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:24,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:24,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:24,127 INFO L85 PathProgramCache]: Analyzing trace with hash -413976073, now seen corresponding path program 1 times [2024-10-24 00:51:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:24,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690726071] [2024-10-24 00:51:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:24,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:24,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:51:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:51:24,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:51:24,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 00:51:24,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:51:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:51:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:51:24,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:51:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:51:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:24,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:24,908 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 00:51:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690726071] [2024-10-24 00:51:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690726071] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [299666700] [2024-10-24 00:51:24,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:24,913 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:24,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 00:51:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 00:51:25,244 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:25,272 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:51:25,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:51:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [299666700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:25,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:51:25,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-24 00:51:25,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201499982] [2024-10-24 00:51:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:25,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 00:51:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:25,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 00:51:25,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:51:25,304 INFO L87 Difference]: Start difference. First operand has 303 states, 229 states have (on average 1.5764192139737991) internal successors, (361), 233 states have internal predecessors, (361), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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) [2024-10-24 00:51:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:25,383 INFO L93 Difference]: Finished difference Result 465 states and 692 transitions. [2024-10-24 00:51:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 00:51:25,386 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 98 [2024-10-24 00:51:25,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:25,400 INFO L225 Difference]: With dead ends: 465 [2024-10-24 00:51:25,400 INFO L226 Difference]: Without dead ends: 300 [2024-10-24 00:51:25,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:51:25,407 INFO L432 NwaCegarLoop]: 447 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:25,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:51:25,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-10-24 00:51:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2024-10-24 00:51:25,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 227 states have (on average 1.5594713656387664) internal successors, (354), 230 states have internal predecessors, (354), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 00:51:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 453 transitions. [2024-10-24 00:51:25,472 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 453 transitions. Word has length 98 [2024-10-24 00:51:25,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:25,474 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 453 transitions. [2024-10-24 00:51:25,474 INFO L472 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) [2024-10-24 00:51:25,474 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 453 transitions. [2024-10-24 00:51:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 00:51:25,479 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:25,479 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:25,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 00:51:25,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-24 00:51:25,680 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:25,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:25,681 INFO L85 PathProgramCache]: Analyzing trace with hash 468515798, now seen corresponding path program 1 times [2024-10-24 00:51:25,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:25,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031031263] [2024-10-24 00:51:25,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:25,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:51:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:51:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:51:25,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 00:51:25,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:51:25,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:51:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:25,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:51:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:51:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-24 00:51:26,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:26,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031031263] [2024-10-24 00:51:26,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031031263] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708226450] [2024-10-24 00:51:26,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:26,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:26,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:26,020 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:26,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 00:51:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 00:51:26,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:51:26,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:51:26,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708226450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:26,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:51:26,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:51:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92042980] [2024-10-24 00:51:26,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:26,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:51:26,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:26,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:51:26,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:51:26,343 INFO L87 Difference]: Start difference. First operand 300 states and 453 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) [2024-10-24 00:51:26,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:26,422 INFO L93 Difference]: Finished difference Result 461 states and 679 transitions. [2024-10-24 00:51:26,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:51:26,431 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 99 [2024-10-24 00:51:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:26,435 INFO L225 Difference]: With dead ends: 461 [2024-10-24 00:51:26,435 INFO L226 Difference]: Without dead ends: 302 [2024-10-24 00:51:26,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:51:26,437 INFO L432 NwaCegarLoop]: 444 mSDtfsCounter, 0 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:26,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 887 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:51:26,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-24 00:51:26,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-10-24 00:51:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 229 states have (on average 1.554585152838428) internal successors, (356), 232 states have internal predecessors, (356), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-10-24 00:51:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 455 transitions. [2024-10-24 00:51:26,464 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 455 transitions. Word has length 99 [2024-10-24 00:51:26,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:26,466 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 455 transitions. [2024-10-24 00:51:26,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:26,466 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 455 transitions. [2024-10-24 00:51:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-24 00:51:26,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:26,472 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:26,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 00:51:26,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-24 00:51:26,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:26,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:26,674 INFO L85 PathProgramCache]: Analyzing trace with hash -483380743, now seen corresponding path program 1 times [2024-10-24 00:51:26,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:26,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394519256] [2024-10-24 00:51:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:51:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:51:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:51:26,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 00:51:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 00:51:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:51:26,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:51:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:51:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:51:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:51:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:26,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:51:26,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394519256] [2024-10-24 00:51:26,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394519256] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:26,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107405884] [2024-10-24 00:51:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:26,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:26,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:26,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:26,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 00:51:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:51:27,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:27,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-24 00:51:27,263 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:51:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107405884] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:27,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:51:27,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-24 00:51:27,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960248601] [2024-10-24 00:51:27,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:27,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 00:51:27,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:27,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 00:51:27,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:51:27,265 INFO L87 Difference]: Start difference. First operand 302 states and 455 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:27,335 INFO L93 Difference]: Finished difference Result 630 states and 962 transitions. [2024-10-24 00:51:27,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 00:51:27,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-10-24 00:51:27,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:27,340 INFO L225 Difference]: With dead ends: 630 [2024-10-24 00:51:27,340 INFO L226 Difference]: Without dead ends: 350 [2024-10-24 00:51:27,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 00:51:27,345 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 95 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:27,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 857 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 00:51:27,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-10-24 00:51:27,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 345. [2024-10-24 00:51:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 261 states have (on average 1.5670498084291187) internal successors, (409), 264 states have internal predecessors, (409), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-24 00:51:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 530 transitions. [2024-10-24 00:51:27,389 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 530 transitions. Word has length 104 [2024-10-24 00:51:27,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:27,389 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 530 transitions. [2024-10-24 00:51:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:27,390 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 530 transitions. [2024-10-24 00:51:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-24 00:51:27,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:27,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:27,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-24 00:51:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:27,594 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:27,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:27,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1859197006, now seen corresponding path program 1 times [2024-10-24 00:51:27,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:27,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143205573] [2024-10-24 00:51:27,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:27,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 00:51:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 00:51:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-24 00:51:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 00:51:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 00:51:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:51:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:51:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:51:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:27,785 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:51:27,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143205573] [2024-10-24 00:51:27,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143205573] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:27,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174210972] [2024-10-24 00:51:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:27,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:27,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:27,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:27,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 00:51:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 00:51:28,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 00:51:28,139 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:51:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174210972] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:51:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-24 00:51:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049099260] [2024-10-24 00:51:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:28,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:51:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:51:28,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:51:28,141 INFO L87 Difference]: Start difference. First operand 345 states and 530 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:28,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:28,248 INFO L93 Difference]: Finished difference Result 685 states and 1054 transitions. [2024-10-24 00:51:28,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:51:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 105 [2024-10-24 00:51:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:28,252 INFO L225 Difference]: With dead ends: 685 [2024-10-24 00:51:28,253 INFO L226 Difference]: Without dead ends: 347 [2024-10-24 00:51:28,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:51:28,257 INFO L432 NwaCegarLoop]: 436 mSDtfsCounter, 2 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:28,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1733 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:51:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-24 00:51:28,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2024-10-24 00:51:28,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 262 states have (on average 1.5648854961832062) internal successors, (410), 266 states have internal predecessors, (410), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-10-24 00:51:28,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 533 transitions. [2024-10-24 00:51:28,289 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 533 transitions. Word has length 105 [2024-10-24 00:51:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:28,291 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 533 transitions. [2024-10-24 00:51:28,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:28,291 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 533 transitions. [2024-10-24 00:51:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-24 00:51:28,293 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:28,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:28,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 00:51:28,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:28,496 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:28,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:28,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1335082445, now seen corresponding path program 1 times [2024-10-24 00:51:28,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:28,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897862140] [2024-10-24 00:51:28,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:28,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 00:51:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-24 00:51:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-24 00:51:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 00:51:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:51:28,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:51:28,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:51:28,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:51:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,706 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:51:28,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897862140] [2024-10-24 00:51:28,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897862140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:28,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981543104] [2024-10-24 00:51:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:28,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:28,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:28,708 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:28,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 00:51:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:28,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 00:51:28,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:29,035 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 00:51:29,036 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 00:51:29,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981543104] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:29,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 00:51:29,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-24 00:51:29,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139798496] [2024-10-24 00:51:29,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:29,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 00:51:29,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 00:51:29,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:29,038 INFO L87 Difference]: Start difference. First operand 347 states and 533 transitions. Second operand has 5 states, 5 states have (on average 13.8) 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), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:29,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:29,121 INFO L93 Difference]: Finished difference Result 687 states and 1059 transitions. [2024-10-24 00:51:29,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 00:51:29,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) 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), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-24 00:51:29,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:29,124 INFO L225 Difference]: With dead ends: 687 [2024-10-24 00:51:29,124 INFO L226 Difference]: Without dead ends: 349 [2024-10-24 00:51:29,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:29,126 INFO L432 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:29,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1719 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 00:51:29,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2024-10-24 00:51:29,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2024-10-24 00:51:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.5627376425855513) internal successors, (411), 268 states have internal predecessors, (411), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-10-24 00:51:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 539 transitions. [2024-10-24 00:51:29,140 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 539 transitions. Word has length 106 [2024-10-24 00:51:29,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:29,140 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 539 transitions. [2024-10-24 00:51:29,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) 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), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 539 transitions. [2024-10-24 00:51:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-24 00:51:29,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:29,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:29,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-24 00:51:29,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:29,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:29,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:29,344 INFO L85 PathProgramCache]: Analyzing trace with hash -755917868, now seen corresponding path program 1 times [2024-10-24 00:51:29,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:29,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616578685] [2024-10-24 00:51:29,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:29,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-24 00:51:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 00:51:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:51:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:51:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:51:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:51:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:51:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:51:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:51:29,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616578685] [2024-10-24 00:51:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616578685] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:51:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086282867] [2024-10-24 00:51:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:29,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:51:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:51:29,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:51:29,558 INFO L87 Difference]: Start difference. First operand 349 states and 539 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:31,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:31,010 INFO L93 Difference]: Finished difference Result 741 states and 1152 transitions. [2024-10-24 00:51:31,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:31,011 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 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 [2024-10-24 00:51:31,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:31,014 INFO L225 Difference]: With dead ends: 741 [2024-10-24 00:51:31,014 INFO L226 Difference]: Without dead ends: 411 [2024-10-24 00:51:31,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:31,016 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 737 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:31,018 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 817 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:51:31,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-10-24 00:51:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 349. [2024-10-24 00:51:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 263 states have (on average 1.5627376425855513) internal successors, (411), 268 states have internal predecessors, (411), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-10-24 00:51:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 538 transitions. [2024-10-24 00:51:31,049 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 538 transitions. Word has length 107 [2024-10-24 00:51:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:31,049 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 538 transitions. [2024-10-24 00:51:31,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 538 transitions. [2024-10-24 00:51:31,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 00:51:31,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:31,051 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:31,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 00:51:31,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:31,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:31,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1792395443, now seen corresponding path program 2 times [2024-10-24 00:51:31,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:31,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583209133] [2024-10-24 00:51:31,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:31,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 00:51:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 00:51:31,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:51:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:51:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:31,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:51:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:51:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:51:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:31,236 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-24 00:51:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583209133] [2024-10-24 00:51:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583209133] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:31,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 00:51:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412461194] [2024-10-24 00:51:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:31,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 00:51:31,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:31,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 00:51:31,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 00:51:31,238 INFO L87 Difference]: Start difference. First operand 349 states and 538 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:32,693 INFO L93 Difference]: Finished difference Result 743 states and 1155 transitions. [2024-10-24 00:51:32,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 00:51:32,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 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 108 [2024-10-24 00:51:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:32,697 INFO L225 Difference]: With dead ends: 743 [2024-10-24 00:51:32,697 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 00:51:32,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:32,699 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 734 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1890 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 2119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:32,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 817 Invalid, 2119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 00:51:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 00:51:32,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 351. [2024-10-24 00:51:32,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 264 states have (on average 1.5606060606060606) internal successors, (412), 270 states have internal predecessors, (412), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-10-24 00:51:32,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 541 transitions. [2024-10-24 00:51:32,724 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 541 transitions. Word has length 108 [2024-10-24 00:51:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:32,724 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 541 transitions. [2024-10-24 00:51:32,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (15), 5 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-24 00:51:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 541 transitions. [2024-10-24 00:51:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-24 00:51:32,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:32,727 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:32,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 00:51:32,727 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:32,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:32,728 INFO L85 PathProgramCache]: Analyzing trace with hash 504202105, now seen corresponding path program 1 times [2024-10-24 00:51:32,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:32,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829028215] [2024-10-24 00:51:32,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:32,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:32,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:32,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:32,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:32,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 00:51:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:51:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:51:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:51:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:51:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:51:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:51:32,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:32,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829028215] [2024-10-24 00:51:32,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829028215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:32,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:32,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:51:32,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002229830] [2024-10-24 00:51:32,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:32,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:51:32,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:32,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:51:32,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:51:32,951 INFO L87 Difference]: Start difference. First operand 351 states and 541 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:51:34,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:34,837 INFO L93 Difference]: Finished difference Result 741 states and 1150 transitions. [2024-10-24 00:51:34,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:51:34,838 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 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 [2024-10-24 00:51:34,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:34,841 INFO L225 Difference]: With dead ends: 741 [2024-10-24 00:51:34,842 INFO L226 Difference]: Without dead ends: 413 [2024-10-24 00:51:34,843 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:51:34,844 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 737 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3188 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 3422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 3188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:34,844 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1174 Invalid, 3422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 3188 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:51:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-10-24 00:51:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 351. [2024-10-24 00:51:34,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 264 states have (on average 1.5606060606060606) internal successors, (412), 270 states have internal predecessors, (412), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-10-24 00:51:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 540 transitions. [2024-10-24 00:51:34,873 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 540 transitions. Word has length 109 [2024-10-24 00:51:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:34,874 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 540 transitions. [2024-10-24 00:51:34,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 8 states have internal predecessors, (70), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:51:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 540 transitions. [2024-10-24 00:51:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-24 00:51:34,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:34,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:34,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 00:51:34,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:34,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:34,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1153678138, now seen corresponding path program 2 times [2024-10-24 00:51:34,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:34,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477658865] [2024-10-24 00:51:34,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:34,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:34,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:35,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 00:51:35,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:51:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:51:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:51:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:51:35,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:51:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:51:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-24 00:51:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477658865] [2024-10-24 00:51:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477658865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:35,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:35,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 00:51:35,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901928374] [2024-10-24 00:51:35,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:35,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 00:51:35,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:35,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 00:51:35,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-24 00:51:35,165 INFO L87 Difference]: Start difference. First operand 351 states and 540 transitions. Second operand has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:51:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:37,082 INFO L93 Difference]: Finished difference Result 743 states and 1156 transitions. [2024-10-24 00:51:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 00:51:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 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 110 [2024-10-24 00:51:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:37,085 INFO L225 Difference]: With dead ends: 743 [2024-10-24 00:51:37,085 INFO L226 Difference]: Without dead ends: 415 [2024-10-24 00:51:37,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-24 00:51:37,087 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 734 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 3222 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 3454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 3222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:37,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 1175 Invalid, 3454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 3222 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 00:51:37,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-24 00:51:37,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 353. [2024-10-24 00:51:37,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 265 states have (on average 1.558490566037736) internal successors, (413), 272 states have internal predecessors, (413), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-10-24 00:51:37,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 546 transitions. [2024-10-24 00:51:37,112 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 546 transitions. Word has length 110 [2024-10-24 00:51:37,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:37,113 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 546 transitions. [2024-10-24 00:51:37,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.1) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-24 00:51:37,113 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 546 transitions. [2024-10-24 00:51:37,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-24 00:51:37,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:37,115 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:37,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 00:51:37,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:37,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:37,116 INFO L85 PathProgramCache]: Analyzing trace with hash 868232542, now seen corresponding path program 1 times [2024-10-24 00:51:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:37,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444825758] [2024-10-24 00:51:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:37,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-24 00:51:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:51:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:51:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:51:37,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:51:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:51:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444825758] [2024-10-24 00:51:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444825758] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 00:51:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81516457] [2024-10-24 00:51:37,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:37,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:37,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 00:51:37,273 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 00:51:37,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 00:51:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:37,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 994 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 00:51:37,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 00:51:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:37,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 00:51:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:37,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81516457] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 00:51:37,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 00:51:37,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-24 00:51:37,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788273123] [2024-10-24 00:51:37,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 00:51:37,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 00:51:37,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:37,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 00:51:37,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:37,655 INFO L87 Difference]: Start difference. First operand 353 states and 546 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 00:51:39,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:39,002 INFO L93 Difference]: Finished difference Result 884 states and 1441 transitions. [2024-10-24 00:51:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 00:51:39,003 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 111 [2024-10-24 00:51:39,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:39,007 INFO L225 Difference]: With dead ends: 884 [2024-10-24 00:51:39,008 INFO L226 Difference]: Without dead ends: 725 [2024-10-24 00:51:39,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 00:51:39,010 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1097 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1972 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1142 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 2316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 1972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:39,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1142 Valid, 997 Invalid, 2316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 1972 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 00:51:39,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-24 00:51:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 648. [2024-10-24 00:51:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 496 states have (on average 1.6189516129032258) internal successors, (803), 503 states have internal predecessors, (803), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-10-24 00:51:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1074 transitions. [2024-10-24 00:51:39,052 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1074 transitions. Word has length 111 [2024-10-24 00:51:39,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:39,054 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 1074 transitions. [2024-10-24 00:51:39,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 7 states have internal predecessors, (98), 2 states have call successors, (30), 5 states have call predecessors, (30), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 00:51:39,054 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1074 transitions. [2024-10-24 00:51:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-24 00:51:39,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:39,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:39,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-24 00:51:39,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 00:51:39,259 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:39,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:39,260 INFO L85 PathProgramCache]: Analyzing trace with hash 593859387, now seen corresponding path program 1 times [2024-10-24 00:51:39,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:39,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950423602] [2024-10-24 00:51:39,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:39,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:39,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-24 00:51:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:51:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:51:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:51:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-24 00:51:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:51:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:51:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:39,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950423602] [2024-10-24 00:51:39,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950423602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:39,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:39,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187240815] [2024-10-24 00:51:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:39,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:39,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:39,367 INFO L87 Difference]: Start difference. First operand 648 states and 1074 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:40,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:40,427 INFO L93 Difference]: Finished difference Result 1595 states and 2710 transitions. [2024-10-24 00:51:40,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:40,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 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 [2024-10-24 00:51:40,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:40,435 INFO L225 Difference]: With dead ends: 1595 [2024-10-24 00:51:40,435 INFO L226 Difference]: Without dead ends: 1007 [2024-10-24 00:51:40,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:40,438 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 826 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:40,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 594 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:40,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-24 00:51:40,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 940. [2024-10-24 00:51:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 724 states have (on average 1.6298342541436464) internal successors, (1180), 731 states have internal predecessors, (1180), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-10-24 00:51:40,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1589 transitions. [2024-10-24 00:51:40,488 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1589 transitions. Word has length 117 [2024-10-24 00:51:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:40,488 INFO L471 AbstractCegarLoop]: Abstraction has 940 states and 1589 transitions. [2024-10-24 00:51:40,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:40,489 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1589 transitions. [2024-10-24 00:51:40,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-24 00:51:40,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:40,494 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:40,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 00:51:40,494 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:40,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:40,495 INFO L85 PathProgramCache]: Analyzing trace with hash -803479539, now seen corresponding path program 1 times [2024-10-24 00:51:40,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:40,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493509340] [2024-10-24 00:51:40,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:40,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 00:51:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-24 00:51:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:51:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:51:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 00:51:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:51:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:51:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:40,604 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:40,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:40,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493509340] [2024-10-24 00:51:40,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493509340] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:40,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:40,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:40,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618891839] [2024-10-24 00:51:40,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:40,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:40,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:40,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:40,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:40,607 INFO L87 Difference]: Start difference. First operand 940 states and 1589 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:41,676 INFO L93 Difference]: Finished difference Result 2292 states and 3937 transitions. [2024-10-24 00:51:41,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:41,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 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 [2024-10-24 00:51:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:41,685 INFO L225 Difference]: With dead ends: 2292 [2024-10-24 00:51:41,686 INFO L226 Difference]: Without dead ends: 1462 [2024-10-24 00:51:41,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:41,690 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 824 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:41,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 585 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:41,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2024-10-24 00:51:41,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1395. [2024-10-24 00:51:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1395 states, 1084 states have (on average 1.636531365313653) internal successors, (1774), 1091 states have internal predecessors, (1774), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-10-24 00:51:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 2373 transitions. [2024-10-24 00:51:41,757 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 2373 transitions. Word has length 118 [2024-10-24 00:51:41,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:41,758 INFO L471 AbstractCegarLoop]: Abstraction has 1395 states and 2373 transitions. [2024-10-24 00:51:41,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:41,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 2373 transitions. [2024-10-24 00:51:41,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-24 00:51:41,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:41,766 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:41,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 00:51:41,766 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:41,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1159932381, now seen corresponding path program 1 times [2024-10-24 00:51:41,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:41,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920178806] [2024-10-24 00:51:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 00:51:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-24 00:51:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:51:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:51:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 00:51:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:51:41,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:51:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:41,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:41,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920178806] [2024-10-24 00:51:41,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920178806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:41,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720703386] [2024-10-24 00:51:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:41,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:41,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:41,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:41,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:41,866 INFO L87 Difference]: Start difference. First operand 1395 states and 2373 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:42,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:42,930 INFO L93 Difference]: Finished difference Result 3310 states and 5749 transitions. [2024-10-24 00:51:42,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:42,931 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 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 [2024-10-24 00:51:42,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:42,943 INFO L225 Difference]: With dead ends: 3310 [2024-10-24 00:51:42,943 INFO L226 Difference]: Without dead ends: 2145 [2024-10-24 00:51:42,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:42,949 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 822 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 837 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:42,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [837 Valid, 570 Invalid, 1285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-10-24 00:51:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2078. [2024-10-24 00:51:43,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2078 states, 1644 states have (on average 1.6423357664233578) internal successors, (2700), 1651 states have internal predecessors, (2700), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-10-24 00:51:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2078 states to 2078 states and 3561 transitions. [2024-10-24 00:51:43,054 INFO L78 Accepts]: Start accepts. Automaton has 2078 states and 3561 transitions. Word has length 119 [2024-10-24 00:51:43,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:43,054 INFO L471 AbstractCegarLoop]: Abstraction has 2078 states and 3561 transitions. [2024-10-24 00:51:43,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:43,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2078 states and 3561 transitions. [2024-10-24 00:51:43,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-24 00:51:43,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:43,064 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:43,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 00:51:43,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:43,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:43,065 INFO L85 PathProgramCache]: Analyzing trace with hash -2092714002, now seen corresponding path program 1 times [2024-10-24 00:51:43,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:43,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087254583] [2024-10-24 00:51:43,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:43,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:43,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 00:51:43,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-24 00:51:43,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 00:51:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:51:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-24 00:51:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:51:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:51:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:43,174 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:43,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:43,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087254583] [2024-10-24 00:51:43,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087254583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:43,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:43,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:43,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480349391] [2024-10-24 00:51:43,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:43,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:43,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:43,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:43,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:43,176 INFO L87 Difference]: Start difference. First operand 2078 states and 3561 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:44,192 INFO L93 Difference]: Finished difference Result 4880 states and 8554 transitions. [2024-10-24 00:51:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:44,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 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 [2024-10-24 00:51:44,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:44,210 INFO L225 Difference]: With dead ends: 4880 [2024-10-24 00:51:44,210 INFO L226 Difference]: Without dead ends: 3229 [2024-10-24 00:51:44,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:44,217 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 820 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:44,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 570 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:44,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-24 00:51:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3162. [2024-10-24 00:51:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3162 states, 2549 states have (on average 1.6461357395056886) internal successors, (4196), 2556 states have internal predecessors, (4196), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-10-24 00:51:44,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3162 states to 3162 states and 5441 transitions. [2024-10-24 00:51:44,354 INFO L78 Accepts]: Start accepts. Automaton has 3162 states and 5441 transitions. Word has length 120 [2024-10-24 00:51:44,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:44,354 INFO L471 AbstractCegarLoop]: Abstraction has 3162 states and 5441 transitions. [2024-10-24 00:51:44,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3162 states and 5441 transitions. [2024-10-24 00:51:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 00:51:44,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:44,397 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:44,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 00:51:44,397 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:44,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1525973785, now seen corresponding path program 1 times [2024-10-24 00:51:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:44,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218766956] [2024-10-24 00:51:44,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:44,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:44,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 00:51:44,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 00:51:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-24 00:51:44,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:51:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-24 00:51:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:51:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:51:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:44,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:44,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218766956] [2024-10-24 00:51:44,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218766956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:44,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:44,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:44,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292990453] [2024-10-24 00:51:44,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:44,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:44,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:44,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:44,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:44,525 INFO L87 Difference]: Start difference. First operand 3162 states and 5441 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:45,492 INFO L93 Difference]: Finished difference Result 7711 states and 13566 transitions. [2024-10-24 00:51:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-24 00:51:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:45,521 INFO L225 Difference]: With dead ends: 7711 [2024-10-24 00:51:45,521 INFO L226 Difference]: Without dead ends: 5199 [2024-10-24 00:51:45,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:45,532 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 818 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:45,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 602 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:51:45,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5199 states. [2024-10-24 00:51:45,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5199 to 5132. [2024-10-24 00:51:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5132 states, 4143 states have (on average 1.6381848901762008) internal successors, (6787), 4150 states have internal predecessors, (6787), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-10-24 00:51:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5132 states to 5132 states and 8828 transitions. [2024-10-24 00:51:45,821 INFO L78 Accepts]: Start accepts. Automaton has 5132 states and 8828 transitions. Word has length 121 [2024-10-24 00:51:45,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:45,822 INFO L471 AbstractCegarLoop]: Abstraction has 5132 states and 8828 transitions. [2024-10-24 00:51:45,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:45,822 INFO L276 IsEmpty]: Start isEmpty. Operand 5132 states and 8828 transitions. [2024-10-24 00:51:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-24 00:51:45,843 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:45,844 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:45,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 00:51:45,844 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:45,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:45,844 INFO L85 PathProgramCache]: Analyzing trace with hash 2080387762, now seen corresponding path program 1 times [2024-10-24 00:51:45,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:45,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754456651] [2024-10-24 00:51:45,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:45,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:45,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-24 00:51:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 00:51:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-24 00:51:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-24 00:51:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-24 00:51:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:51:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-24 00:51:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:45,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:45,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754456651] [2024-10-24 00:51:45,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754456651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:45,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868174364] [2024-10-24 00:51:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:45,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:45,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:45,956 INFO L87 Difference]: Start difference. First operand 5132 states and 8828 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:47,104 INFO L93 Difference]: Finished difference Result 12692 states and 22314 transitions. [2024-10-24 00:51:47,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:47,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-24 00:51:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:47,163 INFO L225 Difference]: With dead ends: 12692 [2024-10-24 00:51:47,163 INFO L226 Difference]: Without dead ends: 8576 [2024-10-24 00:51:47,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:47,182 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 816 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:47,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 581 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2024-10-24 00:51:47,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 8509. [2024-10-24 00:51:47,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8509 states, 6914 states have (on average 1.6358113971651722) internal successors, (11310), 6921 states have internal predecessors, (11310), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-10-24 00:51:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8509 states to 8509 states and 14641 transitions. [2024-10-24 00:51:47,591 INFO L78 Accepts]: Start accepts. Automaton has 8509 states and 14641 transitions. Word has length 122 [2024-10-24 00:51:47,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:47,591 INFO L471 AbstractCegarLoop]: Abstraction has 8509 states and 14641 transitions. [2024-10-24 00:51:47,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:47,592 INFO L276 IsEmpty]: Start isEmpty. Operand 8509 states and 14641 transitions. [2024-10-24 00:51:47,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-24 00:51:47,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:47,615 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:47,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 00:51:47,615 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:47,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:47,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1929376667, now seen corresponding path program 1 times [2024-10-24 00:51:47,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:47,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269832295] [2024-10-24 00:51:47,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:47,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-24 00:51:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-24 00:51:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 00:51:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-24 00:51:47,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-24 00:51:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 00:51:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 00:51:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:47,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:47,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269832295] [2024-10-24 00:51:47,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269832295] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:47,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:47,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:47,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445366310] [2024-10-24 00:51:47,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:47,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:47,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:47,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:47,721 INFO L87 Difference]: Start difference. First operand 8509 states and 14641 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:48,942 INFO L93 Difference]: Finished difference Result 22044 states and 38713 transitions. [2024-10-24 00:51:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-24 00:51:48,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:49,007 INFO L225 Difference]: With dead ends: 22044 [2024-10-24 00:51:49,008 INFO L226 Difference]: Without dead ends: 14960 [2024-10-24 00:51:49,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:49,034 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 814 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 829 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:49,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [829 Valid, 596 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:51:49,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14960 states. [2024-10-24 00:51:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14960 to 14893. [2024-10-24 00:51:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14893 states, 12095 states have (on average 1.6260438197602316) internal successors, (19667), 12102 states have internal predecessors, (19667), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-10-24 00:51:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14893 states to 14893 states and 25548 transitions. [2024-10-24 00:51:49,694 INFO L78 Accepts]: Start accepts. Automaton has 14893 states and 25548 transitions. Word has length 123 [2024-10-24 00:51:49,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:49,695 INFO L471 AbstractCegarLoop]: Abstraction has 14893 states and 25548 transitions. [2024-10-24 00:51:49,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:49,696 INFO L276 IsEmpty]: Start isEmpty. Operand 14893 states and 25548 transitions. [2024-10-24 00:51:49,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-24 00:51:49,731 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:49,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:49,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 00:51:49,732 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:49,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:49,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1294665267, now seen corresponding path program 1 times [2024-10-24 00:51:49,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:49,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254447189] [2024-10-24 00:51:49,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:49,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:49,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-24 00:51:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-24 00:51:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 00:51:49,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 00:51:49,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 00:51:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-24 00:51:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-24 00:51:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:49,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:49,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254447189] [2024-10-24 00:51:49,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254447189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:49,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:49,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:49,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625460094] [2024-10-24 00:51:49,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:49,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:49,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:49,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:49,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:49,834 INFO L87 Difference]: Start difference. First operand 14893 states and 25548 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:51,363 INFO L93 Difference]: Finished difference Result 39403 states and 69099 transitions. [2024-10-24 00:51:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-10-24 00:51:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:51,504 INFO L225 Difference]: With dead ends: 39403 [2024-10-24 00:51:51,505 INFO L226 Difference]: Without dead ends: 26527 [2024-10-24 00:51:51,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:51,562 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 812 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:51,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 571 Invalid, 1297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1023 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 00:51:51,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26527 states. [2024-10-24 00:51:52,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26527 to 26460. [2024-10-24 00:51:52,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26460 states, 21623 states have (on average 1.6219765989918142) internal successors, (35072), 21630 states have internal predecessors, (35072), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-10-24 00:51:52,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26460 states to 26460 states and 45305 transitions. [2024-10-24 00:51:52,864 INFO L78 Accepts]: Start accepts. Automaton has 26460 states and 45305 transitions. Word has length 124 [2024-10-24 00:51:52,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:52,865 INFO L471 AbstractCegarLoop]: Abstraction has 26460 states and 45305 transitions. [2024-10-24 00:51:52,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26460 states and 45305 transitions. [2024-10-24 00:51:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 00:51:52,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:52,898 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:52,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 00:51:52,898 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:52,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:52,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1751403395, now seen corresponding path program 1 times [2024-10-24 00:51:52,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:52,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078451779] [2024-10-24 00:51:52,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:52,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:52,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 00:51:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-24 00:51:52,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 00:51:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 00:51:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 00:51:52,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 00:51:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-24 00:51:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:52,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078451779] [2024-10-24 00:51:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078451779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:52,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406704722] [2024-10-24 00:51:52,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:52,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:52,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:52,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:52,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:52,994 INFO L87 Difference]: Start difference. First operand 26460 states and 45305 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:51:55,131 INFO L93 Difference]: Finished difference Result 72015 states and 125523 transitions. [2024-10-24 00:51:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:51:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-10-24 00:51:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:51:55,379 INFO L225 Difference]: With dead ends: 72015 [2024-10-24 00:51:55,380 INFO L226 Difference]: Without dead ends: 48287 [2024-10-24 00:51:55,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:51:55,477 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 810 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:51:55,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 585 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:51:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48287 states. [2024-10-24 00:51:57,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48287 to 48220. [2024-10-24 00:51:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48220 states, 39668 states have (on average 1.6165170918624585) internal successors, (64124), 39675 states have internal predecessors, (64124), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-10-24 00:51:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48220 states to 48220 states and 82319 transitions. [2024-10-24 00:51:57,564 INFO L78 Accepts]: Start accepts. Automaton has 48220 states and 82319 transitions. Word has length 125 [2024-10-24 00:51:57,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:51:57,566 INFO L471 AbstractCegarLoop]: Abstraction has 48220 states and 82319 transitions. [2024-10-24 00:51:57,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:51:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 48220 states and 82319 transitions. [2024-10-24 00:51:57,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 00:51:57,605 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:51:57,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:51:57,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 00:51:57,606 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:51:57,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:51:57,606 INFO L85 PathProgramCache]: Analyzing trace with hash -47176237, now seen corresponding path program 1 times [2024-10-24 00:51:57,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:51:57,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285991205] [2024-10-24 00:51:57,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:51:57,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:51:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:51:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:51:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:51:57,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:51:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:51:57,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:51:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 00:51:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 00:51:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-24 00:51:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-24 00:51:57,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-24 00:51:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-24 00:51:57,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-24 00:51:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:51:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:51:57,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:51:57,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285991205] [2024-10-24 00:51:57,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285991205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:51:57,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:51:57,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 00:51:57,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285765636] [2024-10-24 00:51:57,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:51:57,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 00:51:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:51:57,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 00:51:57,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 00:51:57,705 INFO L87 Difference]: Start difference. First operand 48220 states and 82319 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:52:00,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:52:00,836 INFO L93 Difference]: Finished difference Result 89734 states and 156887 transitions. [2024-10-24 00:52:00,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 00:52:00,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-10-24 00:52:00,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:52:01,273 INFO L225 Difference]: With dead ends: 89734 [2024-10-24 00:52:01,274 INFO L226 Difference]: Without dead ends: 89575 [2024-10-24 00:52:01,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-24 00:52:01,491 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 805 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 270 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 270 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 00:52:01,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 579 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [270 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 00:52:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89575 states. [2024-10-24 00:52:04,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89575 to 89508. [2024-10-24 00:52:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89508 states, 74157 states have (on average 1.6094771902854754) internal successors, (119354), 74164 states have internal predecessors, (119354), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-10-24 00:52:04,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89508 states to 89508 states and 152193 transitions. [2024-10-24 00:52:04,893 INFO L78 Accepts]: Start accepts. Automaton has 89508 states and 152193 transitions. Word has length 126 [2024-10-24 00:52:04,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:52:04,894 INFO L471 AbstractCegarLoop]: Abstraction has 89508 states and 152193 transitions. [2024-10-24 00:52:04,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-24 00:52:04,894 INFO L276 IsEmpty]: Start isEmpty. Operand 89508 states and 152193 transitions. [2024-10-24 00:52:04,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-24 00:52:04,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:52:04,993 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:52:04,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 00:52:04,993 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:52:04,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:52:04,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1341870980, now seen corresponding path program 1 times [2024-10-24 00:52:04,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:52:04,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362652796] [2024-10-24 00:52:04,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:52:04,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:52:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:52:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:52:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:52:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:52:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:52:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:52:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:52:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:52:05,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:52:05,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:52:05,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-24 00:52:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-24 00:52:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-24 00:52:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:05,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:52:05,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:52:05,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362652796] [2024-10-24 00:52:05,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362652796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:52:05,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:52:05,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-24 00:52:05,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116569457] [2024-10-24 00:52:05,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:52:05,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 00:52:05,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:52:05,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 00:52:05,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-24 00:52:05,360 INFO L87 Difference]: Start difference. First operand 89508 states and 152193 transitions. Second operand has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:52:13,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:52:13,476 INFO L93 Difference]: Finished difference Result 178747 states and 315868 transitions. [2024-10-24 00:52:13,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 00:52:13,477 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 127 [2024-10-24 00:52:13,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:52:14,561 INFO L225 Difference]: With dead ends: 178747 [2024-10-24 00:52:14,562 INFO L226 Difference]: Without dead ends: 178595 [2024-10-24 00:52:14,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 00:52:14,623 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 3190 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 6348 mSolverCounterSat, 1046 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3190 SdHoareTripleChecker+Valid, 2263 SdHoareTripleChecker+Invalid, 7394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1046 IncrementalHoareTripleChecker+Valid, 6348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 00:52:14,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3190 Valid, 2263 Invalid, 7394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1046 Valid, 6348 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 00:52:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178595 states. [2024-10-24 00:52:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178595 to 178282. [2024-10-24 00:52:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178282 states, 147773 states have (on average 1.6104430443991797) internal successors, (237980), 147677 states have internal predecessors, (237980), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-10-24 00:52:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178282 states to 178282 states and 306517 transitions. [2024-10-24 00:52:22,399 INFO L78 Accepts]: Start accepts. Automaton has 178282 states and 306517 transitions. Word has length 127 [2024-10-24 00:52:22,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 00:52:22,400 INFO L471 AbstractCegarLoop]: Abstraction has 178282 states and 306517 transitions. [2024-10-24 00:52:22,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.533333333333333) internal successors, (83), 11 states have internal predecessors, (83), 6 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-24 00:52:22,400 INFO L276 IsEmpty]: Start isEmpty. Operand 178282 states and 306517 transitions. [2024-10-24 00:52:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-24 00:52:22,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 00:52:22,501 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 00:52:22,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 00:52:22,502 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 00:52:22,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 00:52:22,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1144723784, now seen corresponding path program 1 times [2024-10-24 00:52:22,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 00:52:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444362461] [2024-10-24 00:52:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 00:52:22,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 00:52:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 00:52:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 00:52:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 00:52:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-24 00:52:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-24 00:52:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-24 00:52:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 00:52:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 00:52:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-24 00:52:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-24 00:52:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-24 00:52:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-24 00:52:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-24 00:52:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 00:52:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-24 00:52:23,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 00:52:23,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444362461] [2024-10-24 00:52:23,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444362461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 00:52:23,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 00:52:23,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-24 00:52:23,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267314157] [2024-10-24 00:52:23,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 00:52:23,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 00:52:23,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 00:52:23,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 00:52:23,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-24 00:52:23,485 INFO L87 Difference]: Start difference. First operand 178282 states and 306517 transitions. Second operand has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-10-24 00:52:29,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 00:52:29,306 INFO L93 Difference]: Finished difference Result 179263 states and 314505 transitions. [2024-10-24 00:52:29,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 00:52:29,306 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.461538461538462) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 128 [2024-10-24 00:52:29,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 00:52:30,382 INFO L225 Difference]: With dead ends: 179263 [2024-10-24 00:52:30,382 INFO L226 Difference]: Without dead ends: 178583 [2024-10-24 00:52:30,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=163, Invalid=539, Unknown=0, NotChecked=0, Total=702 [2024-10-24 00:52:30,447 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1454 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 3622 mSolverCounterSat, 482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1253 SdHoareTripleChecker+Invalid, 4104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 482 IncrementalHoareTripleChecker+Valid, 3622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-24 00:52:30,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1469 Valid, 1253 Invalid, 4104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [482 Valid, 3622 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-24 00:52:30,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178583 states.