./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 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_spec4_product13.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 a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:48:56,124 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:48:56,183 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:48:56,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:48:56,189 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:48:56,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:48:56,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:48:56,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:48:56,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:48:56,213 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:48:56,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:48:56,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:48:56,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:48:56,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:48:56,215 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:48:56,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:48:56,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:48:56,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:48:56,216 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:48:56,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:48:56,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:48:56,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:48:56,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:48:56,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:48:56,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:48:56,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:48:56,218 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:48:56,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:48:56,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:48:56,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:48:56,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:48:56,220 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:48:56,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:48:56,220 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:48:56,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:48:56,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:48:56,221 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:48:56,221 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 -> a4d75af8ac92d9f5b92cf5fbd6315f6202b8108aa1e42fc32d65f286c89fdf2f [2024-10-11 02:48:56,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:48:56,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:48:56,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:48:56,484 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:48:56,484 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:48:56,485 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-10-11 02:48:57,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:48:57,962 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:48:57,963 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c [2024-10-11 02:48:57,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36465cd38/b0c66bf3d3ab4ceebab38ce2778183d3/FLAG9a620fd40 [2024-10-11 02:48:57,995 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/36465cd38/b0c66bf3d3ab4ceebab38ce2778183d3 [2024-10-11 02:48:57,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:48:57,998 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:48:57,999 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:48:57,999 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:48:58,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:48:58,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:48:57" (1/1) ... [2024-10-11 02:48:58,006 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7adde3cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58, skipping insertion in model container [2024-10-11 02:48:58,006 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:48:57" (1/1) ... [2024-10-11 02:48:58,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:48:58,428 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-10-11 02:48:58,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:48:58,501 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:48:58,509 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2024-10-11 02:48:58,510 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [90] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [456] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [474] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [512] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1591] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1871] [2024-10-11 02:48:58,511 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1880] [2024-10-11 02:48:58,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2093] [2024-10-11 02:48:58,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2504] [2024-10-11 02:48:58,512 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2758] [2024-10-11 02:48:58,574 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product13.cil.c[42804,42817] [2024-10-11 02:48:58,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:48:58,613 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:48:58,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58 WrapperNode [2024-10-11 02:48:58,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:48:58,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:48:58,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:48:58,614 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:48:58,620 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:48:58" (1/1) ... [2024-10-11 02:48:58,649 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:48:58" (1/1) ... [2024-10-11 02:48:58,689 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 53, calls inlined = 44, statements flattened = 843 [2024-10-11 02:48:58,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:48:58,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:48:58,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:48:58,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:48:58,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,709 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,731 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:48:58,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,753 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:48:58,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:48:58,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:48:58,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:48:58,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (1/1) ... [2024-10-11 02:48:58,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:48:58,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:48:58,804 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:48:58,806 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:48:58,846 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:48:58,846 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:48:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:48:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:48:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:48:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:48:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:48:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:48:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:48:58,847 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:48:58,847 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:48:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:48:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:48:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:48:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:48:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:48:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:48:58,848 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:48:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:48:58,848 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:48:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:48:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:48:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:48:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:48:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:48:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:48:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:48:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:48:58,849 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:48:58,849 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:48:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:48:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:48:58,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:48:58,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:48:58,997 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:48:59,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:48:59,636 INFO L? ?]: Removed 363 outVars from TransFormulas that were not future-live. [2024-10-11 02:48:59,637 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:48:59,686 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:48:59,686 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:48:59,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:48:59 BoogieIcfgContainer [2024-10-11 02:48:59,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:48:59,690 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:48:59,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:48:59,693 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:48:59,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:48:57" (1/3) ... [2024-10-11 02:48:59,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d5e238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:48:59, skipping insertion in model container [2024-10-11 02:48:59,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:48:58" (2/3) ... [2024-10-11 02:48:59,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d5e238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:48:59, skipping insertion in model container [2024-10-11 02:48:59,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:48:59" (3/3) ... [2024-10-11 02:48:59,696 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec4_product13.cil.c [2024-10-11 02:48:59,711 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:48:59,712 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:48:59,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:48:59,780 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;@2c6ca115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:48:59,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:48:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 249 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 196 states have internal predecessors, (313), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-10-11 02:48:59,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 02:48:59,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:48:59,799 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:48:59,800 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:48:59,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:48:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 607664055, now seen corresponding path program 1 times [2024-10-11 02:48:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:48:59,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855105778] [2024-10-11 02:48:59,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:48:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:48:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:00,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:49:00,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:49:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:49:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:49:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:49:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:49:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:49:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:49:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,382 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:49:00,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:00,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855105778] [2024-10-11 02:49:00,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855105778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:00,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601939283] [2024-10-11 02:49:00,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:00,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:00,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:00,386 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:49:00,388 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:49:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:00,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:49:00,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:00,633 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:49:00,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:49:00,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601939283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:00,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:49:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-10-11 02:49:00,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972782295] [2024-10-11 02:49:00,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:00,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:49:00,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:00,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:49:00,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:49:00,667 INFO L87 Difference]: Start difference. First operand has 249 states, 194 states have (on average 1.6134020618556701) internal successors, (313), 196 states have internal predecessors, (313), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:00,737 INFO L93 Difference]: Finished difference Result 357 states and 544 transitions. [2024-10-11 02:49:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:49:00,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 83 [2024-10-11 02:49:00,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:00,748 INFO L225 Difference]: With dead ends: 357 [2024-10-11 02:49:00,751 INFO L226 Difference]: Without dead ends: 246 [2024-10-11 02:49:00,754 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:49:00,758 INFO L432 NwaCegarLoop]: 373 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:00,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 373 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:49:00,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-10-11 02:49:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-10-11 02:49:00,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 192 states have (on average 1.59375) internal successors, (306), 193 states have internal predecessors, (306), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 02:49:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 379 transitions. [2024-10-11 02:49:00,807 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 379 transitions. Word has length 83 [2024-10-11 02:49:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:00,808 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 379 transitions. [2024-10-11 02:49:00,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 379 transitions. [2024-10-11 02:49:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-10-11 02:49:00,812 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:00,812 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:00,827 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:49:01,012 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:49:01,013 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:01,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1089372931, now seen corresponding path program 1 times [2024-10-11 02:49:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722956830] [2024-10-11 02:49:01,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:01,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:49:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:49:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:49:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:49:01,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:49:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:49:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:49:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:49:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,282 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-11 02:49:01,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:01,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722956830] [2024-10-11 02:49:01,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722956830] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:01,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480242679] [2024-10-11 02:49:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:01,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:01,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:01,284 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:49:01,285 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:49:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 873 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:49:01,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:49:01,520 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:49:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480242679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:01,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:49:01,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:49:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589480169] [2024-10-11 02:49:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:01,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:49:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:01,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:49:01,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:49:01,522 INFO L87 Difference]: Start difference. First operand 246 states and 379 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:01,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:01,574 INFO L93 Difference]: Finished difference Result 353 states and 531 transitions. [2024-10-11 02:49:01,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:49:01,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-10-11 02:49:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:01,577 INFO L225 Difference]: With dead ends: 353 [2024-10-11 02:49:01,577 INFO L226 Difference]: Without dead ends: 248 [2024-10-11 02:49:01,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:49:01,583 INFO L432 NwaCegarLoop]: 370 mSDtfsCounter, 0 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:01,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 739 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:49:01,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-10-11 02:49:01,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-10-11 02:49:01,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 194 states have (on average 1.5876288659793814) internal successors, (308), 195 states have internal predecessors, (308), 37 states have call successors, (37), 16 states have call predecessors, (37), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 02:49:01,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 381 transitions. [2024-10-11 02:49:01,601 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 381 transitions. Word has length 84 [2024-10-11 02:49:01,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:01,602 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 381 transitions. [2024-10-11 02:49:01,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:01,602 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 381 transitions. [2024-10-11 02:49:01,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-10-11 02:49:01,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:01,606 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:01,621 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:49:01,807 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:49:01,807 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash -870597441, now seen corresponding path program 1 times [2024-10-11 02:49:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:01,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504297490] [2024-10-11 02:49:01,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:01,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:01,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:49:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:49:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:49:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:49:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:49:01,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:49:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:49:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:01,995 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:49:01,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504297490] [2024-10-11 02:49:01,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504297490] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:01,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886900831] [2024-10-11 02:49:01,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:01,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:01,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:01,999 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:49:01,999 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:49:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:49:02,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-10-11 02:49:02,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:49:02,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886900831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:02,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:49:02,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-10-11 02:49:02,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160582014] [2024-10-11 02:49:02,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:02,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:49:02,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:49:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:49:02,222 INFO L87 Difference]: Start difference. First operand 248 states and 381 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:02,261 INFO L93 Difference]: Finished difference Result 522 states and 814 transitions. [2024-10-11 02:49:02,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:49:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 89 [2024-10-11 02:49:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:02,264 INFO L225 Difference]: With dead ends: 522 [2024-10-11 02:49:02,265 INFO L226 Difference]: Without dead ends: 296 [2024-10-11 02:49:02,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:49:02,267 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 95 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:02,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 707 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:49:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-10-11 02:49:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 291. [2024-10-11 02:49:02,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 226 states have (on average 1.5973451327433628) internal successors, (361), 227 states have internal predecessors, (361), 48 states have call successors, (48), 16 states have call predecessors, (48), 16 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2024-10-11 02:49:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 456 transitions. [2024-10-11 02:49:02,282 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 456 transitions. Word has length 89 [2024-10-11 02:49:02,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:02,282 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 456 transitions. [2024-10-11 02:49:02,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:02,283 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 456 transitions. [2024-10-11 02:49:02,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-11 02:49:02,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:02,287 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:02,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:49:02,487 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:49:02,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:02,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1674334953, now seen corresponding path program 1 times [2024-10-11 02:49:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:02,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229355886] [2024-10-11 02:49:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:49:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:49:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:49:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-11 02:49:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:49:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:49:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:49:02,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:49:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,629 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:49:02,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229355886] [2024-10-11 02:49:02,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229355886] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:02,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256981381] [2024-10-11 02:49:02,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:02,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:02,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:02,633 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:49:02,635 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:49:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:02,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:49:02,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:49:02,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:49:02,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [256981381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:02,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:49:02,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-11 02:49:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601490161] [2024-10-11 02:49:02,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:02,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:49:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:02,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:49:02,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:49:02,888 INFO L87 Difference]: Start difference. First operand 291 states and 456 transitions. Second operand has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:02,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:02,953 INFO L93 Difference]: Finished difference Result 577 states and 906 transitions. [2024-10-11 02:49:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:49:02,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 90 [2024-10-11 02:49:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:02,956 INFO L225 Difference]: With dead ends: 577 [2024-10-11 02:49:02,956 INFO L226 Difference]: Without dead ends: 293 [2024-10-11 02:49:02,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:49:02,958 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 2 mSDsluCounter, 1075 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1437 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:02,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1437 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:49:02,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-10-11 02:49:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2024-10-11 02:49:02,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 227 states have (on average 1.5947136563876652) internal successors, (362), 229 states have internal predecessors, (362), 48 states have call successors, (48), 16 states have call predecessors, (48), 17 states have return successors, (49), 47 states have call predecessors, (49), 47 states have call successors, (49) [2024-10-11 02:49:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 459 transitions. [2024-10-11 02:49:03,002 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 459 transitions. Word has length 90 [2024-10-11 02:49:03,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:03,004 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 459 transitions. [2024-10-11 02:49:03,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.0) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:03,004 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 459 transitions. [2024-10-11 02:49:03,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-11 02:49:03,007 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:03,007 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:03,022 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:49:03,207 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:49:03,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:03,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:03,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1310549939, now seen corresponding path program 1 times [2024-10-11 02:49:03,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:03,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443309211] [2024-10-11 02:49:03,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:03,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:49:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:49:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:49:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:49:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:49:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:49:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:49:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:49:03,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443309211] [2024-10-11 02:49:03,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443309211] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:03,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907509395] [2024-10-11 02:49:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:03,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:03,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:03,437 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:49:03,438 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:49:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:03,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:49:03,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 02:49:03,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:49:03,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907509395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:49:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-10-11 02:49:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276811465] [2024-10-11 02:49:03,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:03,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:49:03,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:49:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:03,683 INFO L87 Difference]: Start difference. First operand 293 states and 459 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:03,750 INFO L93 Difference]: Finished difference Result 579 states and 911 transitions. [2024-10-11 02:49:03,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:49:03,752 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 91 [2024-10-11 02:49:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:03,754 INFO L225 Difference]: With dead ends: 579 [2024-10-11 02:49:03,754 INFO L226 Difference]: Without dead ends: 295 [2024-10-11 02:49:03,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:03,756 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 2 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:03,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1423 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:49:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-11 02:49:03,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2024-10-11 02:49:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 228 states have (on average 1.5921052631578947) internal successors, (363), 231 states have internal predecessors, (363), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-10-11 02:49:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 465 transitions. [2024-10-11 02:49:03,773 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 465 transitions. Word has length 91 [2024-10-11 02:49:03,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:03,773 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 465 transitions. [2024-10-11 02:49:03,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:03,773 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 465 transitions. [2024-10-11 02:49:03,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-10-11 02:49:03,776 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:03,776 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:03,791 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:49:03,977 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:49:03,977 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:03,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:03,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1685829560, now seen corresponding path program 1 times [2024-10-11 02:49:03,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:03,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947902993] [2024-10-11 02:49:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:03,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:04,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:49:04,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:49:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:49:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:49:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:49:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:49:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947902993] [2024-10-11 02:49:04,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947902993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:04,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:04,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:49:04,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228923165] [2024-10-11 02:49:04,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:04,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:49:04,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:04,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:49:04,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:49:04,143 INFO L87 Difference]: Start difference. First operand 295 states and 465 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:05,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:05,142 INFO L93 Difference]: Finished difference Result 628 states and 999 transitions. [2024-10-11 02:49:05,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:49:05,146 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 92 [2024-10-11 02:49:05,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:05,148 INFO L225 Difference]: With dead ends: 628 [2024-10-11 02:49:05,148 INFO L226 Difference]: Without dead ends: 352 [2024-10-11 02:49:05,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:05,150 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 593 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:05,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 817 Invalid, 1717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:49:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-10-11 02:49:05,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 295. [2024-10-11 02:49:05,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 228 states have (on average 1.5921052631578947) internal successors, (363), 231 states have internal predecessors, (363), 48 states have call successors, (48), 16 states have call predecessors, (48), 18 states have return successors, (53), 47 states have call predecessors, (53), 47 states have call successors, (53) [2024-10-11 02:49:05,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 464 transitions. [2024-10-11 02:49:05,165 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 464 transitions. Word has length 92 [2024-10-11 02:49:05,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:05,166 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 464 transitions. [2024-10-11 02:49:05,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 464 transitions. [2024-10-11 02:49:05,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-11 02:49:05,172 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:05,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:05,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:49:05,172 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:05,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:05,173 INFO L85 PathProgramCache]: Analyzing trace with hash 202497312, now seen corresponding path program 2 times [2024-10-11 02:49:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271647388] [2024-10-11 02:49:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:05,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:05,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:49:05,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:49:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:49:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:49:05,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:49:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:49:05,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:05,319 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:49:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:05,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271647388] [2024-10-11 02:49:05,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271647388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:05,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:05,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 02:49:05,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128869390] [2024-10-11 02:49:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 02:49:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:05,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 02:49:05,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 02:49:05,321 INFO L87 Difference]: Start difference. First operand 295 states and 464 transitions. Second operand has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:06,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:06,285 INFO L93 Difference]: Finished difference Result 630 states and 1002 transitions. [2024-10-11 02:49:06,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:49:06,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 93 [2024-10-11 02:49:06,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:06,289 INFO L225 Difference]: With dead ends: 630 [2024-10-11 02:49:06,289 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 02:49:06,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:06,291 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 590 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:06,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 817 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:49:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 02:49:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-10-11 02:49:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 229 states have (on average 1.5895196506550218) internal successors, (364), 233 states have internal predecessors, (364), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (55), 47 states have call predecessors, (55), 47 states have call successors, (55) [2024-10-11 02:49:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 467 transitions. [2024-10-11 02:49:06,304 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 467 transitions. Word has length 93 [2024-10-11 02:49:06,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:06,304 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 467 transitions. [2024-10-11 02:49:06,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 02:49:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 467 transitions. [2024-10-11 02:49:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-11 02:49:06,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:06,305 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:49:06,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:06,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1838214813, now seen corresponding path program 1 times [2024-10-11 02:49:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268172015] [2024-10-11 02:49:06,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:06,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:49:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:49:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:49:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:49:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:49:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:06,465 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:49:06,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:06,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268172015] [2024-10-11 02:49:06,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268172015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:06,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:06,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:49:06,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129254942] [2024-10-11 02:49:06,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:06,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:49:06,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:06,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:49:06,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:49:06,467 INFO L87 Difference]: Start difference. First operand 297 states and 467 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:49:07,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:07,775 INFO L93 Difference]: Finished difference Result 628 states and 997 transitions. [2024-10-11 02:49:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:49:07,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 94 [2024-10-11 02:49:07,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:07,778 INFO L225 Difference]: With dead ends: 628 [2024-10-11 02:49:07,778 INFO L226 Difference]: Without dead ends: 354 [2024-10-11 02:49:07,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:49:07,779 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 593 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2645 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 2645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:07,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1174 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 2645 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:49:07,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-10-11 02:49:07,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 297. [2024-10-11 02:49:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 229 states have (on average 1.5895196506550218) internal successors, (364), 233 states have internal predecessors, (364), 48 states have call successors, (48), 16 states have call predecessors, (48), 19 states have return successors, (54), 47 states have call predecessors, (54), 47 states have call successors, (54) [2024-10-11 02:49:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 466 transitions. [2024-10-11 02:49:07,792 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 466 transitions. Word has length 94 [2024-10-11 02:49:07,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:07,792 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 466 transitions. [2024-10-11 02:49:07,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 8 states have internal predecessors, (59), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:49:07,792 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 466 transitions. [2024-10-11 02:49:07,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-11 02:49:07,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:07,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:07,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:49:07,794 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:07,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:07,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1039142886, now seen corresponding path program 2 times [2024-10-11 02:49:07,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:07,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799568601] [2024-10-11 02:49:07,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:07,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:07,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:49:07,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:49:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:49:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:49:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:49:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:07,956 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:49:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799568601] [2024-10-11 02:49:07,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799568601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:07,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:07,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:49:07,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682085457] [2024-10-11 02:49:07,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:07,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:49:07,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:07,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:49:07,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:49:07,958 INFO L87 Difference]: Start difference. First operand 297 states and 466 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:49:09,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:09,223 INFO L93 Difference]: Finished difference Result 630 states and 1003 transitions. [2024-10-11 02:49:09,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 02:49:09,224 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 95 [2024-10-11 02:49:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:09,226 INFO L225 Difference]: With dead ends: 630 [2024-10-11 02:49:09,226 INFO L226 Difference]: Without dead ends: 356 [2024-10-11 02:49:09,227 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-10-11 02:49:09,227 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 590 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 2679 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 591 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 2679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:09,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [591 Valid, 1175 Invalid, 2833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 2679 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:49:09,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-10-11 02:49:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 299. [2024-10-11 02:49:09,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 230 states have (on average 1.5869565217391304) internal successors, (365), 235 states have internal predecessors, (365), 48 states have call successors, (48), 16 states have call predecessors, (48), 20 states have return successors, (59), 47 states have call predecessors, (59), 47 states have call successors, (59) [2024-10-11 02:49:09,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 472 transitions. [2024-10-11 02:49:09,246 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 472 transitions. Word has length 95 [2024-10-11 02:49:09,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:09,246 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 472 transitions. [2024-10-11 02:49:09,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 4 states have call successors, (13), 5 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-10-11 02:49:09,246 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 472 transitions. [2024-10-11 02:49:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 02:49:09,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:09,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:09,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:49:09,248 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1936030050, now seen corresponding path program 1 times [2024-10-11 02:49:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610396923] [2024-10-11 02:49:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:09,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:49:09,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:49:09,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:49:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:09,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:49:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:09,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610396923] [2024-10-11 02:49:09,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610396923] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:49:09,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953667328] [2024-10-11 02:49:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:09,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:49:09,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:49:09,356 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:49:09,357 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:49:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:09,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 896 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:49:09,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:49:09,557 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:09,557 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:49:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:09,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953667328] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:49:09,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:49:09,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-10-11 02:49:09,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140413508] [2024-10-11 02:49:09,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:49:09,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:49:09,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:09,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:49:09,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:09,626 INFO L87 Difference]: Start difference. First operand 299 states and 472 transitions. Second operand has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:49:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:10,697 INFO L93 Difference]: Finished difference Result 771 states and 1288 transitions. [2024-10-11 02:49:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:49:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 96 [2024-10-11 02:49:10,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:10,701 INFO L225 Difference]: With dead ends: 771 [2024-10-11 02:49:10,701 INFO L226 Difference]: Without dead ends: 666 [2024-10-11 02:49:10,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:10,703 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 868 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1654 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 1654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:10,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 1056 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 1654 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:49:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-10-11 02:49:10,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 594. [2024-10-11 02:49:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 461 states have (on average 1.6377440347071583) internal successors, (755), 466 states have internal predecessors, (755), 112 states have call successors, (112), 16 states have call predecessors, (112), 20 states have return successors, (133), 111 states have call predecessors, (133), 111 states have call successors, (133) [2024-10-11 02:49:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 1000 transitions. [2024-10-11 02:49:10,736 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 1000 transitions. Word has length 96 [2024-10-11 02:49:10,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:10,736 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 1000 transitions. [2024-10-11 02:49:10,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.0) internal successors, (80), 7 states have internal predecessors, (80), 2 states have call successors, (26), 5 states have call predecessors, (26), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-10-11 02:49:10,736 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 1000 transitions. [2024-10-11 02:49:10,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-10-11 02:49:10,740 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:10,740 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:10,756 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:49:10,940 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:49:10,941 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:10,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:10,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1120568895, now seen corresponding path program 1 times [2024-10-11 02:49:10,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:10,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033847878] [2024-10-11 02:49:10,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:10,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:10,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:49:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:49:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:49:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033847878] [2024-10-11 02:49:11,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033847878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:11,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:11,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:11,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068801230] [2024-10-11 02:49:11,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:11,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:11,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:11,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:11,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:11,017 INFO L87 Difference]: Start difference. First operand 594 states and 1000 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:11,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:11,763 INFO L93 Difference]: Finished difference Result 1482 states and 2557 transitions. [2024-10-11 02:49:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 102 [2024-10-11 02:49:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:11,770 INFO L225 Difference]: With dead ends: 1482 [2024-10-11 02:49:11,770 INFO L226 Difference]: Without dead ends: 948 [2024-10-11 02:49:11,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:11,772 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 682 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 893 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 697 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1086 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 893 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:11,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [697 Valid, 608 Invalid, 1086 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 893 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:49:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2024-10-11 02:49:11,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 886. [2024-10-11 02:49:11,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 689 states have (on average 1.6429608127721336) internal successors, (1132), 694 states have internal predecessors, (1132), 176 states have call successors, (176), 16 states have call predecessors, (176), 20 states have return successors, (207), 175 states have call predecessors, (207), 175 states have call successors, (207) [2024-10-11 02:49:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1515 transitions. [2024-10-11 02:49:11,801 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1515 transitions. Word has length 102 [2024-10-11 02:49:11,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:11,801 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1515 transitions. [2024-10-11 02:49:11,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:11,801 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1515 transitions. [2024-10-11 02:49:11,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-10-11 02:49:11,804 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:11,805 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:11,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:49:11,805 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:11,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:11,805 INFO L85 PathProgramCache]: Analyzing trace with hash 434925720, now seen corresponding path program 1 times [2024-10-11 02:49:11,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:11,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522451267] [2024-10-11 02:49:11,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:11,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:11,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:11,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:11,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:49:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:49:11,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:49:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:49:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:49:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522451267] [2024-10-11 02:49:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522451267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:11,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:11,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:11,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657370206] [2024-10-11 02:49:11,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:11,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:11,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:11,872 INFO L87 Difference]: Start difference. First operand 886 states and 1515 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:12,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:12,633 INFO L93 Difference]: Finished difference Result 2179 states and 3784 transitions. [2024-10-11 02:49:12,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:12,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 103 [2024-10-11 02:49:12,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:12,639 INFO L225 Difference]: With dead ends: 2179 [2024-10-11 02:49:12,639 INFO L226 Difference]: Without dead ends: 1403 [2024-10-11 02:49:12,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:12,643 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 680 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 871 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 871 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:12,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 573 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 871 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:49:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-10-11 02:49:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1341. [2024-10-11 02:49:12,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1049 states have (on average 1.6453765490943757) internal successors, (1726), 1054 states have internal predecessors, (1726), 271 states have call successors, (271), 16 states have call predecessors, (271), 20 states have return successors, (302), 270 states have call predecessors, (302), 270 states have call successors, (302) [2024-10-11 02:49:12,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 2299 transitions. [2024-10-11 02:49:12,686 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 2299 transitions. Word has length 103 [2024-10-11 02:49:12,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:12,686 INFO L471 AbstractCegarLoop]: Abstraction has 1341 states and 2299 transitions. [2024-10-11 02:49:12,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 2299 transitions. [2024-10-11 02:49:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:49:12,692 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:12,692 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:12,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:49:12,692 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:12,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:12,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1379442561, now seen corresponding path program 1 times [2024-10-11 02:49:12,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:12,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177264760] [2024-10-11 02:49:12,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:12,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:12,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:49:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:49:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:49:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:49:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:49:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:12,762 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:12,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:12,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177264760] [2024-10-11 02:49:12,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177264760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:12,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:12,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832631958] [2024-10-11 02:49:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:12,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:12,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:12,763 INFO L87 Difference]: Start difference. First operand 1341 states and 2299 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:13,502 INFO L93 Difference]: Finished difference Result 3197 states and 5596 transitions. [2024-10-11 02:49:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2024-10-11 02:49:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:13,512 INFO L225 Difference]: With dead ends: 3197 [2024-10-11 02:49:13,512 INFO L226 Difference]: Without dead ends: 2086 [2024-10-11 02:49:13,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:13,517 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 678 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 865 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 865 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:13,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 570 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 865 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:13,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2024-10-11 02:49:13,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2024. [2024-10-11 02:49:13,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2024 states, 1609 states have (on average 1.6482287134866376) internal successors, (2652), 1614 states have internal predecessors, (2652), 394 states have call successors, (394), 16 states have call predecessors, (394), 20 states have return successors, (441), 393 states have call predecessors, (441), 393 states have call successors, (441) [2024-10-11 02:49:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2024 states to 2024 states and 3487 transitions. [2024-10-11 02:49:13,584 INFO L78 Accepts]: Start accepts. Automaton has 2024 states and 3487 transitions. Word has length 104 [2024-10-11 02:49:13,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:13,584 INFO L471 AbstractCegarLoop]: Abstraction has 2024 states and 3487 transitions. [2024-10-11 02:49:13,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:13,584 INFO L276 IsEmpty]: Start isEmpty. Operand 2024 states and 3487 transitions. [2024-10-11 02:49:13,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:49:13,590 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:13,590 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:13,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:49:13,591 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:13,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:13,591 INFO L85 PathProgramCache]: Analyzing trace with hash 126478775, now seen corresponding path program 1 times [2024-10-11 02:49:13,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:13,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280475160] [2024-10-11 02:49:13,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:13,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:49:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:49:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:49:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:49:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:49:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:13,683 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280475160] [2024-10-11 02:49:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280475160] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:13,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:13,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:13,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539750686] [2024-10-11 02:49:13,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:13,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:13,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:13,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:13,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:13,684 INFO L87 Difference]: Start difference. First operand 2024 states and 3487 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:14,437 INFO L93 Difference]: Finished difference Result 4767 states and 8401 transitions. [2024-10-11 02:49:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:14,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 105 [2024-10-11 02:49:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:14,451 INFO L225 Difference]: With dead ends: 4767 [2024-10-11 02:49:14,451 INFO L226 Difference]: Without dead ends: 3170 [2024-10-11 02:49:14,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:14,458 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 676 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 1053 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:14,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 570 Invalid, 1053 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:14,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2024-10-11 02:49:14,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3108. [2024-10-11 02:49:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3108 states, 2514 states have (on average 1.6499602227525856) internal successors, (4148), 2519 states have internal predecessors, (4148), 573 states have call successors, (573), 16 states have call predecessors, (573), 20 states have return successors, (646), 572 states have call predecessors, (646), 572 states have call successors, (646) [2024-10-11 02:49:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 5367 transitions. [2024-10-11 02:49:14,615 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 5367 transitions. Word has length 105 [2024-10-11 02:49:14,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:14,615 INFO L471 AbstractCegarLoop]: Abstraction has 3108 states and 5367 transitions. [2024-10-11 02:49:14,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 5367 transitions. [2024-10-11 02:49:14,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-10-11 02:49:14,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:14,624 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:14,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:49:14,624 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:14,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:14,624 INFO L85 PathProgramCache]: Analyzing trace with hash 362355683, now seen corresponding path program 1 times [2024-10-11 02:49:14,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:14,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563347391] [2024-10-11 02:49:14,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:14,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:14,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:49:14,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:49:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:49:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:49:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:49:14,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:14,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563347391] [2024-10-11 02:49:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563347391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:14,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:14,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592093320] [2024-10-11 02:49:14,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:14,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:14,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:14,720 INFO L87 Difference]: Start difference. First operand 3108 states and 5367 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:15,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:15,488 INFO L93 Difference]: Finished difference Result 7598 states and 13413 transitions. [2024-10-11 02:49:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:15,489 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2024-10-11 02:49:15,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:15,511 INFO L225 Difference]: With dead ends: 7598 [2024-10-11 02:49:15,511 INFO L226 Difference]: Without dead ends: 5140 [2024-10-11 02:49:15,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:15,519 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 674 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:15,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 601 Invalid, 1077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:15,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5140 states. [2024-10-11 02:49:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5140 to 5078. [2024-10-11 02:49:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 4108 states have (on average 1.6404576436222005) internal successors, (6739), 4113 states have internal predecessors, (6739), 949 states have call successors, (949), 16 states have call predecessors, (949), 20 states have return successors, (1066), 948 states have call predecessors, (1066), 948 states have call successors, (1066) [2024-10-11 02:49:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 8754 transitions. [2024-10-11 02:49:15,689 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 8754 transitions. Word has length 106 [2024-10-11 02:49:15,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:15,690 INFO L471 AbstractCegarLoop]: Abstraction has 5078 states and 8754 transitions. [2024-10-11 02:49:15,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:15,690 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 8754 transitions. [2024-10-11 02:49:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-10-11 02:49:15,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:15,700 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:15,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:49:15,701 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:15,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:15,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1327070803, now seen corresponding path program 1 times [2024-10-11 02:49:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425121617] [2024-10-11 02:49:15,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:15,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:15,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:49:15,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:49:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:49:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:49:15,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:49:15,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:15,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425121617] [2024-10-11 02:49:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425121617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:15,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:15,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110871099] [2024-10-11 02:49:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:15,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:15,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:15,779 INFO L87 Difference]: Start difference. First operand 5078 states and 8754 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:16,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:16,527 INFO L93 Difference]: Finished difference Result 12579 states and 22161 transitions. [2024-10-11 02:49:16,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:16,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 107 [2024-10-11 02:49:16,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:16,579 INFO L225 Difference]: With dead ends: 12579 [2024-10-11 02:49:16,579 INFO L226 Difference]: Without dead ends: 8517 [2024-10-11 02:49:16,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:16,594 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 672 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 687 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:16,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [687 Valid, 571 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 861 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:16,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8517 states. [2024-10-11 02:49:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8517 to 8455. [2024-10-11 02:49:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8455 states, 6879 states have (on average 1.6371565634539904) internal successors, (11262), 6884 states have internal predecessors, (11262), 1555 states have call successors, (1555), 16 states have call predecessors, (1555), 20 states have return successors, (1750), 1554 states have call predecessors, (1750), 1554 states have call successors, (1750) [2024-10-11 02:49:16,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8455 states to 8455 states and 14567 transitions. [2024-10-11 02:49:16,963 INFO L78 Accepts]: Start accepts. Automaton has 8455 states and 14567 transitions. Word has length 107 [2024-10-11 02:49:16,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:16,964 INFO L471 AbstractCegarLoop]: Abstraction has 8455 states and 14567 transitions. [2024-10-11 02:49:16,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:16,965 INFO L276 IsEmpty]: Start isEmpty. Operand 8455 states and 14567 transitions. [2024-10-11 02:49:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:49:16,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:16,978 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:16,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:49:16,979 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:16,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:16,979 INFO L85 PathProgramCache]: Analyzing trace with hash -16444223, now seen corresponding path program 1 times [2024-10-11 02:49:16,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:16,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875953820] [2024-10-11 02:49:16,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:16,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:17,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:17,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:49:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:49:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:49:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:49:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:49:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:17,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:17,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:17,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875953820] [2024-10-11 02:49:17,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875953820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:17,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:17,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:17,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938084214] [2024-10-11 02:49:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:17,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:17,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:17,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:17,077 INFO L87 Difference]: Start difference. First operand 8455 states and 14567 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:17,992 INFO L93 Difference]: Finished difference Result 21931 states and 38560 transitions. [2024-10-11 02:49:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2024-10-11 02:49:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:18,047 INFO L225 Difference]: With dead ends: 21931 [2024-10-11 02:49:18,048 INFO L226 Difference]: Without dead ends: 14901 [2024-10-11 02:49:18,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:18,072 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 670 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:18,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 612 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:18,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14901 states. [2024-10-11 02:49:18,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14901 to 14839. [2024-10-11 02:49:18,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14839 states, 12060 states have (on average 1.626782752902156) internal successors, (19619), 12065 states have internal predecessors, (19619), 2758 states have call successors, (2758), 16 states have call predecessors, (2758), 20 states have return successors, (3097), 2757 states have call predecessors, (3097), 2757 states have call successors, (3097) [2024-10-11 02:49:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14839 states to 14839 states and 25474 transitions. [2024-10-11 02:49:18,560 INFO L78 Accepts]: Start accepts. Automaton has 14839 states and 25474 transitions. Word has length 108 [2024-10-11 02:49:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:18,560 INFO L471 AbstractCegarLoop]: Abstraction has 14839 states and 25474 transitions. [2024-10-11 02:49:18,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 14839 states and 25474 transitions. [2024-10-11 02:49:18,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-10-11 02:49:18,576 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:18,576 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:18,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:49:18,577 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:18,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:18,577 INFO L85 PathProgramCache]: Analyzing trace with hash -29769774, now seen corresponding path program 1 times [2024-10-11 02:49:18,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:18,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965289383] [2024-10-11 02:49:18,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:18,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:18,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:18,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:18,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:49:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:49:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:49:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:49:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:49:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:18,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965289383] [2024-10-11 02:49:18,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965289383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:18,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:18,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:18,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592102335] [2024-10-11 02:49:18,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:18,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:18,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:18,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:18,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:18,651 INFO L87 Difference]: Start difference. First operand 14839 states and 25474 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:20,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:20,045 INFO L93 Difference]: Finished difference Result 39290 states and 68946 transitions. [2024-10-11 02:49:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2024-10-11 02:49:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:20,139 INFO L225 Difference]: With dead ends: 39290 [2024-10-11 02:49:20,140 INFO L226 Difference]: Without dead ends: 26468 [2024-10-11 02:49:20,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:20,177 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 668 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:20,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 571 Invalid, 1060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 02:49:20,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26468 states. [2024-10-11 02:49:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26468 to 26406. [2024-10-11 02:49:20,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26406 states, 21588 states have (on average 1.6223828052621827) internal successors, (35024), 21593 states have internal predecessors, (35024), 4797 states have call successors, (4797), 16 states have call predecessors, (4797), 20 states have return successors, (5410), 4796 states have call predecessors, (5410), 4796 states have call successors, (5410) [2024-10-11 02:49:21,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26406 states to 26406 states and 45231 transitions. [2024-10-11 02:49:21,070 INFO L78 Accepts]: Start accepts. Automaton has 26406 states and 45231 transitions. Word has length 109 [2024-10-11 02:49:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:21,070 INFO L471 AbstractCegarLoop]: Abstraction has 26406 states and 45231 transitions. [2024-10-11 02:49:21,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:21,071 INFO L276 IsEmpty]: Start isEmpty. Operand 26406 states and 45231 transitions. [2024-10-11 02:49:21,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-11 02:49:21,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:21,089 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:21,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:49:21,090 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:21,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:21,090 INFO L85 PathProgramCache]: Analyzing trace with hash 369312063, now seen corresponding path program 1 times [2024-10-11 02:49:21,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:21,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441332057] [2024-10-11 02:49:21,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:21,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:49:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:49:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:49:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:49:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:49:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:21,172 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:21,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:21,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441332057] [2024-10-11 02:49:21,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441332057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:21,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:21,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:21,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715441920] [2024-10-11 02:49:21,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:21,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:21,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:21,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:21,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:21,174 INFO L87 Difference]: Start difference. First operand 26406 states and 45231 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:22,857 INFO L93 Difference]: Finished difference Result 71902 states and 125370 transitions. [2024-10-11 02:49:22,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:22,857 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 110 [2024-10-11 02:49:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:23,073 INFO L225 Difference]: With dead ends: 71902 [2024-10-11 02:49:23,073 INFO L226 Difference]: Without dead ends: 48228 [2024-10-11 02:49:23,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:23,139 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 666 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:23,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 581 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 02:49:23,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48228 states. [2024-10-11 02:49:24,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48228 to 48166. [2024-10-11 02:49:24,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48166 states, 39633 states have (on average 1.6167335301390255) internal successors, (64076), 39638 states have internal predecessors, (64076), 8512 states have call successors, (8512), 16 states have call predecessors, (8512), 20 states have return successors, (9657), 8511 states have call predecessors, (9657), 8511 states have call successors, (9657) [2024-10-11 02:49:25,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48166 states to 48166 states and 82245 transitions. [2024-10-11 02:49:25,121 INFO L78 Accepts]: Start accepts. Automaton has 48166 states and 82245 transitions. Word has length 110 [2024-10-11 02:49:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 48166 states and 82245 transitions. [2024-10-11 02:49:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 48166 states and 82245 transitions. [2024-10-11 02:49:25,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 02:49:25,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:25,146 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:25,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:49:25,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:25,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:25,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1128571666, now seen corresponding path program 1 times [2024-10-11 02:49:25,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:25,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505051708] [2024-10-11 02:49:25,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:25,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:25,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:25,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:49:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:49:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:49:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:49:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:49:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:25,250 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:25,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:25,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505051708] [2024-10-11 02:49:25,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505051708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:25,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:25,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 02:49:25,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695062358] [2024-10-11 02:49:25,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:25,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 02:49:25,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:25,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 02:49:25,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:49:25,253 INFO L87 Difference]: Start difference. First operand 48166 states and 82245 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:27,749 INFO L93 Difference]: Finished difference Result 89621 states and 156734 transitions. [2024-10-11 02:49:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 02:49:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 111 [2024-10-11 02:49:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:28,091 INFO L225 Difference]: With dead ends: 89621 [2024-10-11 02:49:28,091 INFO L226 Difference]: Without dead ends: 89516 [2024-10-11 02:49:28,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:49:28,134 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 661 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:28,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 583 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 02:49:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89516 states. [2024-10-11 02:49:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89516 to 89454. [2024-10-11 02:49:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89454 states, 74122 states have (on average 1.609589595531691) internal successors, (119306), 74127 states have internal predecessors, (119306), 15311 states have call successors, (15311), 16 states have call predecessors, (15311), 20 states have return successors, (17502), 15310 states have call predecessors, (17502), 15310 states have call successors, (17502) [2024-10-11 02:49:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89454 states to 89454 states and 152119 transitions. [2024-10-11 02:49:31,277 INFO L78 Accepts]: Start accepts. Automaton has 89454 states and 152119 transitions. Word has length 111 [2024-10-11 02:49:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:31,278 INFO L471 AbstractCegarLoop]: Abstraction has 89454 states and 152119 transitions. [2024-10-11 02:49:31,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (13), 5 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 89454 states and 152119 transitions. [2024-10-11 02:49:31,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:49:31,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:31,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:31,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:49:31,296 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:31,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 215070784, now seen corresponding path program 1 times [2024-10-11 02:49:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:31,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633340522] [2024-10-11 02:49:31,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:31,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:49:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:49:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:49:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:31,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:31,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633340522] [2024-10-11 02:49:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633340522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:31,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:31,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:49:31,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558698340] [2024-10-11 02:49:31,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:31,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:49:31,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:31,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:49:31,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:49:31,451 INFO L87 Difference]: Start difference. First operand 89454 states and 152119 transitions. Second operand has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:34,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:34,606 INFO L93 Difference]: Finished difference Result 89757 states and 155850 transitions. [2024-10-11 02:49:34,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 02:49:34,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2024-10-11 02:49:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:34,899 INFO L225 Difference]: With dead ends: 89757 [2024-10-11 02:49:34,900 INFO L226 Difference]: Without dead ends: 89661 [2024-10-11 02:49:34,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2024-10-11 02:49:34,934 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 1007 mSDsluCounter, 654 mSDsCounter, 0 mSdLazyCounter, 2430 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1021 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 2430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:34,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1021 Valid, 811 Invalid, 2634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 2430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:49:34,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89661 states. [2024-10-11 02:49:37,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89661 to 89552. [2024-10-11 02:49:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89552 states, 74200 states have (on average 1.609487870619946) internal successors, (119424), 74205 states have internal predecessors, (119424), 15321 states have call successors, (15321), 24 states have call predecessors, (15321), 30 states have return successors, (17515), 15322 states have call predecessors, (17515), 15319 states have call successors, (17515) [2024-10-11 02:49:38,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89552 states to 89552 states and 152260 transitions. [2024-10-11 02:49:38,348 INFO L78 Accepts]: Start accepts. Automaton has 89552 states and 152260 transitions. Word has length 112 [2024-10-11 02:49:38,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:38,349 INFO L471 AbstractCegarLoop]: Abstraction has 89552 states and 152260 transitions. [2024-10-11 02:49:38,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.0) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:38,349 INFO L276 IsEmpty]: Start isEmpty. Operand 89552 states and 152260 transitions. [2024-10-11 02:49:38,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:49:38,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:38,371 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:38,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:49:38,371 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:38,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:38,372 INFO L85 PathProgramCache]: Analyzing trace with hash -264129549, now seen corresponding path program 1 times [2024-10-11 02:49:38,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:38,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565533630] [2024-10-11 02:49:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:38,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:38,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:38,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:38,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:49:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:49:38,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:49:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:38,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:38,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565533630] [2024-10-11 02:49:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565533630] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:38,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:38,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 02:49:38,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240098244] [2024-10-11 02:49:38,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:38,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 02:49:38,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:38,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 02:49:38,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:49:38,576 INFO L87 Difference]: Start difference. First operand 89552 states and 152260 transitions. Second operand has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 02:49:42,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:42,009 INFO L93 Difference]: Finished difference Result 90037 states and 156299 transitions. [2024-10-11 02:49:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:49:42,009 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 113 [2024-10-11 02:49:42,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:42,320 INFO L225 Difference]: With dead ends: 90037 [2024-10-11 02:49:42,320 INFO L226 Difference]: Without dead ends: 89707 [2024-10-11 02:49:42,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=746, Unknown=0, NotChecked=0, Total=930 [2024-10-11 02:49:42,355 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1072 mSDsluCounter, 1286 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 3305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:42,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 1440 Invalid, 3305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:49:42,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89707 states. [2024-10-11 02:49:45,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89707 to 89589. [2024-10-11 02:49:45,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89589 states, 74229 states have (on average 1.6093979441997064) internal successors, (119464), 74237 states have internal predecessors, (119464), 15327 states have call successors, (15327), 25 states have call predecessors, (15327), 32 states have return successors, (17523), 15326 states have call predecessors, (17523), 15325 states have call successors, (17523) [2024-10-11 02:49:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89589 states to 89589 states and 152314 transitions. [2024-10-11 02:49:45,505 INFO L78 Accepts]: Start accepts. Automaton has 89589 states and 152314 transitions. Word has length 113 [2024-10-11 02:49:45,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:45,506 INFO L471 AbstractCegarLoop]: Abstraction has 89589 states and 152314 transitions. [2024-10-11 02:49:45,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 6.636363636363637) internal successors, (73), 9 states have internal predecessors, (73), 7 states have call successors, (13), 5 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2024-10-11 02:49:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 89589 states and 152314 transitions. [2024-10-11 02:49:45,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:49:45,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:45,530 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 02:49:45,530 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1263317386, now seen corresponding path program 1 times [2024-10-11 02:49:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594526021] [2024-10-11 02:49:45,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:45,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:45,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:45,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:49:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:49:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:49:45,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 02:49:45,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:45,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594526021] [2024-10-11 02:49:45,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594526021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:45,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:45,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 02:49:45,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190464969] [2024-10-11 02:49:45,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:45,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 02:49:45,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:45,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 02:49:45,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 02:49:45,695 INFO L87 Difference]: Start difference. First operand 89589 states and 152314 transitions. Second operand has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:48,848 INFO L93 Difference]: Finished difference Result 90121 states and 156393 transitions. [2024-10-11 02:49:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 02:49:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) Word has length 116 [2024-10-11 02:49:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:49,233 INFO L225 Difference]: With dead ends: 90121 [2024-10-11 02:49:49,233 INFO L226 Difference]: Without dead ends: 90053 [2024-10-11 02:49:49,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2024-10-11 02:49:49,263 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 1123 mSDsluCounter, 1038 mSDsCounter, 0 mSdLazyCounter, 2626 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 2626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:49,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1192 Invalid, 2914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 2626 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 02:49:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90053 states. [2024-10-11 02:49:51,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90053 to 89832. [2024-10-11 02:49:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89832 states, 74422 states have (on average 1.609067211308484) internal successors, (119750), 74433 states have internal predecessors, (119750), 15352 states have call successors, (15352), 41 states have call predecessors, (15352), 57 states have return successors, (17563), 15357 states have call predecessors, (17563), 15348 states have call successors, (17563) [2024-10-11 02:49:52,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89832 states to 89832 states and 152665 transitions. [2024-10-11 02:49:52,417 INFO L78 Accepts]: Start accepts. Automaton has 89832 states and 152665 transitions. Word has length 116 [2024-10-11 02:49:52,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:49:52,422 INFO L471 AbstractCegarLoop]: Abstraction has 89832 states and 152665 transitions. [2024-10-11 02:49:52,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.909090909090909) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (13), 4 states have call predecessors, (13), 2 states have return successors, (11), 4 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-11 02:49:52,422 INFO L276 IsEmpty]: Start isEmpty. Operand 89832 states and 152665 transitions. [2024-10-11 02:49:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:49:52,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:49:52,452 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:49:52,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 02:49:52,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:49:52,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:49:52,455 INFO L85 PathProgramCache]: Analyzing trace with hash -243949583, now seen corresponding path program 1 times [2024-10-11 02:49:52,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:49:52,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081619173] [2024-10-11 02:49:52,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:49:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:49:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:49:52,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:49:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:49:52,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:49:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:49:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:49:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:49:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:49:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:49:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:49:52,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:49:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:49:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 02:49:52,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:49:52,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081619173] [2024-10-11 02:49:52,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081619173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:49:52,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:49:52,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-11 02:49:52,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569303536] [2024-10-11 02:49:52,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:49:52,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 02:49:52,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:49:52,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 02:49:52,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-10-11 02:49:52,683 INFO L87 Difference]: Start difference. First operand 89832 states and 152665 transitions. Second operand has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) [2024-10-11 02:49:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:49:55,724 INFO L93 Difference]: Finished difference Result 90243 states and 156571 transitions. [2024-10-11 02:49:55,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:49:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.714285714285714) internal successors, (80), 9 states have internal predecessors, (80), 5 states have call successors, (13), 6 states have call predecessors, (13), 2 states have return successors, (11), 6 states have call predecessors, (11), 5 states have call successors, (11) Word has length 117 [2024-10-11 02:49:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:49:56,026 INFO L225 Difference]: With dead ends: 90243 [2024-10-11 02:49:56,026 INFO L226 Difference]: Without dead ends: 90039 [2024-10-11 02:49:56,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-10-11 02:49:56,076 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 1247 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 2931 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1262 SdHoareTripleChecker+Valid, 1369 SdHoareTripleChecker+Invalid, 3198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 2931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:49:56,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1262 Valid, 1369 Invalid, 3198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 2931 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:49:56,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90039 states. [2024-10-11 02:49:58,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90039 to 89830. [2024-10-11 02:49:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89830 states, 74420 states have (on average 1.6090701424348293) internal successors, (119747), 74432 states have internal predecessors, (119747), 15352 states have call successors, (15352), 41 states have call predecessors, (15352), 57 states have return successors, (17561), 15356 states have call predecessors, (17561), 15348 states have call successors, (17561)