./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_spec9_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 e931bf8fe4413228ccd3caf40302412c554842907046b600d394a87eb5d13e97 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:56:10,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:56:11,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:56:11,047 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:56:11,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:56:11,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:56:11,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:56:11,081 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:56:11,081 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:56:11,082 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:56:11,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:56:11,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:56:11,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:56:11,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:56:11,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:56:11,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:56:11,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:56:11,085 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:56:11,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:56:11,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:56:11,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:56:11,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:56:11,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:56:11,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:56:11,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:56:11,090 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:56:11,090 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:56:11,090 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:56:11,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:56:11,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:56:11,090 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:56:11,091 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:56:11,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:56:11,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:56:11,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:56:11,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:56:11,093 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:56:11,093 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-clean/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-clean/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 -> e931bf8fe4413228ccd3caf40302412c554842907046b600d394a87eb5d13e97 [2024-10-11 02:56:11,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:56:11,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:56:11,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:56:11,340 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:56:11,340 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:56:11,341 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c [2024-10-11 02:56:12,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:56:13,075 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:56:13,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product30.cil.c [2024-10-11 02:56:13,099 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e318a578/35976586079f461daca8137bb0ddb217/FLAG8f6cbb605 [2024-10-11 02:56:13,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7e318a578/35976586079f461daca8137bb0ddb217 [2024-10-11 02:56:13,117 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:56:13,118 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:56:13,120 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:56:13,120 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:56:13,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:56:13,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:13,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31350f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13, skipping insertion in model container [2024-10-11 02:56:13,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:13,181 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:56:13,634 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_spec9_product30.cil.c[41508,41521] [2024-10-11 02:56:13,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:56:13,773 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:56:13,781 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-10-11 02:56:13,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [363] [2024-10-11 02:56:13,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [740] [2024-10-11 02:56:13,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [878] [2024-10-11 02:56:13,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1945] [2024-10-11 02:56:13,783 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1980] [2024-10-11 02:56:13,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [1989] [2024-10-11 02:56:13,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2031] [2024-10-11 02:56:13,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2048] [2024-10-11 02:56:13,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2445] [2024-10-11 02:56:13,784 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2811] [2024-10-11 02:56:13,830 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_spec9_product30.cil.c[41508,41521] [2024-10-11 02:56:13,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:56:13,872 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:56:13,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13 WrapperNode [2024-10-11 02:56:13,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:56:13,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:56:13,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:56:13,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:56:13,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:13,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,000 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 925 [2024-10-11 02:56:14,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:56:14,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:56:14,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:56:14,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:56:14,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,018 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,035 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-11 02:56:14,035 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,035 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,051 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,054 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,057 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,061 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:56:14,062 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:56:14,062 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:56:14,062 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:56:14,063 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (1/1) ... [2024-10-11 02:56:14,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:56:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:14,113 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:56:14,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:56:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:56:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:56:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:56:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:56:14,152 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:56:14,152 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:56:14,153 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:56:14,153 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:56:14,154 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:56:14,154 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:56:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:56:14,155 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:56:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:56:14,155 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:56:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:56:14,155 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:56:14,155 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:56:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:56:14,160 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:56:14,160 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:56:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:56:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:56:14,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:56:14,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:56:14,356 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:56:14,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:56:15,126 INFO L? ?]: Removed 432 outVars from TransFormulas that were not future-live. [2024-10-11 02:56:15,126 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:56:15,166 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:56:15,166 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:56:15,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:56:15 BoogieIcfgContainer [2024-10-11 02:56:15,167 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:56:15,168 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:56:15,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:56:15,171 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:56:15,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:56:13" (1/3) ... [2024-10-11 02:56:15,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2ad9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:56:15, skipping insertion in model container [2024-10-11 02:56:15,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:13" (2/3) ... [2024-10-11 02:56:15,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ac2ad9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:56:15, skipping insertion in model container [2024-10-11 02:56:15,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:56:15" (3/3) ... [2024-10-11 02:56:15,173 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product30.cil.c [2024-10-11 02:56:15,184 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:56:15,184 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:56:15,272 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:56:15,277 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;@f13be85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:56:15,278 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:56:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 02:56:15,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:56:15,303 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:15,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:15,307 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:15,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:15,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1024459576, now seen corresponding path program 1 times [2024-10-11 02:56:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45759181] [2024-10-11 02:56:15,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:15,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:15,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:15,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:56:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:56:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:15,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:15,981 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:56:15,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:15,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45759181] [2024-10-11 02:56:15,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45759181] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:15,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647431009] [2024-10-11 02:56:15,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:15,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:15,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:56:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:16,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:56:16,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:16,378 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:16,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647431009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:16,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:16,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:56:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544805465] [2024-10-11 02:56:16,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:16,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:56:16,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:16,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:56:16,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:16,437 INFO L87 Difference]: Start difference. First operand has 320 states, 242 states have (on average 1.5743801652892562) internal successors, (381), 246 states have internal predecessors, (381), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:16,508 INFO L93 Difference]: Finished difference Result 495 states and 737 transitions. [2024-10-11 02:56:16,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:56:16,515 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 95 [2024-10-11 02:56:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:16,532 INFO L225 Difference]: With dead ends: 495 [2024-10-11 02:56:16,532 INFO L226 Difference]: Without dead ends: 317 [2024-10-11 02:56:16,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:16,540 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:16,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 469 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:16,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-11 02:56:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2024-10-11 02:56:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 240 states have (on average 1.5583333333333333) internal successors, (374), 243 states have internal predecessors, (374), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 02:56:16,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 479 transitions. [2024-10-11 02:56:16,613 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 479 transitions. Word has length 95 [2024-10-11 02:56:16,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:16,618 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 479 transitions. [2024-10-11 02:56:16,618 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-11 02:56:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 479 transitions. [2024-10-11 02:56:16,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:56:16,625 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:16,625 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:16,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:56:16,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:56:16,832 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash 961480731, now seen corresponding path program 1 times [2024-10-11 02:56:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:16,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770687274] [2024-10-11 02:56:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:56:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:56:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:17,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:56:17,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:17,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770687274] [2024-10-11 02:56:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770687274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083331424] [2024-10-11 02:56:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:17,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:17,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:17,186 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:17,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:56:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:56:17,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:17,482 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:17,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:17,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083331424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:17,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:17,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:56:17,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049819869] [2024-10-11 02:56:17,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:17,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:56:17,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:17,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:56:17,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:17,486 INFO L87 Difference]: Start difference. First operand 317 states and 479 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:17,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:17,534 INFO L93 Difference]: Finished difference Result 491 states and 724 transitions. [2024-10-11 02:56:17,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:56:17,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 96 [2024-10-11 02:56:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:17,537 INFO L225 Difference]: With dead ends: 491 [2024-10-11 02:56:17,537 INFO L226 Difference]: Without dead ends: 319 [2024-10-11 02:56:17,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:17,540 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 0 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:17,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 931 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:17,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-10-11 02:56:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2024-10-11 02:56:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 245 states have internal predecessors, (376), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 02:56:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 481 transitions. [2024-10-11 02:56:17,558 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 481 transitions. Word has length 96 [2024-10-11 02:56:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:17,558 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 481 transitions. [2024-10-11 02:56:17,558 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-11 02:56:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 481 transitions. [2024-10-11 02:56:17,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:56:17,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:17,561 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:17,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:56:17,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:17,763 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:17,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1328627556, now seen corresponding path program 1 times [2024-10-11 02:56:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481839496] [2024-10-11 02:56:17,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:17,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:17,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:56:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:56:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481839496] [2024-10-11 02:56:18,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481839496] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989287593] [2024-10-11 02:56:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:18,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:18,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:18,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:56:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:56:18,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:18,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:18,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989287593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:18,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:18,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:56:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574089967] [2024-10-11 02:56:18,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:18,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:56:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:18,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:56:18,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:18,383 INFO L87 Difference]: Start difference. First operand 319 states and 481 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:18,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:18,458 INFO L93 Difference]: Finished difference Result 668 states and 1021 transitions. [2024-10-11 02:56:18,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:56:18,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-10-11 02:56:18,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:18,462 INFO L225 Difference]: With dead ends: 668 [2024-10-11 02:56:18,463 INFO L226 Difference]: Without dead ends: 371 [2024-10-11 02:56:18,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:18,465 INFO L432 NwaCegarLoop]: 472 mSDtfsCounter, 102 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:18,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 893 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:18,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-10-11 02:56:18,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 366. [2024-10-11 02:56:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 278 states have (on average 1.5683453237410072) internal successors, (436), 281 states have internal predecessors, (436), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-10-11 02:56:18,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 563 transitions. [2024-10-11 02:56:18,487 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 563 transitions. Word has length 103 [2024-10-11 02:56:18,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:18,488 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 563 transitions. [2024-10-11 02:56:18,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:18,488 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 563 transitions. [2024-10-11 02:56:18,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:56:18,490 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:18,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:18,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 02:56:18,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:18,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:18,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:18,693 INFO L85 PathProgramCache]: Analyzing trace with hash -823921969, now seen corresponding path program 1 times [2024-10-11 02:56:18,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:18,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047553082] [2024-10-11 02:56:18,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:18,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:18,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:18,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:56:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047553082] [2024-10-11 02:56:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047553082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165116212] [2024-10-11 02:56:18,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:18,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:18,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:18,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:18,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:56:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:56:19,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:56:19,259 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:19,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165116212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:19,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:19,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:56:19,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948834504] [2024-10-11 02:56:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:19,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:56:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:56:19,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:19,262 INFO L87 Difference]: Start difference. First operand 366 states and 563 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:19,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:19,371 INFO L93 Difference]: Finished difference Result 727 states and 1120 transitions. [2024-10-11 02:56:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:56:19,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 104 [2024-10-11 02:56:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:19,374 INFO L225 Difference]: With dead ends: 727 [2024-10-11 02:56:19,375 INFO L226 Difference]: Without dead ends: 368 [2024-10-11 02:56:19,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:19,377 INFO L432 NwaCegarLoop]: 458 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1821 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:19,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1821 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:56:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-10-11 02:56:19,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2024-10-11 02:56:19,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 279 states have (on average 1.5663082437275986) internal successors, (437), 283 states have internal predecessors, (437), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2024-10-11 02:56:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 566 transitions. [2024-10-11 02:56:19,395 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 566 transitions. Word has length 104 [2024-10-11 02:56:19,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:19,396 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 566 transitions. [2024-10-11 02:56:19,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:19,396 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 566 transitions. [2024-10-11 02:56:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:56:19,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:19,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:19,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:56:19,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:19,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:19,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash 689662902, now seen corresponding path program 1 times [2024-10-11 02:56:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:19,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093621876] [2024-10-11 02:56:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:56:19,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:56:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:56:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:56:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:56:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:19,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:19,857 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:19,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:19,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093621876] [2024-10-11 02:56:19,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093621876] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:19,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318237164] [2024-10-11 02:56:19,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:19,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:19,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:19,860 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:56:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:56:20,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:20,206 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:56:20,207 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:20,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318237164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:20,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:20,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:56:20,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496877678] [2024-10-11 02:56:20,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:20,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:56:20,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:20,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:56:20,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:56:20,209 INFO L87 Difference]: Start difference. First operand 368 states and 566 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:20,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:20,303 INFO L93 Difference]: Finished difference Result 729 states and 1125 transitions. [2024-10-11 02:56:20,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:56:20,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 105 [2024-10-11 02:56:20,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:20,307 INFO L225 Difference]: With dead ends: 729 [2024-10-11 02:56:20,307 INFO L226 Difference]: Without dead ends: 370 [2024-10-11 02:56:20,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:56:20,309 INFO L432 NwaCegarLoop]: 456 mSDtfsCounter, 2 mSDsluCounter, 1351 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:20,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1807 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:56:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-10-11 02:56:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2024-10-11 02:56:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-11 02:56:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 572 transitions. [2024-10-11 02:56:20,341 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 572 transitions. Word has length 105 [2024-10-11 02:56:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:20,341 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 572 transitions. [2024-10-11 02:56:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 572 transitions. [2024-10-11 02:56:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:56:20,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:20,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:20,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:56:20,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:20,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:20,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:20,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1907466066, now seen corresponding path program 1 times [2024-10-11 02:56:20,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:20,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008886489] [2024-10-11 02:56:20,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:20,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:20,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:20,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:20,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:56:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:56:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:56:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:20,840 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:20,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:20,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008886489] [2024-10-11 02:56:20,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008886489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:20,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:20,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:56:20,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042575181] [2024-10-11 02:56:20,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:20,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:56:20,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:20,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:56:20,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:20,843 INFO L87 Difference]: Start difference. First operand 370 states and 572 transitions. Second operand has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:22,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:22,567 INFO L93 Difference]: Finished difference Result 807 states and 1260 transitions. [2024-10-11 02:56:22,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:56:22,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 106 [2024-10-11 02:56:22,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:22,571 INFO L225 Difference]: With dead ends: 807 [2024-10-11 02:56:22,571 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 02:56:22,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:56:22,573 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1056 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 362 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1057 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 362 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:22,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1057 Valid, 968 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [362 Valid, 2109 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:56:22,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 02:56:22,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 370. [2024-10-11 02:56:22,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 280 states have (on average 1.5642857142857143) internal successors, (438), 285 states have internal predecessors, (438), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2024-10-11 02:56:22,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 571 transitions. [2024-10-11 02:56:22,596 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 571 transitions. Word has length 106 [2024-10-11 02:56:22,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:22,596 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 571 transitions. [2024-10-11 02:56:22,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.375) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 571 transitions. [2024-10-11 02:56:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:56:22,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:22,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:22,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:56:22,599 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:22,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -185036681, now seen corresponding path program 2 times [2024-10-11 02:56:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:22,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159237467] [2024-10-11 02:56:22,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:22,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:56:22,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:56:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:56:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:22,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:22,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:22,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159237467] [2024-10-11 02:56:22,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159237467] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:22,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:22,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:56:22,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658139079] [2024-10-11 02:56:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:22,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:56:22,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:56:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:22,746 INFO L87 Difference]: Start difference. First operand 370 states and 571 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:24,262 INFO L93 Difference]: Finished difference Result 809 states and 1263 transitions. [2024-10-11 02:56:24,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:56:24,263 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2024-10-11 02:56:24,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:24,265 INFO L225 Difference]: With dead ends: 809 [2024-10-11 02:56:24,266 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 02:56:24,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 02:56:24,267 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 1084 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:24,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 968 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:56:24,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 02:56:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-11 02:56:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2024-10-11 02:56:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 574 transitions. [2024-10-11 02:56:24,290 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 574 transitions. Word has length 107 [2024-10-11 02:56:24,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:24,290 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 574 transitions. [2024-10-11 02:56:24,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-10-11 02:56:24,290 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 574 transitions. [2024-10-11 02:56:24,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:56:24,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:24,292 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:24,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:56:24,292 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:24,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:24,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1375191895, now seen corresponding path program 1 times [2024-10-11 02:56:24,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:24,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40473403] [2024-10-11 02:56:24,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:24,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:24,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:24,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:24,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:56:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40473403] [2024-10-11 02:56:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40473403] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:56:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755662701] [2024-10-11 02:56:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:56:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:56:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:24,594 INFO L87 Difference]: Start difference. First operand 372 states and 574 transitions. Second operand has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:56:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:26,956 INFO L93 Difference]: Finished difference Result 807 states and 1258 transitions. [2024-10-11 02:56:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:56:26,957 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 108 [2024-10-11 02:56:26,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:26,961 INFO L225 Difference]: With dead ends: 807 [2024-10-11 02:56:26,961 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 02:56:26,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:56:26,964 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 1121 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3355 mSolverCounterSat, 375 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 375 IncrementalHoareTripleChecker+Valid, 3355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:26,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 1343 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [375 Valid, 3355 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-11 02:56:26,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 02:56:26,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 372. [2024-10-11 02:56:26,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 281 states have (on average 1.5622775800711743) internal successors, (439), 287 states have internal predecessors, (439), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-10-11 02:56:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 573 transitions. [2024-10-11 02:56:27,002 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 573 transitions. Word has length 108 [2024-10-11 02:56:27,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:27,002 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 573 transitions. [2024-10-11 02:56:27,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.545454545454546) internal successors, (72), 8 states have internal predecessors, (72), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:56:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 573 transitions. [2024-10-11 02:56:27,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:56:27,005 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:27,005 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:27,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:56:27,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:27,006 INFO L85 PathProgramCache]: Analyzing trace with hash 620218143, now seen corresponding path program 2 times [2024-10-11 02:56:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786304557] [2024-10-11 02:56:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:27,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:27,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:27,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:27,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:56:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:27,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:56:27,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:27,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:27,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:27,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786304557] [2024-10-11 02:56:27,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786304557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:27,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:27,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:56:27,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765169382] [2024-10-11 02:56:27,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:27,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:56:27,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:27,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:56:27,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:27,294 INFO L87 Difference]: Start difference. First operand 372 states and 573 transitions. Second operand has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:56:29,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:29,818 INFO L93 Difference]: Finished difference Result 809 states and 1264 transitions. [2024-10-11 02:56:29,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:56:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 109 [2024-10-11 02:56:29,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:29,824 INFO L225 Difference]: With dead ends: 809 [2024-10-11 02:56:29,824 INFO L226 Difference]: Without dead ends: 460 [2024-10-11 02:56:29,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-10-11 02:56:29,826 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1124 mSDsluCounter, 1184 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 3755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:29,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1344 Invalid, 3755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 3374 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 02:56:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-10-11 02:56:29,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 374. [2024-10-11 02:56:29,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 282 states have (on average 1.5602836879432624) internal successors, (440), 289 states have internal predecessors, (440), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2024-10-11 02:56:29,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 579 transitions. [2024-10-11 02:56:29,856 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 579 transitions. Word has length 109 [2024-10-11 02:56:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 579 transitions. [2024-10-11 02:56:29,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.636363636363637) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-10-11 02:56:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 579 transitions. [2024-10-11 02:56:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:56:29,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:29,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:56:29,859 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:29,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1470402940, now seen corresponding path program 1 times [2024-10-11 02:56:29,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:29,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207302463] [2024-10-11 02:56:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:30,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:30,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:56:30,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:56:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:56:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:56:30,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207302463] [2024-10-11 02:56:30,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207302463] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:30,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360772013] [2024-10-11 02:56:30,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:30,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:30,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:30,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:56:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:30,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 1043 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:56:30,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:30,467 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:30,469 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:56:30,575 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:30,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360772013] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:56:30,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:56:30,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:56:30,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46470321] [2024-10-11 02:56:30,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:56:30,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:56:30,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:56:30,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:56:30,582 INFO L87 Difference]: Start difference. First operand 374 states and 579 transitions. Second operand has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 02:56:33,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:33,221 INFO L93 Difference]: Finished difference Result 1138 states and 1875 transitions. [2024-10-11 02:56:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:56:33,222 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 110 [2024-10-11 02:56:33,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:33,228 INFO L225 Difference]: With dead ends: 1138 [2024-10-11 02:56:33,228 INFO L226 Difference]: Without dead ends: 790 [2024-10-11 02:56:33,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 241 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:56:33,231 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 2074 mSDsluCounter, 1399 mSDsCounter, 0 mSdLazyCounter, 3867 mSolverCounterSat, 706 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 706 IncrementalHoareTripleChecker+Valid, 3867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:33,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2091 Valid, 1547 Invalid, 4573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [706 Valid, 3867 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-11 02:56:33,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-10-11 02:56:33,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 689. [2024-10-11 02:56:33,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 533 states have (on average 1.6097560975609757) internal successors, (858), 540 states have internal predecessors, (858), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2024-10-11 02:56:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1135 transitions. [2024-10-11 02:56:33,276 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1135 transitions. Word has length 110 [2024-10-11 02:56:33,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:33,277 INFO L471 AbstractCegarLoop]: Abstraction has 689 states and 1135 transitions. [2024-10-11 02:56:33,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 8.714285714285714) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 02:56:33,277 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1135 transitions. [2024-10-11 02:56:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:56:33,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:33,281 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:33,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:56:33,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:56:33,486 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:33,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:33,487 INFO L85 PathProgramCache]: Analyzing trace with hash 708690131, now seen corresponding path program 1 times [2024-10-11 02:56:33,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:33,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681984589] [2024-10-11 02:56:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:33,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:56:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:33,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:33,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:33,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:56:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:33,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:33,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681984589] [2024-10-11 02:56:33,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681984589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:33,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:33,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:33,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164007376] [2024-10-11 02:56:33,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:33,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:33,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:33,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:33,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:33,622 INFO L87 Difference]: Start difference. First operand 689 states and 1135 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:34,771 INFO L93 Difference]: Finished difference Result 1693 states and 2864 transitions. [2024-10-11 02:56:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:34,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2024-10-11 02:56:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:34,778 INFO L225 Difference]: With dead ends: 1693 [2024-10-11 02:56:34,778 INFO L226 Difference]: Without dead ends: 1072 [2024-10-11 02:56:34,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:34,781 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 1185 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 1625 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:34,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 749 Invalid, 1625 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-10-11 02:56:34,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 981. [2024-10-11 02:56:34,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 761 states have (on average 1.6228646517739815) internal successors, (1235), 768 states have internal predecessors, (1235), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2024-10-11 02:56:34,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1650 transitions. [2024-10-11 02:56:34,822 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1650 transitions. Word has length 114 [2024-10-11 02:56:34,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:34,822 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1650 transitions. [2024-10-11 02:56:34,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:34,822 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1650 transitions. [2024-10-11 02:56:34,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:56:34,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:34,826 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:34,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:56:34,826 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:34,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash 366029075, now seen corresponding path program 1 times [2024-10-11 02:56:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235840776] [2024-10-11 02:56:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:34,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:56:34,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:34,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:34,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:34,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:34,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:56:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:34,929 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235840776] [2024-10-11 02:56:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235840776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:34,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104783799] [2024-10-11 02:56:34,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:34,931 INFO L87 Difference]: Start difference. First operand 981 states and 1650 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:36,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:36,239 INFO L93 Difference]: Finished difference Result 2410 states and 4121 transitions. [2024-10-11 02:56:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:36,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2024-10-11 02:56:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:36,255 INFO L225 Difference]: With dead ends: 2410 [2024-10-11 02:56:36,255 INFO L226 Difference]: Without dead ends: 1547 [2024-10-11 02:56:36,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:36,260 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 1208 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:36,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 710 Invalid, 1591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:56:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2024-10-11 02:56:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1456. [2024-10-11 02:56:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1141 states have (on average 1.6292725679228748) internal successors, (1859), 1148 states have internal predecessors, (1859), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2024-10-11 02:56:36,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 2464 transitions. [2024-10-11 02:56:36,335 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 2464 transitions. Word has length 115 [2024-10-11 02:56:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:36,336 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 2464 transitions. [2024-10-11 02:56:36,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:36,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 2464 transitions. [2024-10-11 02:56:36,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:56:36,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:36,344 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:36,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:56:36,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1545428283, now seen corresponding path program 1 times [2024-10-11 02:56:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812287456] [2024-10-11 02:56:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:36,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:36,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:56:36,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:36,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:36,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:36,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812287456] [2024-10-11 02:56:36,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812287456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:36,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:36,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:36,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553642470] [2024-10-11 02:56:36,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:36,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:36,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:36,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:36,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:36,481 INFO L87 Difference]: Start difference. First operand 1456 states and 2464 transitions. Second operand has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:37,710 INFO L93 Difference]: Finished difference Result 3472 states and 5999 transitions. [2024-10-11 02:56:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 116 [2024-10-11 02:56:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:37,725 INFO L225 Difference]: With dead ends: 3472 [2024-10-11 02:56:37,726 INFO L226 Difference]: Without dead ends: 2262 [2024-10-11 02:56:37,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:37,732 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1196 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1211 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:37,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1211 Valid, 702 Invalid, 1559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2262 states. [2024-10-11 02:56:37,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2262 to 2171. [2024-10-11 02:56:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2171 states, 1733 states have (on average 1.634737449509521) internal successors, (2833), 1740 states have internal predecessors, (2833), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2024-10-11 02:56:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2171 states to 2171 states and 3700 transitions. [2024-10-11 02:56:37,842 INFO L78 Accepts]: Start accepts. Automaton has 2171 states and 3700 transitions. Word has length 116 [2024-10-11 02:56:37,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:37,842 INFO L471 AbstractCegarLoop]: Abstraction has 2171 states and 3700 transitions. [2024-10-11 02:56:37,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:37,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2171 states and 3700 transitions. [2024-10-11 02:56:37,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:56:37,853 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:37,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:37,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:56:37,854 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:37,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash 220493074, now seen corresponding path program 1 times [2024-10-11 02:56:37,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:37,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627976767] [2024-10-11 02:56:37,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:37,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:37,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:38,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:56:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:56:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:38,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:38,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627976767] [2024-10-11 02:56:38,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627976767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:38,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:38,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:38,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116855364] [2024-10-11 02:56:38,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:38,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:38,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:38,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:38,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:38,019 INFO L87 Difference]: Start difference. First operand 2171 states and 3700 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:39,436 INFO L93 Difference]: Finished difference Result 5114 states and 8912 transitions. [2024-10-11 02:56:39,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:39,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2024-10-11 02:56:39,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:39,458 INFO L225 Difference]: With dead ends: 5114 [2024-10-11 02:56:39,459 INFO L226 Difference]: Without dead ends: 3398 [2024-10-11 02:56:39,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:39,467 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1137 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 1610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:39,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 708 Invalid, 1610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:56:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2024-10-11 02:56:39,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3307. [2024-10-11 02:56:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3307 states, 2690 states have (on average 1.6382899628252787) internal successors, (4407), 2697 states have internal predecessors, (4407), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2024-10-11 02:56:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 5658 transitions. [2024-10-11 02:56:39,678 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 5658 transitions. Word has length 117 [2024-10-11 02:56:39,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:39,681 INFO L471 AbstractCegarLoop]: Abstraction has 3307 states and 5658 transitions. [2024-10-11 02:56:39,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:39,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 5658 transitions. [2024-10-11 02:56:39,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:56:39,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:39,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:39,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:56:39,692 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:39,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1500640567, now seen corresponding path program 1 times [2024-10-11 02:56:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:39,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925648027] [2024-10-11 02:56:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:39,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:39,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:39,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:56:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:56:39,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:39,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:39,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:56:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:39,803 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:39,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:39,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925648027] [2024-10-11 02:56:39,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925648027] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:39,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:39,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:39,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913521307] [2024-10-11 02:56:39,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:39,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:39,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:39,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:39,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:39,806 INFO L87 Difference]: Start difference. First operand 3307 states and 5658 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:41,048 INFO L93 Difference]: Finished difference Result 8069 states and 14110 transitions. [2024-10-11 02:56:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 118 [2024-10-11 02:56:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:41,074 INFO L225 Difference]: With dead ends: 8069 [2024-10-11 02:56:41,075 INFO L226 Difference]: Without dead ends: 5456 [2024-10-11 02:56:41,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:41,086 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 1157 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1172 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:41,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1172 Valid, 741 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:41,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5456 states. [2024-10-11 02:56:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5456 to 5365. [2024-10-11 02:56:41,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5365 states, 4372 states have (on average 1.630832570905764) internal successors, (7130), 4379 states have internal predecessors, (7130), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2024-10-11 02:56:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 9177 transitions. [2024-10-11 02:56:41,321 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 9177 transitions. Word has length 118 [2024-10-11 02:56:41,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:41,322 INFO L471 AbstractCegarLoop]: Abstraction has 5365 states and 9177 transitions. [2024-10-11 02:56:41,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:41,322 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 9177 transitions. [2024-10-11 02:56:41,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 02:56:41,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:41,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:41,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:56:41,339 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:41,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:41,340 INFO L85 PathProgramCache]: Analyzing trace with hash 265728270, now seen corresponding path program 1 times [2024-10-11 02:56:41,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:41,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827866928] [2024-10-11 02:56:41,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:41,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:41,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:41,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:41,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:56:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827866928] [2024-10-11 02:56:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827866928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:41,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:41,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672054708] [2024-10-11 02:56:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:41,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:41,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:41,447 INFO L87 Difference]: Start difference. First operand 5365 states and 9177 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:42,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:42,713 INFO L93 Difference]: Finished difference Result 13274 states and 23194 transitions. [2024-10-11 02:56:42,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:42,714 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2024-10-11 02:56:42,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:42,754 INFO L225 Difference]: With dead ends: 13274 [2024-10-11 02:56:42,755 INFO L226 Difference]: Without dead ends: 8989 [2024-10-11 02:56:42,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:42,768 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 1158 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 408 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 408 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:42,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 721 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [408 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8989 states. [2024-10-11 02:56:43,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8989 to 8898. [2024-10-11 02:56:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8898 states, 7299 states have (on average 1.628579257432525) internal successors, (11887), 7306 states have internal predecessors, (11887), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2024-10-11 02:56:43,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8898 states to 8898 states and 15224 transitions. [2024-10-11 02:56:43,078 INFO L78 Accepts]: Start accepts. Automaton has 8898 states and 15224 transitions. Word has length 119 [2024-10-11 02:56:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:43,080 INFO L471 AbstractCegarLoop]: Abstraction has 8898 states and 15224 transitions. [2024-10-11 02:56:43,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 8898 states and 15224 transitions. [2024-10-11 02:56:43,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 02:56:43,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:43,097 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:43,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:56:43,098 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:43,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1249059143, now seen corresponding path program 1 times [2024-10-11 02:56:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:43,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940957113] [2024-10-11 02:56:43,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:43,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:56:43,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:56:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,230 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:43,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940957113] [2024-10-11 02:56:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940957113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373356685] [2024-10-11 02:56:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:43,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:43,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:43,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:43,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:43,233 INFO L87 Difference]: Start difference. First operand 8898 states and 15224 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:44,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:44,760 INFO L93 Difference]: Finished difference Result 23046 states and 40223 transitions. [2024-10-11 02:56:44,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:44,761 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2024-10-11 02:56:44,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:44,827 INFO L225 Difference]: With dead ends: 23046 [2024-10-11 02:56:44,827 INFO L226 Difference]: Without dead ends: 15661 [2024-10-11 02:56:44,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:44,859 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 1134 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 716 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:44,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 716 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:44,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15661 states. [2024-10-11 02:56:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15661 to 15570. [2024-10-11 02:56:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15570 states, 12768 states have (on average 1.619360902255639) internal successors, (20676), 12775 states have internal predecessors, (20676), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2024-10-11 02:56:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 26563 transitions. [2024-10-11 02:56:45,788 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 26563 transitions. Word has length 120 [2024-10-11 02:56:45,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:45,789 INFO L471 AbstractCegarLoop]: Abstraction has 15570 states and 26563 transitions. [2024-10-11 02:56:45,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 26563 transitions. [2024-10-11 02:56:45,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 02:56:45,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:45,829 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:45,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:56:45,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:45,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:45,831 INFO L85 PathProgramCache]: Analyzing trace with hash -918583955, now seen corresponding path program 1 times [2024-10-11 02:56:45,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791122047] [2024-10-11 02:56:45,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:45,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:56:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:56:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:56:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:45,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791122047] [2024-10-11 02:56:45,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791122047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:45,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:45,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:45,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894216669] [2024-10-11 02:56:45,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:45,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:45,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:45,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:45,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:45,957 INFO L87 Difference]: Start difference. First operand 15570 states and 26563 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:47,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:47,740 INFO L93 Difference]: Finished difference Result 41213 states and 71821 transitions. [2024-10-11 02:56:47,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:47,741 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-10-11 02:56:47,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:47,840 INFO L225 Difference]: With dead ends: 41213 [2024-10-11 02:56:47,841 INFO L226 Difference]: Without dead ends: 27776 [2024-10-11 02:56:47,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:47,879 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 1166 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:47,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 709 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:56:47,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27776 states. [2024-10-11 02:56:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27776 to 27685. [2024-10-11 02:56:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27685 states, 22844 states have (on average 1.6154351251969883) internal successors, (36903), 22851 states have internal predecessors, (36903), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2024-10-11 02:56:49,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27685 states to 27685 states and 47142 transitions. [2024-10-11 02:56:49,198 INFO L78 Accepts]: Start accepts. Automaton has 27685 states and 47142 transitions. Word has length 121 [2024-10-11 02:56:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:49,199 INFO L471 AbstractCegarLoop]: Abstraction has 27685 states and 47142 transitions. [2024-10-11 02:56:49,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:49,199 INFO L276 IsEmpty]: Start isEmpty. Operand 27685 states and 47142 transitions. [2024-10-11 02:56:49,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 02:56:49,221 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:49,221 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:49,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:56:49,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:49,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:49,222 INFO L85 PathProgramCache]: Analyzing trace with hash -274345115, now seen corresponding path program 1 times [2024-10-11 02:56:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427764294] [2024-10-11 02:56:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:56:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:56:49,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:49,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427764294] [2024-10-11 02:56:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427764294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391036093] [2024-10-11 02:56:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:49,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:49,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:49,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:49,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:49,303 INFO L87 Difference]: Start difference. First operand 27685 states and 47142 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:51,876 INFO L93 Difference]: Finished difference Result 75405 states and 130615 transitions. [2024-10-11 02:56:51,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-10-11 02:56:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:52,050 INFO L225 Difference]: With dead ends: 75405 [2024-10-11 02:56:52,050 INFO L226 Difference]: Without dead ends: 50600 [2024-10-11 02:56:52,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:52,134 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1125 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 402 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1140 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 402 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:52,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1140 Valid, 710 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [402 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:56:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50600 states. [2024-10-11 02:56:54,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50600 to 50509. [2024-10-11 02:56:54,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50509 states, 41953 states have (on average 1.6101589874383238) internal successors, (67551), 41960 states have internal predecessors, (67551), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2024-10-11 02:56:54,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50509 states to 50509 states and 85752 transitions. [2024-10-11 02:56:54,979 INFO L78 Accepts]: Start accepts. Automaton has 50509 states and 85752 transitions. Word has length 122 [2024-10-11 02:56:54,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:54,980 INFO L471 AbstractCegarLoop]: Abstraction has 50509 states and 85752 transitions. [2024-10-11 02:56:54,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:54,980 INFO L276 IsEmpty]: Start isEmpty. Operand 50509 states and 85752 transitions. [2024-10-11 02:56:55,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 02:56:55,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:55,008 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:55,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:56:55,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:55,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1604285939, now seen corresponding path program 1 times [2024-10-11 02:56:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:55,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077235476] [2024-10-11 02:56:55,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:55,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:56:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:56:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,116 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:55,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:55,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077235476] [2024-10-11 02:56:55,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077235476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:55,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:55,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:55,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868634232] [2024-10-11 02:56:55,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:55,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:55,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:55,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:55,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:55,117 INFO L87 Difference]: Start difference. First operand 50509 states and 85752 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:56:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:58,875 INFO L93 Difference]: Finished difference Result 94152 states and 163521 transitions. [2024-10-11 02:56:58,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:58,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-10-11 02:56:58,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:59,210 INFO L225 Difference]: With dead ends: 94152 [2024-10-11 02:56:59,210 INFO L226 Difference]: Without dead ends: 93980 [2024-10-11 02:56:59,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:56:59,262 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1125 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1139 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:59,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1139 Valid, 712 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 02:56:59,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93980 states. [2024-10-11 02:57:02,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93980 to 93889. [2024-10-11 02:57:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93889 states, 78534 states have (on average 1.6033692413476965) internal successors, (125919), 78541 states have internal predecessors, (125919), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2024-10-11 02:57:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93889 states to 93889 states and 158764 transitions. [2024-10-11 02:57:03,714 INFO L78 Accepts]: Start accepts. Automaton has 93889 states and 158764 transitions. Word has length 123 [2024-10-11 02:57:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:03,714 INFO L471 AbstractCegarLoop]: Abstraction has 93889 states and 158764 transitions. [2024-10-11 02:57:03,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 02:57:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 93889 states and 158764 transitions. [2024-10-11 02:57:03,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:57:03,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:03,752 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:03,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:57:03,752 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:03,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:03,753 INFO L85 PathProgramCache]: Analyzing trace with hash 680262534, now seen corresponding path program 1 times [2024-10-11 02:57:03,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:03,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825887337] [2024-10-11 02:57:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:57:04,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:57:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:57:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:57:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:57:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:57:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:57:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:57:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:57:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:57:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:57:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:57:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:04,355 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:57:04,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:04,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825887337] [2024-10-11 02:57:04,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825887337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:04,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:04,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 02:57:04,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78439858] [2024-10-11 02:57:04,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:04,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 02:57:04,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 02:57:04,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:57:04,359 INFO L87 Difference]: Start difference. First operand 93889 states and 158764 transitions. Second operand has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-11 02:57:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:15,212 INFO L93 Difference]: Finished difference Result 187571 states and 329127 transitions. [2024-10-11 02:57:15,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 02:57:15,213 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 124 [2024-10-11 02:57:15,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:16,023 INFO L225 Difference]: With dead ends: 187571 [2024-10-11 02:57:16,023 INFO L226 Difference]: Without dead ends: 187404 [2024-10-11 02:57:16,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 02:57:16,112 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 4472 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 6320 mSolverCounterSat, 1634 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 7954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1634 IncrementalHoareTripleChecker+Valid, 6320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:16,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 2302 Invalid, 7954 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1634 Valid, 6320 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-10-11 02:57:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187404 states. [2024-10-11 02:57:24,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187404 to 187002. [2024-10-11 02:57:24,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187002 states, 156479 states have (on average 1.6042791684507187) internal successors, (251036), 156384 states have internal predecessors, (251036), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) [2024-10-11 02:57:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187002 states to 187002 states and 319596 transitions. [2024-10-11 02:57:25,973 INFO L78 Accepts]: Start accepts. Automaton has 187002 states and 319596 transitions. Word has length 124 [2024-10-11 02:57:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:25,974 INFO L471 AbstractCegarLoop]: Abstraction has 187002 states and 319596 transitions. [2024-10-11 02:57:25,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.1875) internal successors, (83), 12 states have internal predecessors, (83), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-10-11 02:57:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 187002 states and 319596 transitions. [2024-10-11 02:57:26,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 02:57:26,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:26,127 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:57:26,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:57:26,127 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:26,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash 500238423, now seen corresponding path program 1 times [2024-10-11 02:57:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:26,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229329471] [2024-10-11 02:57:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:26,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:26,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:57:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:57:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:57:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:57:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:57:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:57:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:57:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:57:26,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:57:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:57:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:57:26,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:57:26,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:26,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:57:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229329471] [2024-10-11 02:57:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229329471] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:26,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:57:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930364906] [2024-10-11 02:57:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:26,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:57:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:26,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:57:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:57:26,607 INFO L87 Difference]: Start difference. First operand 187002 states and 319596 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 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-11 02:57:35,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:35,023 INFO L93 Difference]: Finished difference Result 188174 states and 327896 transitions. [2024-10-11 02:57:35,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 02:57:35,023 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 5 states have call successors, (15), 7 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 125 [2024-10-11 02:57:35,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted.