./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 23:03:38,944 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 23:03:39,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 23:03:39,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 23:03:39,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 23:03:39,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 23:03:39,071 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 23:03:39,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 23:03:39,072 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 23:03:39,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 23:03:39,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 23:03:39,073 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 23:03:39,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 23:03:39,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 23:03:39,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 23:03:39,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 23:03:39,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 23:03:39,076 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 23:03:39,076 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 23:03:39,078 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 23:03:39,078 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 23:03:39,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 23:03:39,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 23:03:39,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 23:03:39,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 23:03:39,083 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 23:03:39,083 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 23:03:39,084 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 23:03:39,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 23:03:39,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 23:03:39,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 23:03:39,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 23:03:39,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:03:39,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 23:03:39,085 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 23:03:39,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 23:03:39,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 23:03:39,087 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 23:03:39,087 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 23:03:39,087 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 23:03:39,088 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 23:03:39,088 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 23:03:39,089 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 195d502e207cba6e22b4d3a0f1eab4288ed491325552159482eaed582ac159e0 [2024-11-09 23:03:39,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 23:03:39,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 23:03:39,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 23:03:39,313 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 23:03:39,313 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 23:03:39,314 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2024-11-09 23:03:40,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 23:03:40,909 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 23:03:40,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c [2024-11-09 23:03:40,927 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319c019c9/c4b01113cec2492da7bcad750bf6dba7/FLAG017309167 [2024-11-09 23:03:40,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/319c019c9/c4b01113cec2492da7bcad750bf6dba7 [2024-11-09 23:03:40,941 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 23:03:40,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 23:03:40,943 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 23:03:40,943 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 23:03:40,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 23:03:40,948 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:40" (1/1) ... [2024-11-09 23:03:40,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78d54581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:40, skipping insertion in model container [2024-11-09 23:03:40,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 11:03:40" (1/1) ... [2024-11-09 23:03:40,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 23:03:41,326 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2024-11-09 23:03:41,466 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:03:41,483 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 23:03:41,490 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2024-11-09 23:03:41,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [414] [2024-11-09 23:03:41,491 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [461] [2024-11-09 23:03:41,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [499] [2024-11-09 23:03:41,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [799] [2024-11-09 23:03:41,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [808] [2024-11-09 23:03:41,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1024] [2024-11-09 23:03:41,492 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1129] [2024-11-09 23:03:41,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1146] [2024-11-09 23:03:41,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2217] [2024-11-09 23:03:41,493 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2621] [2024-11-09 23:03:41,529 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product19.cil.c[17762,17775] [2024-11-09 23:03:41,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 23:03:41,600 INFO L204 MainTranslator]: Completed translation [2024-11-09 23:03:41,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41 WrapperNode [2024-11-09 23:03:41,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 23:03:41,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 23:03:41,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 23:03:41,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 23:03:41,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,633 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,673 INFO L138 Inliner]: procedures = 127, calls = 186, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 958 [2024-11-09 23:03:41,674 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 23:03:41,674 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 23:03:41,674 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 23:03:41,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 23:03:41,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,685 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,702 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-09 23:03:41,705 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,705 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,718 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,729 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,738 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 23:03:41,743 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 23:03:41,745 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 23:03:41,745 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 23:03:41,745 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (1/1) ... [2024-11-09 23:03:41,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 23:03:41,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:41,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 23:03:41,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 23:03:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-09 23:03:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-09 23:03:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-09 23:03:41,829 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-09 23:03:41,829 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-09 23:03:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-09 23:03:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-09 23:03:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-09 23:03:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-09 23:03:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-09 23:03:41,833 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-09 23:03:41,833 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-09 23:03:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-09 23:03:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-09 23:03:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-09 23:03:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-09 23:03:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 23:03:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-09 23:03:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-09 23:03:41,834 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-09 23:03:41,834 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-09 23:03:41,835 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 23:03:41,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 23:03:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 23:03:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 23:03:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-09 23:03:41,836 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-09 23:03:41,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 23:03:41,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 23:03:42,035 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 23:03:42,037 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 23:03:42,082 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2565: #res := ~retValue_acc~36; [2024-11-09 23:03:42,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2265-1: getEmailId_#res#1 := getEmailId_~retValue_acc~28#1; [2024-11-09 23:03:42,257 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2812-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2024-11-09 23:03:42,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2194-1: getClientId_#res#1 := getClientId_~retValue_acc~26#1; [2024-11-09 23:03:42,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2147-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~25#1; [2024-11-09 23:03:42,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1759-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~19#1; [2024-11-09 23:03:42,263 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2528: #res := ~retValue_acc~35; [2024-11-09 23:03:42,292 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2602: #res := ~retValue_acc~37; [2024-11-09 23:03:42,304 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2339: #res := ~retValue_acc~30; [2024-11-09 23:03:42,331 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1851: #res#1 := ~retValue_acc~21#1; [2024-11-09 23:03:42,331 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1806-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~20#1; [2024-11-09 23:03:42,352 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2075: #res := ~retValue_acc~24; [2024-11-09 23:03:42,375 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1126-1: createEmail_#res#1 := createEmail_~retValue_acc~8#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2769-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2778-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2787-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2021-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~23#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1914-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~22#1; [2024-11-09 23:03:42,562 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L496-1: valid_product_#res#1 := valid_product_~retValue_acc~4#1; [2024-11-09 23:03:42,568 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L2302: #res := ~retValue_acc~29; [2024-11-09 23:03:42,570 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1102: #res := ~retValue_acc~6; [2024-11-09 23:03:42,714 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2024-11-09 23:03:42,714 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 23:03:42,734 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 23:03:42,737 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 23:03:42,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:03:42 BoogieIcfgContainer [2024-11-09 23:03:42,737 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 23:03:42,739 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 23:03:42,739 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 23:03:42,742 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 23:03:42,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 11:03:40" (1/3) ... [2024-11-09 23:03:42,742 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e0cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:42, skipping insertion in model container [2024-11-09 23:03:42,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 11:03:41" (2/3) ... [2024-11-09 23:03:42,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e0cad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 11:03:42, skipping insertion in model container [2024-11-09 23:03:42,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 11:03:42" (3/3) ... [2024-11-09 23:03:42,744 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec27_product19.cil.c [2024-11-09 23:03:42,756 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 23:03:42,757 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 23:03:42,810 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 23:03:42,815 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;@6849c94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 23:03:42,815 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 23:03:42,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 260 states have (on average 1.5038461538461538) internal successors, (391), 262 states have internal predecessors, (391), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-09 23:03:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-09 23:03:42,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:42,836 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:42,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:42,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:42,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1470970236, now seen corresponding path program 1 times [2024-11-09 23:03:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:42,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571275201] [2024-11-09 23:03:42,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:42,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:43,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:03:43,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:03:43,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:03:43,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 23:03:43,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-09 23:03:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:03:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-09 23:03:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:03:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:03:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:03:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:03:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:03:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:43,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571275201] [2024-11-09 23:03:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571275201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:43,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754489204] [2024-11-09 23:03:43,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:43,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:43,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:43,482 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:43,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 23:03:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:43,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 23:03:43,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:43,883 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:03:43,883 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:03:43,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754489204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:43,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:03:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-09 23:03:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174306876] [2024-11-09 23:03:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:43,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 23:03:43,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:43,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 23:03:43,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:03:43,908 INFO L87 Difference]: Start difference. First operand has 326 states, 260 states have (on average 1.5038461538461538) internal successors, (391), 262 states have internal predecessors, (391), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:43,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:43,944 INFO L93 Difference]: Finished difference Result 487 states and 709 transitions. [2024-11-09 23:03:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 23:03:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2024-11-09 23:03:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:43,954 INFO L225 Difference]: With dead ends: 487 [2024-11-09 23:03:43,954 INFO L226 Difference]: Without dead ends: 318 [2024-11-09 23:03:43,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:03:43,959 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:43,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:03:43,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-09 23:03:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-09 23:03:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 253 states have (on average 1.4980237154150198) internal successors, (379), 254 states have internal predecessors, (379), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 23:03:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 470 transitions. [2024-11-09 23:03:44,008 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 470 transitions. Word has length 109 [2024-11-09 23:03:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:44,009 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 470 transitions. [2024-11-09 23:03:44,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 470 transitions. [2024-11-09 23:03:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 23:03:44,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:44,017 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:44,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 23:03:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 23:03:44,219 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:44,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:44,220 INFO L85 PathProgramCache]: Analyzing trace with hash 139982754, now seen corresponding path program 1 times [2024-11-09 23:03:44,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:44,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475377972] [2024-11-09 23:03:44,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:44,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:44,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:03:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:03:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:03:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-09 23:03:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-09 23:03:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-09 23:03:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-09 23:03:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:03:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:03:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:03:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:03:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,520 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-09 23:03:44,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475377972] [2024-11-09 23:03:44,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475377972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:44,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431530517] [2024-11-09 23:03:44,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:44,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:44,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:44,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:44,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 23:03:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:44,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 1031 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 23:03:44,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:03:44,802 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:03:44,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431530517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:44,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:03:44,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:03:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278810069] [2024-11-09 23:03:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:03:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:44,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:03:44,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:03:44,804 INFO L87 Difference]: Start difference. First operand 318 states and 470 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:44,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:44,848 INFO L93 Difference]: Finished difference Result 476 states and 689 transitions. [2024-11-09 23:03:44,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:03:44,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-11-09 23:03:44,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:44,851 INFO L225 Difference]: With dead ends: 476 [2024-11-09 23:03:44,851 INFO L226 Difference]: Without dead ends: 321 [2024-11-09 23:03:44,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:03:44,856 INFO L432 NwaCegarLoop]: 469 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:44,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 936 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:03:44,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-09 23:03:44,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-09 23:03:44,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 256 states have (on average 1.4921875) internal successors, (382), 257 states have internal predecessors, (382), 46 states have call successors, (46), 18 states have call predecessors, (46), 18 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-09 23:03:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 473 transitions. [2024-11-09 23:03:44,872 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 473 transitions. Word has length 111 [2024-11-09 23:03:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:44,872 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 473 transitions. [2024-11-09 23:03:44,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:44,873 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 473 transitions. [2024-11-09 23:03:44,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 23:03:44,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:44,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:44,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 23:03:45,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 23:03:45,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:45,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash 470021488, now seen corresponding path program 1 times [2024-11-09 23:03:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:45,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204930434] [2024-11-09 23:03:45,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:45,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:03:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:03:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:03:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-09 23:03:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:03:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-09 23:03:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:03:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:03:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:03:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:03:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:03:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,296 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:03:45,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204930434] [2024-11-09 23:03:45,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204930434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:45,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779996465] [2024-11-09 23:03:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:45,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:45,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:45,298 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:45,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 23:03:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:45,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 1045 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:03:45,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-09 23:03:45,547 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:03:45,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779996465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:45,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:03:45,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-09 23:03:45,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484042569] [2024-11-09 23:03:45,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:45,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 23:03:45,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:45,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 23:03:45,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:03:45,549 INFO L87 Difference]: Start difference. First operand 321 states and 473 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:45,571 INFO L93 Difference]: Finished difference Result 681 states and 1014 transitions. [2024-11-09 23:03:45,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 23:03:45,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-11-09 23:03:45,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:45,574 INFO L225 Difference]: With dead ends: 681 [2024-11-09 23:03:45,574 INFO L226 Difference]: Without dead ends: 388 [2024-11-09 23:03:45,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:03:45,576 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 117 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:45,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 905 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:03:45,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-09 23:03:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2024-11-09 23:03:45,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 304 states have (on average 1.493421052631579) internal successors, (454), 305 states have internal predecessors, (454), 57 states have call successors, (57), 18 states have call predecessors, (57), 18 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-09 23:03:45,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 567 transitions. [2024-11-09 23:03:45,613 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 567 transitions. Word has length 118 [2024-11-09 23:03:45,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:45,613 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 567 transitions. [2024-11-09 23:03:45,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:03:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 567 transitions. [2024-11-09 23:03:45,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-09 23:03:45,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:45,616 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:45,630 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 23:03:45,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:45,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:45,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:45,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1848967065, now seen corresponding path program 1 times [2024-11-09 23:03:45,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:45,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054202723] [2024-11-09 23:03:45,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:46,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 23:03:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-09 23:03:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-09 23:03:46,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-09 23:03:46,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:03:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:03:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:03:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:03:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-09 23:03:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:03:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:03:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:03:46,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:46,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054202723] [2024-11-09 23:03:46,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054202723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:46,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1335523889] [2024-11-09 23:03:46,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:46,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:46,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:46,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:46,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 23:03:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,423 INFO L255 TraceCheckSpWp]: Trace formula consists of 1050 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 23:03:46,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:03:46,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:03:46,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1335523889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:46,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:03:46,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-09 23:03:46,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608763928] [2024-11-09 23:03:46,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:46,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:03:46,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:46,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:03:46,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:03:46,489 INFO L87 Difference]: Start difference. First operand 380 states and 567 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:46,533 INFO L93 Difference]: Finished difference Result 751 states and 1124 transitions. [2024-11-09 23:03:46,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:03:46,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 119 [2024-11-09 23:03:46,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:46,541 INFO L225 Difference]: With dead ends: 751 [2024-11-09 23:03:46,541 INFO L226 Difference]: Without dead ends: 382 [2024-11-09 23:03:46,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:03:46,545 INFO L432 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:46,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1837 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 23:03:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-11-09 23:03:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2024-11-09 23:03:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 305 states have (on average 1.4918032786885247) internal successors, (455), 307 states have internal predecessors, (455), 57 states have call successors, (57), 18 states have call predecessors, (57), 19 states have return successors, (58), 56 states have call predecessors, (58), 56 states have call successors, (58) [2024-11-09 23:03:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 570 transitions. [2024-11-09 23:03:46,560 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 570 transitions. Word has length 119 [2024-11-09 23:03:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:46,560 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 570 transitions. [2024-11-09 23:03:46,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:46,561 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 570 transitions. [2024-11-09 23:03:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 23:03:46,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:46,563 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:46,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 23:03:46,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:46,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:46,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:46,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1870694494, now seen corresponding path program 1 times [2024-11-09 23:03:46,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:46,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123635110] [2024-11-09 23:03:46,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:46,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:46,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-09 23:03:47,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 23:03:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-09 23:03:47,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:03:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:03:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:03:47,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:03:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:03:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:03:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:03:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:03:47,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123635110] [2024-11-09 23:03:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123635110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:47,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062690895] [2024-11-09 23:03:47,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:47,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:47,113 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:47,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 23:03:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,338 INFO L255 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 23:03:47,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:47,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-09 23:03:47,386 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 23:03:47,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062690895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:47,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 23:03:47,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-09 23:03:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108441192] [2024-11-09 23:03:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 23:03:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:47,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 23:03:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:03:47,388 INFO L87 Difference]: Start difference. First operand 382 states and 570 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:47,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:47,500 INFO L93 Difference]: Finished difference Result 753 states and 1129 transitions. [2024-11-09 23:03:47,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 23:03:47,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2024-11-09 23:03:47,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:47,503 INFO L225 Difference]: With dead ends: 753 [2024-11-09 23:03:47,503 INFO L226 Difference]: Without dead ends: 384 [2024-11-09 23:03:47,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-09 23:03:47,505 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 2 mSDsluCounter, 1363 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:47,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1823 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 23:03:47,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-09 23:03:47,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-11-09 23:03:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 306 states have (on average 1.4901960784313726) internal successors, (456), 309 states have internal predecessors, (456), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2024-11-09 23:03:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 576 transitions. [2024-11-09 23:03:47,536 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 576 transitions. Word has length 120 [2024-11-09 23:03:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 576 transitions. [2024-11-09 23:03:47,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 576 transitions. [2024-11-09 23:03:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 23:03:47,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:47,539 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, 1, 1, 1, 1] [2024-11-09 23:03:47,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 23:03:47,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:47,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:47,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:47,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1274447503, now seen corresponding path program 1 times [2024-11-09 23:03:47,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:47,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422676868] [2024-11-09 23:03:47,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:47,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:47,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-09 23:03:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 23:03:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-09 23:03:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:03:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:03:47,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:03:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:03:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:03:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:03:47,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:03:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:47,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422676868] [2024-11-09 23:03:47,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422676868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:47,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:47,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:03:47,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136382316] [2024-11-09 23:03:47,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:47,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:03:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:47,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:03:47,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:03:47,978 INFO L87 Difference]: Start difference. First operand 384 states and 576 transitions. Second operand has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:49,440 INFO L93 Difference]: Finished difference Result 896 states and 1346 transitions. [2024-11-09 23:03:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:03:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 121 [2024-11-09 23:03:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:49,443 INFO L225 Difference]: With dead ends: 896 [2024-11-09 23:03:49,444 INFO L226 Difference]: Without dead ends: 535 [2024-11-09 23:03:49,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:03:49,445 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1002 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1003 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 2566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:49,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1003 Valid, 1187 Invalid, 2566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:03:49,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2024-11-09 23:03:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 384. [2024-11-09 23:03:49,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 306 states have (on average 1.4901960784313726) internal successors, (456), 309 states have internal predecessors, (456), 57 states have call successors, (57), 18 states have call predecessors, (57), 20 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2024-11-09 23:03:49,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 575 transitions. [2024-11-09 23:03:49,473 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 575 transitions. Word has length 121 [2024-11-09 23:03:49,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:49,473 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 575 transitions. [2024-11-09 23:03:49,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.875) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 575 transitions. [2024-11-09 23:03:49,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 23:03:49,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:49,476 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:49,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 23:03:49,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:49,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:49,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1994175324, now seen corresponding path program 2 times [2024-11-09 23:03:49,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:49,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064151521] [2024-11-09 23:03:49,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:49,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:49,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:49,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-09 23:03:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-09 23:03:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 23:03:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:03:49,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:03:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:03:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:03:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:03:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:03:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:03:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:49,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064151521] [2024-11-09 23:03:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064151521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:03:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940546412] [2024-11-09 23:03:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:49,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:03:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:49,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:03:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:03:49,617 INFO L87 Difference]: Start difference. First operand 384 states and 575 transitions. Second operand has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:51,069 INFO L93 Difference]: Finished difference Result 898 states and 1349 transitions. [2024-11-09 23:03:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 23:03:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2024-11-09 23:03:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:51,072 INFO L225 Difference]: With dead ends: 898 [2024-11-09 23:03:51,072 INFO L226 Difference]: Without dead ends: 537 [2024-11-09 23:03:51,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:03:51,074 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 997 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:51,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1186 Invalid, 2599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:03:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-09 23:03:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2024-11-09 23:03:51,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 307 states have (on average 1.488599348534202) internal successors, (457), 311 states have internal predecessors, (457), 57 states have call successors, (57), 18 states have call predecessors, (57), 21 states have return successors, (64), 56 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-09 23:03:51,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2024-11-09 23:03:51,092 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 578 transitions. Word has length 122 [2024-11-09 23:03:51,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:51,093 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-11-09 23:03:51,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:51,093 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 578 transitions. [2024-11-09 23:03:51,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:03:51,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:51,094 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, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:51,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 23:03:51,095 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:51,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:51,095 INFO L85 PathProgramCache]: Analyzing trace with hash 650685333, now seen corresponding path program 1 times [2024-11-09 23:03:51,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:51,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476792705] [2024-11-09 23:03:51,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:51,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:51,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:03:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:03:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:03:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:03:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:03:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:03:51,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:03:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:03:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:03:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:51,243 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-09 23:03:51,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:51,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476792705] [2024-11-09 23:03:51,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476792705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:51,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:51,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:03:51,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485814761] [2024-11-09 23:03:51,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:51,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:03:51,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:51,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:03:51,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:03:51,244 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:52,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:52,661 INFO L93 Difference]: Finished difference Result 898 states and 1348 transitions. [2024-11-09 23:03:52,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:03:52,661 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2024-11-09 23:03:52,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:52,664 INFO L225 Difference]: With dead ends: 898 [2024-11-09 23:03:52,664 INFO L226 Difference]: Without dead ends: 537 [2024-11-09 23:03:52,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 23:03:52,666 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 998 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 2294 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 999 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 2586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 2294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:52,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [999 Valid, 1183 Invalid, 2586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 2294 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 23:03:52,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-09 23:03:52,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2024-11-09 23:03:52,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 307 states have (on average 1.488599348534202) internal successors, (457), 311 states have internal predecessors, (457), 57 states have call successors, (57), 18 states have call predecessors, (57), 21 states have return successors, (64), 56 states have call predecessors, (64), 56 states have call successors, (64) [2024-11-09 23:03:52,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 578 transitions. [2024-11-09 23:03:52,697 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 578 transitions. Word has length 123 [2024-11-09 23:03:52,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:52,697 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 578 transitions. [2024-11-09 23:03:52,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-09 23:03:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 578 transitions. [2024-11-09 23:03:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 23:03:52,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:52,700 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, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:52,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 23:03:52,700 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:52,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1203660204, now seen corresponding path program 1 times [2024-11-09 23:03:52,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456229326] [2024-11-09 23:03:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:52,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:03:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-09 23:03:52,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-09 23:03:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:03:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:03:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-09 23:03:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:03:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:03:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:03:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:03:52,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:52,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456229326] [2024-11-09 23:03:52,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456229326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:52,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:52,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:03:52,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887090573] [2024-11-09 23:03:52,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:52,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:03:52,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:52,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:03:52,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:03:52,915 INFO L87 Difference]: Start difference. First operand 386 states and 578 transitions. Second operand has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 23:03:54,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:54,766 INFO L93 Difference]: Finished difference Result 896 states and 1343 transitions. [2024-11-09 23:03:54,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:03:54,767 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 123 [2024-11-09 23:03:54,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:54,769 INFO L225 Difference]: With dead ends: 896 [2024-11-09 23:03:54,769 INFO L226 Difference]: Without dead ends: 537 [2024-11-09 23:03:54,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:03:54,773 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 996 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3812 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 4110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 3812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:54,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 1644 Invalid, 4110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 3812 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 23:03:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-09 23:03:54,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 386. [2024-11-09 23:03:54,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 307 states have (on average 1.488599348534202) internal successors, (457), 311 states have internal predecessors, (457), 57 states have call successors, (57), 18 states have call predecessors, (57), 21 states have return successors, (63), 56 states have call predecessors, (63), 56 states have call successors, (63) [2024-11-09 23:03:54,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 577 transitions. [2024-11-09 23:03:54,795 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 577 transitions. Word has length 123 [2024-11-09 23:03:54,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:54,796 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 577 transitions. [2024-11-09 23:03:54,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.636363636363637) internal successors, (84), 8 states have internal predecessors, (84), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 23:03:54,796 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 577 transitions. [2024-11-09 23:03:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 23:03:54,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:54,797 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:54,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 23:03:54,798 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:54,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:54,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1251755563, now seen corresponding path program 2 times [2024-11-09 23:03:54,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:54,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911082455] [2024-11-09 23:03:54,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:54,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:54,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:03:54,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-09 23:03:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-09 23:03:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:03:55,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:03:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-09 23:03:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:03:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:03:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:03:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-09 23:03:55,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911082455] [2024-11-09 23:03:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911082455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:55,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:55,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 23:03:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655350687] [2024-11-09 23:03:55,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:55,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 23:03:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 23:03:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-09 23:03:55,038 INFO L87 Difference]: Start difference. First operand 386 states and 577 transitions. Second operand has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 23:03:56,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:56,914 INFO L93 Difference]: Finished difference Result 898 states and 1349 transitions. [2024-11-09 23:03:56,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 23:03:56,915 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 124 [2024-11-09 23:03:56,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:56,917 INFO L225 Difference]: With dead ends: 898 [2024-11-09 23:03:56,918 INFO L226 Difference]: Without dead ends: 539 [2024-11-09 23:03:56,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-09 23:03:56,919 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 995 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 3834 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 996 SdHoareTripleChecker+Valid, 1645 SdHoareTripleChecker+Invalid, 4129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 3834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:56,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [996 Valid, 1645 Invalid, 4129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 3834 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 23:03:56,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-09 23:03:56,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 388. [2024-11-09 23:03:56,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 308 states have (on average 1.4870129870129871) internal successors, (458), 313 states have internal predecessors, (458), 57 states have call successors, (57), 18 states have call predecessors, (57), 22 states have return successors, (68), 56 states have call predecessors, (68), 56 states have call successors, (68) [2024-11-09 23:03:56,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 583 transitions. [2024-11-09 23:03:56,941 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 583 transitions. Word has length 124 [2024-11-09 23:03:56,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:56,941 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 583 transitions. [2024-11-09 23:03:56,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.7272727272727275) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-11-09 23:03:56,941 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 583 transitions. [2024-11-09 23:03:56,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 23:03:56,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:56,943 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:56,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 23:03:56,943 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:56,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:56,944 INFO L85 PathProgramCache]: Analyzing trace with hash -543421385, now seen corresponding path program 1 times [2024-11-09 23:03:56,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:56,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322071723] [2024-11-09 23:03:56,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:56,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:57,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:57,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:03:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-09 23:03:57,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-09 23:03:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:03:57,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:03:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 23:03:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:03:57,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:03:57,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:03:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:03:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322071723] [2024-11-09 23:03:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322071723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 23:03:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491551638] [2024-11-09 23:03:57,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:57,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:57,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 23:03:57,149 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 23:03:57,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 23:03:57,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:57,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 23:03:57,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 23:03:57,424 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:03:57,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 23:03:57,563 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:03:57,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491551638] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 23:03:57,563 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 23:03:57,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-09 23:03:57,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439044217] [2024-11-09 23:03:57,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 23:03:57,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 23:03:57,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 23:03:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 23:03:57,564 INFO L87 Difference]: Start difference. First operand 388 states and 583 transitions. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 7 states have internal predecessors, (123), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 23:03:58,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:03:58,854 INFO L93 Difference]: Finished difference Result 1097 states and 1707 transitions. [2024-11-09 23:03:58,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 23:03:58,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 7 states have internal predecessors, (123), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 125 [2024-11-09 23:03:58,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:03:58,859 INFO L225 Difference]: With dead ends: 1097 [2024-11-09 23:03:58,860 INFO L226 Difference]: Without dead ends: 942 [2024-11-09 23:03:58,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:03:58,861 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 1412 mSDsluCounter, 1189 mSDsCounter, 0 mSdLazyCounter, 1918 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 2371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 23:03:58,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 1416 Invalid, 2371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1918 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 23:03:58,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2024-11-09 23:03:58,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 767. [2024-11-09 23:03:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 623 states have (on average 1.5200642054574638) internal successors, (947), 628 states have internal predecessors, (947), 121 states have call successors, (121), 18 states have call predecessors, (121), 22 states have return successors, (142), 120 states have call predecessors, (142), 120 states have call successors, (142) [2024-11-09 23:03:58,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1210 transitions. [2024-11-09 23:03:58,888 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1210 transitions. Word has length 125 [2024-11-09 23:03:58,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:03:58,889 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1210 transitions. [2024-11-09 23:03:58,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 7 states have internal predecessors, (123), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-09 23:03:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1210 transitions. [2024-11-09 23:03:58,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-09 23:03:58,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:03:58,892 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:03:58,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 23:03:59,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 23:03:59,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:03:59,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:03:59,093 INFO L85 PathProgramCache]: Analyzing trace with hash 843713130, now seen corresponding path program 1 times [2024-11-09 23:03:59,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:03:59,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408471569] [2024-11-09 23:03:59,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:03:59,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:03:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:03:59,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:03:59,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:03:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:03:59,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:03:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:03:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 23:03:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:03:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-09 23:03:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:03:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:03:59,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:03:59,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:03:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 23:03:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:03:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:03:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:03:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408471569] [2024-11-09 23:03:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408471569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:03:59,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:03:59,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:03:59,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371865879] [2024-11-09 23:03:59,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:03:59,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:03:59,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:03:59,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:03:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:03:59,168 INFO L87 Difference]: Start difference. First operand 767 states and 1210 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:00,198 INFO L93 Difference]: Finished difference Result 2000 states and 3200 transitions. [2024-11-09 23:04:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:00,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2024-11-09 23:04:00,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:00,204 INFO L225 Difference]: With dead ends: 2000 [2024-11-09 23:04:00,205 INFO L226 Difference]: Without dead ends: 1303 [2024-11-09 23:04:00,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:00,207 INFO L432 NwaCegarLoop]: 200 mSDtfsCounter, 1113 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 1325 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 1672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 1325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:00,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 905 Invalid, 1672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 1325 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:04:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1303 states. [2024-11-09 23:04:00,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1303 to 1144. [2024-11-09 23:04:00,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 936 states have (on average 1.5213675213675213) internal successors, (1424), 941 states have internal predecessors, (1424), 185 states have call successors, (185), 18 states have call predecessors, (185), 22 states have return successors, (216), 184 states have call predecessors, (216), 184 states have call successors, (216) [2024-11-09 23:04:00,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1825 transitions. [2024-11-09 23:04:00,265 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1825 transitions. Word has length 139 [2024-11-09 23:04:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:00,266 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1825 transitions. [2024-11-09 23:04:00,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:00,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1825 transitions. [2024-11-09 23:04:00,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-09 23:04:00,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:00,270 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:00,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 23:04:00,270 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:00,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:00,271 INFO L85 PathProgramCache]: Analyzing trace with hash -937193467, now seen corresponding path program 1 times [2024-11-09 23:04:00,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:00,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591973919] [2024-11-09 23:04:00,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:00,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:00,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-09 23:04:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:04:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-09 23:04:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:04:00,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:04:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:04:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:04:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 23:04:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:00,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591973919] [2024-11-09 23:04:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591973919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057815064] [2024-11-09 23:04:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:00,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:00,394 INFO L87 Difference]: Start difference. First operand 1144 states and 1825 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:01,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:01,540 INFO L93 Difference]: Finished difference Result 2910 states and 4679 transitions. [2024-11-09 23:04:01,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:01,540 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2024-11-09 23:04:01,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:01,547 INFO L225 Difference]: With dead ends: 2910 [2024-11-09 23:04:01,548 INFO L226 Difference]: Without dead ends: 1895 [2024-11-09 23:04:01,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:01,551 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1114 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:01,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 873 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:04:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1895 states. [2024-11-09 23:04:01,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1736. [2024-11-09 23:04:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1736 states, 1433 states have (on average 1.520586182833217) internal successors, (2179), 1438 states have internal predecessors, (2179), 280 states have call successors, (280), 18 states have call predecessors, (280), 22 states have return successors, (311), 279 states have call predecessors, (311), 279 states have call successors, (311) [2024-11-09 23:04:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 2770 transitions. [2024-11-09 23:04:01,597 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 2770 transitions. Word has length 140 [2024-11-09 23:04:01,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:01,598 INFO L471 AbstractCegarLoop]: Abstraction has 1736 states and 2770 transitions. [2024-11-09 23:04:01,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 2770 transitions. [2024-11-09 23:04:01,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-09 23:04:01,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:01,638 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:01,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 23:04:01,638 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1973368010, now seen corresponding path program 1 times [2024-11-09 23:04:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994943508] [2024-11-09 23:04:01,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:01,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-09 23:04:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:04:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-09 23:04:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:04:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:04:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:04:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:04:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 23:04:01,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:01,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:01,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994943508] [2024-11-09 23:04:01,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994943508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:01,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:01,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:01,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776795856] [2024-11-09 23:04:01,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:01,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:01,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:01,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:01,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:01,737 INFO L87 Difference]: Start difference. First operand 1736 states and 2770 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:02,818 INFO L93 Difference]: Finished difference Result 4269 states and 6895 transitions. [2024-11-09 23:04:02,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:02,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2024-11-09 23:04:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:02,828 INFO L225 Difference]: With dead ends: 4269 [2024-11-09 23:04:02,828 INFO L226 Difference]: Without dead ends: 2801 [2024-11-09 23:04:02,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:02,832 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1107 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1287 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1122 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 1639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:02,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1122 Valid, 870 Invalid, 1639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1287 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:04:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2801 states. [2024-11-09 23:04:02,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2801 to 2642. [2024-11-09 23:04:02,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2642 states, 2216 states have (on average 1.519404332129964) internal successors, (3367), 2221 states have internal predecessors, (3367), 403 states have call successors, (403), 18 states have call predecessors, (403), 22 states have return successors, (450), 402 states have call predecessors, (450), 402 states have call successors, (450) [2024-11-09 23:04:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2642 states to 2642 states and 4220 transitions. [2024-11-09 23:04:02,903 INFO L78 Accepts]: Start accepts. Automaton has 2642 states and 4220 transitions. Word has length 141 [2024-11-09 23:04:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:02,903 INFO L471 AbstractCegarLoop]: Abstraction has 2642 states and 4220 transitions. [2024-11-09 23:04:02,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2642 states and 4220 transitions. [2024-11-09 23:04:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-09 23:04:02,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:02,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:02,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 23:04:02,911 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:02,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1106234181, now seen corresponding path program 1 times [2024-11-09 23:04:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162857141] [2024-11-09 23:04:02,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:02,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-09 23:04:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:04:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-09 23:04:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:04:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:04:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:04:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:04:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 23:04:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:03,013 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:03,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:03,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162857141] [2024-11-09 23:04:03,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162857141] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:03,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:03,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:03,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173324932] [2024-11-09 23:04:03,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:03,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:03,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:03,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:03,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:03,014 INFO L87 Difference]: Start difference. First operand 2642 states and 4220 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:04,053 INFO L93 Difference]: Finished difference Result 6405 states and 10371 transitions. [2024-11-09 23:04:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:04,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2024-11-09 23:04:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:04,066 INFO L225 Difference]: With dead ends: 6405 [2024-11-09 23:04:04,066 INFO L226 Difference]: Without dead ends: 4261 [2024-11-09 23:04:04,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:04,072 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1104 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1120 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:04,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1120 Valid, 869 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:04:04,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4261 states. [2024-11-09 23:04:04,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4261 to 4102. [2024-11-09 23:04:04,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 3497 states have (on average 1.517014583929082) internal successors, (5305), 3502 states have internal predecessors, (5305), 582 states have call successors, (582), 18 states have call predecessors, (582), 22 states have return successors, (655), 581 states have call predecessors, (655), 581 states have call successors, (655) [2024-11-09 23:04:04,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 6542 transitions. [2024-11-09 23:04:04,169 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 6542 transitions. Word has length 142 [2024-11-09 23:04:04,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:04,169 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 6542 transitions. [2024-11-09 23:04:04,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 6542 transitions. [2024-11-09 23:04:04,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 23:04:04,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:04,179 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:04,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 23:04:04,179 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:04,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:04,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1481412918, now seen corresponding path program 1 times [2024-11-09 23:04:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:04,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946800621] [2024-11-09 23:04:04,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:04,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:04,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:04,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-09 23:04:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:04:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 23:04:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:04:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:04:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-09 23:04:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-09 23:04:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:04:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:04,283 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:04,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946800621] [2024-11-09 23:04:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946800621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858434716] [2024-11-09 23:04:04,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:04,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:04,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:04,285 INFO L87 Difference]: Start difference. First operand 4102 states and 6542 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:05,383 INFO L93 Difference]: Finished difference Result 9948 states and 16113 transitions. [2024-11-09 23:04:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:05,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 143 [2024-11-09 23:04:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:05,408 INFO L225 Difference]: With dead ends: 9948 [2024-11-09 23:04:05,409 INFO L226 Difference]: Without dead ends: 6698 [2024-11-09 23:04:05,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:05,418 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 1102 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1118 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:05,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1118 Valid, 915 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:04:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6698 states. [2024-11-09 23:04:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6698 to 6539. [2024-11-09 23:04:05,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6539 states, 5558 states have (on average 1.5046779417056495) internal successors, (8363), 5563 states have internal predecessors, (8363), 958 states have call successors, (958), 18 states have call predecessors, (958), 22 states have return successors, (1075), 957 states have call predecessors, (1075), 957 states have call successors, (1075) [2024-11-09 23:04:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6539 states to 6539 states and 10396 transitions. [2024-11-09 23:04:05,636 INFO L78 Accepts]: Start accepts. Automaton has 6539 states and 10396 transitions. Word has length 143 [2024-11-09 23:04:05,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:05,636 INFO L471 AbstractCegarLoop]: Abstraction has 6539 states and 10396 transitions. [2024-11-09 23:04:05,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:05,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6539 states and 10396 transitions. [2024-11-09 23:04:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-09 23:04:05,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:05,651 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:05,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 23:04:05,651 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:05,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:05,652 INFO L85 PathProgramCache]: Analyzing trace with hash 123739653, now seen corresponding path program 1 times [2024-11-09 23:04:05,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:05,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303104496] [2024-11-09 23:04:05,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:05,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:05,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:05,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-09 23:04:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:04:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-09 23:04:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-09 23:04:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-09 23:04:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-09 23:04:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-09 23:04:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-09 23:04:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:05,757 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:05,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:05,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303104496] [2024-11-09 23:04:05,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303104496] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:05,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:05,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:05,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483582874] [2024-11-09 23:04:05,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:05,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:05,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:05,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:05,760 INFO L87 Difference]: Start difference. First operand 6539 states and 10396 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:07,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:07,002 INFO L93 Difference]: Finished difference Result 16371 states and 26420 transitions. [2024-11-09 23:04:07,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:07,002 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2024-11-09 23:04:07,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:07,049 INFO L225 Difference]: With dead ends: 16371 [2024-11-09 23:04:07,050 INFO L226 Difference]: Without dead ends: 11123 [2024-11-09 23:04:07,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:07,065 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1094 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 369 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 369 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:07,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 871 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [369 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 23:04:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11123 states. [2024-11-09 23:04:07,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11123 to 10964. [2024-11-09 23:04:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10964 states, 9377 states have (on average 1.4984536632185135) internal successors, (14051), 9382 states have internal predecessors, (14051), 1564 states have call successors, (1564), 18 states have call predecessors, (1564), 22 states have return successors, (1759), 1563 states have call predecessors, (1759), 1563 states have call successors, (1759) [2024-11-09 23:04:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 17374 transitions. [2024-11-09 23:04:07,410 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 17374 transitions. Word has length 144 [2024-11-09 23:04:07,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:07,411 INFO L471 AbstractCegarLoop]: Abstraction has 10964 states and 17374 transitions. [2024-11-09 23:04:07,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:07,412 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 17374 transitions. [2024-11-09 23:04:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-09 23:04:07,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:07,430 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:07,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 23:04:07,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:07,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash 919913770, now seen corresponding path program 1 times [2024-11-09 23:04:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:07,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091701243] [2024-11-09 23:04:07,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:07,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:07,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 23:04:07,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-09 23:04:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-09 23:04:07,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-09 23:04:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-09 23:04:07,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-09 23:04:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-09 23:04:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-09 23:04:07,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:07,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:07,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091701243] [2024-11-09 23:04:07,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091701243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:07,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:07,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:07,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817542775] [2024-11-09 23:04:07,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:07,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:07,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:07,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:07,544 INFO L87 Difference]: Start difference. First operand 10964 states and 17374 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:08,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:08,924 INFO L93 Difference]: Finished difference Result 28610 states and 46021 transitions. [2024-11-09 23:04:08,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:08,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 145 [2024-11-09 23:04:08,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:08,989 INFO L225 Difference]: With dead ends: 28610 [2024-11-09 23:04:08,989 INFO L226 Difference]: Without dead ends: 19475 [2024-11-09 23:04:09,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:09,010 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1092 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1302 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 1302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:09,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 901 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 1302 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:04:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19475 states. [2024-11-09 23:04:09,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19475 to 19316. [2024-11-09 23:04:09,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19316 states, 16526 states have (on average 1.4880793900520393) internal successors, (24592), 16531 states have internal predecessors, (24592), 2767 states have call successors, (2767), 18 states have call predecessors, (2767), 22 states have return successors, (3106), 2766 states have call predecessors, (3106), 2766 states have call successors, (3106) [2024-11-09 23:04:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19316 states to 19316 states and 30465 transitions. [2024-11-09 23:04:09,588 INFO L78 Accepts]: Start accepts. Automaton has 19316 states and 30465 transitions. Word has length 145 [2024-11-09 23:04:09,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:09,588 INFO L471 AbstractCegarLoop]: Abstraction has 19316 states and 30465 transitions. [2024-11-09 23:04:09,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:09,588 INFO L276 IsEmpty]: Start isEmpty. Operand 19316 states and 30465 transitions. [2024-11-09 23:04:09,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-09 23:04:09,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:09,608 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:09,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 23:04:09,608 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:09,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:09,609 INFO L85 PathProgramCache]: Analyzing trace with hash 41915909, now seen corresponding path program 1 times [2024-11-09 23:04:09,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:09,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204702566] [2024-11-09 23:04:09,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:09,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:09,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:09,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 23:04:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 23:04:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-09 23:04:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-09 23:04:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-09 23:04:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-09 23:04:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-09 23:04:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-09 23:04:09,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:09,681 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204702566] [2024-11-09 23:04:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204702566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310928438] [2024-11-09 23:04:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:09,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:09,682 INFO L87 Difference]: Start difference. First operand 19316 states and 30465 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:11,234 INFO L93 Difference]: Finished difference Result 51558 states and 82602 transitions. [2024-11-09 23:04:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 146 [2024-11-09 23:04:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:11,316 INFO L225 Difference]: With dead ends: 51558 [2024-11-09 23:04:11,316 INFO L226 Difference]: Without dead ends: 34827 [2024-11-09 23:04:11,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:11,340 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1092 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:11,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 871 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:04:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34827 states. [2024-11-09 23:04:12,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34827 to 34668. [2024-11-09 23:04:12,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34668 states, 29839 states have (on average 1.4810482925030999) internal successors, (44193), 29844 states have internal predecessors, (44193), 4806 states have call successors, (4806), 18 states have call predecessors, (4806), 22 states have return successors, (5419), 4805 states have call predecessors, (5419), 4805 states have call successors, (5419) [2024-11-09 23:04:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34668 states to 34668 states and 54418 transitions. [2024-11-09 23:04:12,387 INFO L78 Accepts]: Start accepts. Automaton has 34668 states and 54418 transitions. Word has length 146 [2024-11-09 23:04:12,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:12,388 INFO L471 AbstractCegarLoop]: Abstraction has 34668 states and 54418 transitions. [2024-11-09 23:04:12,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:12,388 INFO L276 IsEmpty]: Start isEmpty. Operand 34668 states and 54418 transitions. [2024-11-09 23:04:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-09 23:04:12,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:12,418 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:12,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 23:04:12,418 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:12,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:12,419 INFO L85 PathProgramCache]: Analyzing trace with hash 929022890, now seen corresponding path program 1 times [2024-11-09 23:04:12,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:12,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063200783] [2024-11-09 23:04:12,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:12,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-09 23:04:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-09 23:04:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-09 23:04:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-09 23:04:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-09 23:04:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-09 23:04:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-09 23:04:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-09 23:04:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:12,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:12,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:12,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063200783] [2024-11-09 23:04:12,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063200783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:12,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:12,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:12,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800209908] [2024-11-09 23:04:12,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:12,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:12,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:12,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:12,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:12,570 INFO L87 Difference]: Start difference. First operand 34668 states and 54418 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:15,254 INFO L93 Difference]: Finished difference Result 95147 states and 151188 transitions. [2024-11-09 23:04:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:15,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2024-11-09 23:04:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:15,483 INFO L225 Difference]: With dead ends: 95147 [2024-11-09 23:04:15,483 INFO L226 Difference]: Without dead ends: 63982 [2024-11-09 23:04:15,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:15,767 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 1091 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:15,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 877 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:04:15,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63982 states. [2024-11-09 23:04:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63982 to 63823. [2024-11-09 23:04:17,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63823 states, 55279 states have (on average 1.4732176775990882) internal successors, (81438), 55284 states have internal predecessors, (81438), 8521 states have call successors, (8521), 18 states have call predecessors, (8521), 22 states have return successors, (9666), 8520 states have call predecessors, (9666), 8520 states have call successors, (9666) [2024-11-09 23:04:17,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63823 states to 63823 states and 99625 transitions. [2024-11-09 23:04:17,846 INFO L78 Accepts]: Start accepts. Automaton has 63823 states and 99625 transitions. Word has length 147 [2024-11-09 23:04:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:17,847 INFO L471 AbstractCegarLoop]: Abstraction has 63823 states and 99625 transitions. [2024-11-09 23:04:17,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 63823 states and 99625 transitions. [2024-11-09 23:04:17,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-09 23:04:17,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:17,876 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:17,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 23:04:17,877 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:17,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:17,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1674591835, now seen corresponding path program 1 times [2024-11-09 23:04:17,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:17,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295302147] [2024-11-09 23:04:17,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:17,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:17,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-09 23:04:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-09 23:04:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-09 23:04:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-09 23:04:17,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-09 23:04:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:04:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-09 23:04:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-09 23:04:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:17,989 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:17,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:17,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295302147] [2024-11-09 23:04:17,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295302147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:17,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:17,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:17,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330937435] [2024-11-09 23:04:17,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:17,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:17,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:17,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:17,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:17,991 INFO L87 Difference]: Start difference. First operand 63823 states and 99625 transitions. Second operand has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:21,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:21,000 INFO L93 Difference]: Finished difference Result 120011 states and 190468 transitions. [2024-11-09 23:04:21,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:21,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148 [2024-11-09 23:04:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:21,392 INFO L225 Difference]: With dead ends: 120011 [2024-11-09 23:04:21,392 INFO L226 Difference]: Without dead ends: 119856 [2024-11-09 23:04:21,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:21,440 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1083 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1097 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:21,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1097 Valid, 872 Invalid, 1640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 23:04:21,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119856 states. [2024-11-09 23:04:24,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119856 to 119697. [2024-11-09 23:04:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119697 states, 104354 states have (on average 1.4644671023631102) internal successors, (152823), 104359 states have internal predecessors, (152823), 15320 states have call successors, (15320), 18 states have call predecessors, (15320), 22 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2024-11-09 23:04:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119697 states to 119697 states and 185654 transitions. [2024-11-09 23:04:25,307 INFO L78 Accepts]: Start accepts. Automaton has 119697 states and 185654 transitions. Word has length 148 [2024-11-09 23:04:25,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:25,308 INFO L471 AbstractCegarLoop]: Abstraction has 119697 states and 185654 transitions. [2024-11-09 23:04:25,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:25,308 INFO L276 IsEmpty]: Start isEmpty. Operand 119697 states and 185654 transitions. [2024-11-09 23:04:25,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 23:04:25,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:25,374 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:25,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 23:04:25,374 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:25,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:25,375 INFO L85 PathProgramCache]: Analyzing trace with hash 442187804, now seen corresponding path program 2 times [2024-11-09 23:04:25,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:25,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896548685] [2024-11-09 23:04:25,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:25,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:04:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:04:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:04:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:04:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:04:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:04:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:04:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 23:04:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:25,453 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-09 23:04:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:25,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896548685] [2024-11-09 23:04:25,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896548685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:25,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:25,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 23:04:25,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332510276] [2024-11-09 23:04:25,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:25,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 23:04:25,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:25,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 23:04:25,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 23:04:25,455 INFO L87 Difference]: Start difference. First operand 119697 states and 185654 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:29,180 INFO L93 Difference]: Finished difference Result 233847 states and 366219 transitions. [2024-11-09 23:04:29,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 23:04:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 149 [2024-11-09 23:04:29,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:29,543 INFO L225 Difference]: With dead ends: 233847 [2024-11-09 23:04:29,543 INFO L226 Difference]: Without dead ends: 119856 [2024-11-09 23:04:29,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-09 23:04:29,996 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 1118 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1327 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:29,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 1448 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1327 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 23:04:30,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119856 states. [2024-11-09 23:04:32,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119856 to 119697. [2024-11-09 23:04:33,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119697 states, 104354 states have (on average 1.4545393564214117) internal successors, (151787), 104359 states have internal predecessors, (151787), 15320 states have call successors, (15320), 18 states have call predecessors, (15320), 22 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2024-11-09 23:04:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119697 states to 119697 states and 184618 transitions. [2024-11-09 23:04:33,372 INFO L78 Accepts]: Start accepts. Automaton has 119697 states and 184618 transitions. Word has length 149 [2024-11-09 23:04:33,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:33,373 INFO L471 AbstractCegarLoop]: Abstraction has 119697 states and 184618 transitions. [2024-11-09 23:04:33,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:33,374 INFO L276 IsEmpty]: Start isEmpty. Operand 119697 states and 184618 transitions. [2024-11-09 23:04:33,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 23:04:33,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:33,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:33,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 23:04:33,399 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:33,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:33,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1995968982, now seen corresponding path program 1 times [2024-11-09 23:04:33,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:33,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794215524] [2024-11-09 23:04:33,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:33,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:33,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:33,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:04:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:04:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:04:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:04:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:04:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-09 23:04:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:04:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-09 23:04:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:33,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794215524] [2024-11-09 23:04:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794215524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:33,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 23:04:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759360549] [2024-11-09 23:04:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 23:04:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:33,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 23:04:33,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 23:04:33,514 INFO L87 Difference]: Start difference. First operand 119697 states and 184618 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:36,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:36,682 INFO L93 Difference]: Finished difference Result 119995 states and 188321 transitions. [2024-11-09 23:04:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 23:04:36,683 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 149 [2024-11-09 23:04:36,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:37,120 INFO L225 Difference]: With dead ends: 119995 [2024-11-09 23:04:37,120 INFO L226 Difference]: Without dead ends: 119848 [2024-11-09 23:04:37,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2024-11-09 23:04:37,173 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1010 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 2156 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1194 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:37,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1194 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2156 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 23:04:37,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119848 states. [2024-11-09 23:04:39,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119848 to 119697. [2024-11-09 23:04:40,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119697 states, 104354 states have (on average 1.4545297736550586) internal successors, (151786), 104359 states have internal predecessors, (151786), 15320 states have call successors, (15320), 18 states have call predecessors, (15320), 22 states have return successors, (17511), 15319 states have call predecessors, (17511), 15319 states have call successors, (17511) [2024-11-09 23:04:40,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119697 states to 119697 states and 184617 transitions. [2024-11-09 23:04:40,365 INFO L78 Accepts]: Start accepts. Automaton has 119697 states and 184617 transitions. Word has length 149 [2024-11-09 23:04:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:40,367 INFO L471 AbstractCegarLoop]: Abstraction has 119697 states and 184617 transitions. [2024-11-09 23:04:40,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-09 23:04:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 119697 states and 184617 transitions. [2024-11-09 23:04:40,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-09 23:04:40,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:40,403 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:40,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 23:04:40,404 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:40,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 889259357, now seen corresponding path program 1 times [2024-11-09 23:04:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851833648] [2024-11-09 23:04:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:40,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:04:40,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:04:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:04:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:04:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:04:40,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:04:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:04:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:41,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-11-09 23:04:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:41,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-09 23:04:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:41,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:41,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851833648] [2024-11-09 23:04:41,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851833648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:41,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:41,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 23:04:41,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378504846] [2024-11-09 23:04:41,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 23:04:41,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 23:04:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 23:04:41,009 INFO L87 Difference]: Start difference. First operand 119697 states and 184617 transitions. Second operand has 10 states, 10 states have (on average 11.1) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 23:04:44,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:44,883 INFO L93 Difference]: Finished difference Result 120285 states and 188737 transitions. [2024-11-09 23:04:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 23:04:44,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 156 [2024-11-09 23:04:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:45,252 INFO L225 Difference]: With dead ends: 120285 [2024-11-09 23:04:45,252 INFO L226 Difference]: Without dead ends: 120138 [2024-11-09 23:04:45,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=184, Invalid=466, Unknown=0, NotChecked=0, Total=650 [2024-11-09 23:04:45,293 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 1860 mSDsluCounter, 990 mSDsCounter, 0 mSdLazyCounter, 3453 mSolverCounterSat, 435 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1874 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 3888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 435 IncrementalHoareTripleChecker+Valid, 3453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:45,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1874 Valid, 1178 Invalid, 3888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [435 Valid, 3453 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 23:04:45,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120138 states. [2024-11-09 23:04:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120138 to 119845. [2024-11-09 23:04:48,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119845 states, 104472 states have (on average 1.4544949843020138) internal successors, (151954), 104477 states have internal predecessors, (151954), 15338 states have call successors, (15338), 28 states have call predecessors, (15338), 34 states have return successors, (17532), 15339 states have call predecessors, (17532), 15336 states have call successors, (17532) [2024-11-09 23:04:49,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119845 states to 119845 states and 184824 transitions. [2024-11-09 23:04:49,042 INFO L78 Accepts]: Start accepts. Automaton has 119845 states and 184824 transitions. Word has length 156 [2024-11-09 23:04:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 23:04:49,044 INFO L471 AbstractCegarLoop]: Abstraction has 119845 states and 184824 transitions. [2024-11-09 23:04:49,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.1) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-09 23:04:49,044 INFO L276 IsEmpty]: Start isEmpty. Operand 119845 states and 184824 transitions. [2024-11-09 23:04:49,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-09 23:04:49,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 23:04:49,107 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 23:04:49,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 23:04:49,107 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 23:04:49,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 23:04:49,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1222448210, now seen corresponding path program 1 times [2024-11-09 23:04:49,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 23:04:49,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720020131] [2024-11-09 23:04:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 23:04:49,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 23:04:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-09 23:04:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 23:04:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-09 23:04:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 23:04:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 23:04:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 23:04:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-09 23:04:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-09 23:04:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 23:04:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 23:04:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-09 23:04:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:49,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-09 23:04:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:50,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-09 23:04:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:50,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-09 23:04:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:50,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-09 23:04:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 23:04:50,028 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-09 23:04:50,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 23:04:50,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720020131] [2024-11-09 23:04:50,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720020131] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 23:04:50,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 23:04:50,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 23:04:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270277363] [2024-11-09 23:04:50,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 23:04:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 23:04:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 23:04:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 23:04:50,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2024-11-09 23:04:50,030 INFO L87 Difference]: Start difference. First operand 119845 states and 184824 transitions. Second operand has 17 states, 15 states have (on average 7.466666666666667) internal successors, (112), 12 states have internal predecessors, (112), 8 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2024-11-09 23:04:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 23:04:55,202 INFO L93 Difference]: Finished difference Result 120779 states and 189447 transitions. [2024-11-09 23:04:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-09 23:04:55,203 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.466666666666667) internal successors, (112), 12 states have internal predecessors, (112), 8 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 157 [2024-11-09 23:04:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 23:04:55,556 INFO L225 Difference]: With dead ends: 120779 [2024-11-09 23:04:55,556 INFO L226 Difference]: Without dead ends: 120228 [2024-11-09 23:04:55,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=2142, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 23:04:55,600 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1484 mSDsluCounter, 2262 mSDsCounter, 0 mSdLazyCounter, 7724 mSolverCounterSat, 458 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1484 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 8182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 458 IncrementalHoareTripleChecker+Valid, 7724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-09 23:04:55,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1484 Valid, 2451 Invalid, 8182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [458 Valid, 7724 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-09 23:04:55,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120228 states. [2024-11-09 23:04:58,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120228 to 119900. [2024-11-09 23:04:58,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119900 states, 104514 states have (on average 1.4544749985647856) internal successors, (152013), 104522 states have internal predecessors, (152013), 15349 states have call successors, (15349), 29 states have call predecessors, (15349), 36 states have return successors, (17545), 15348 states have call predecessors, (17545), 15347 states have call successors, (17545)