./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product30.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f 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_spec8_product30.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 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:49:07,078 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:49:07,137 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:49:07,142 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:49:07,143 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:49:07,166 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:49:07,167 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:49:07,167 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:49:07,168 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:49:07,169 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:49:07,170 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:49:07,170 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:49:07,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:49:07,172 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:49:07,172 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:49:07,173 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:49:07,173 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:49:07,173 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:49:07,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:49:07,174 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:49:07,174 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:49:07,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:49:07,177 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:49:07,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:49:07,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:49:07,178 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:49:07,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:49:07,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:49:07,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:49:07,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:49:07,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:49:07,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:49:07,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:07,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:49:07,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:49:07,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:49:07,182 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:49:07,182 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 -> 15275a4436f6ed835fc824ec788a3589ee34ef53cd98082c25cb994e481acd9a [2024-11-11 20:49:07,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:49:07,417 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:49:07,423 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:49:07,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:49:07,427 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:49:07,427 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2024-11-11 20:49:08,928 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:49:09,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:49:09,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product30.cil.c [2024-11-11 20:49:09,471 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb9d7378/d913de6d1bf64efea97f07efbc562acc/FLAG36b3333ce [2024-11-11 20:49:09,521 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cb9d7378/d913de6d1bf64efea97f07efbc562acc [2024-11-11 20:49:09,524 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:49:09,525 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:49:09,528 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:09,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:49:09,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:49:09,535 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:09" (1/1) ... [2024-11-11 20:49:09,537 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a643a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:09, skipping insertion in model container [2024-11-11 20:49:09,537 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:49:09" (1/1) ... [2024-11-11 20:49:09,676 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:49:10,140 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_spec8_product30.cil.c[7858,7871] [2024-11-11 20:49:10,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:10,534 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:49:10,542 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2024-11-11 20:49:10,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [363] [2024-11-11 20:49:10,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [407] [2024-11-11 20:49:10,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [416] [2024-11-11 20:49:10,543 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [563] [2024-11-11 20:49:10,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [598] [2024-11-11 20:49:10,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [964] [2024-11-11 20:49:10,544 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1180] [2024-11-11 20:49:10,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1545] [2024-11-11 20:49:10,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2024-11-11 20:49:10,545 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2629] [2024-11-11 20:49:10,566 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_spec8_product30.cil.c[7858,7871] [2024-11-11 20:49:10,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:49:10,647 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:49:10,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10 WrapperNode [2024-11-11 20:49:10,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:49:10,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:10,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:49:10,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:49:10,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,711 INFO L138 Inliner]: procedures = 132, calls = 207, calls flagged for inlining = 61, calls inlined = 51, statements flattened = 925 [2024-11-11 20:49:10,712 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:49:10,712 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:49:10,712 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:49:10,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:49:10,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,722 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,726 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,743 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-11 20:49:10,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,743 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,762 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,764 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:49:10,769 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:49:10,769 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:49:10,770 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:49:10,770 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (1/1) ... [2024-11-11 20:49:10,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:49:10,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:10,800 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-11 20:49:10,802 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-11 20:49:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:49:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:49:10,840 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:49:10,840 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:49:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:49:10,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:49:10,841 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:49:10,841 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:49:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:49:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:49:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:49:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:49:10,842 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:49:10,842 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:49:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:49:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:49:10,843 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:49:10,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:49:10,844 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:49:10,844 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:49:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:49:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:49:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:49:10,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:49:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:49:10,845 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:49:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:49:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:49:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:49:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:49:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:49:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:49:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:49:10,846 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:49:10,846 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:49:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:49:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:49:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:49:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:49:10,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:49:10,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:49:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:49:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:49:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:49:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:49:10,848 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:49:10,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:49:10,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:49:11,052 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:49:11,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:49:11,791 INFO L? ?]: Removed 432 outVars from TransFormulas that were not future-live. [2024-11-11 20:49:11,791 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:49:11,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:49:11,807 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:49:11,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:11 BoogieIcfgContainer [2024-11-11 20:49:11,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:49:11,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:49:11,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:49:11,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:49:11,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:49:09" (1/3) ... [2024-11-11 20:49:11,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5271a803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:11, skipping insertion in model container [2024-11-11 20:49:11,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:49:10" (2/3) ... [2024-11-11 20:49:11,813 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5271a803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:49:11, skipping insertion in model container [2024-11-11 20:49:11,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:49:11" (3/3) ... [2024-11-11 20:49:11,814 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec8_product30.cil.c [2024-11-11 20:49:11,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:49:11,827 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:49:11,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:49:11,893 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;@5c24f5c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:49:11,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:49:11,898 INFO L276 IsEmpty]: Start isEmpty. Operand has 348 states, 270 states have (on average 1.5148148148148148) internal successors, (409), 274 states have internal predecessors, (409), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-11 20:49:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-11 20:49:11,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:11,911 INFO L218 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] [2024-11-11 20:49:11,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:11,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:11,916 INFO L85 PathProgramCache]: Analyzing trace with hash 2031054471, now seen corresponding path program 1 times [2024-11-11 20:49:11,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:11,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637308845] [2024-11-11 20:49:11,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:11,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:12,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:49:12,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:49:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:12,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:12,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,549 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-11 20:49:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:12,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637308845] [2024-11-11 20:49:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637308845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456906305] [2024-11-11 20:49:12,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:12,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:12,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:12,557 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-11 20:49:12,559 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-11 20:49:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:12,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:49:12,933 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:12,949 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-11 20:49:12,950 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456906305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:49:12,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331850047] [2024-11-11 20:49:12,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:12,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:49:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:12,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:49:12,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:12,979 INFO L87 Difference]: Start difference. First operand has 348 states, 270 states have (on average 1.5148148148148148) internal successors, (409), 274 states have internal predecessors, (409), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:13,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:13,028 INFO L93 Difference]: Finished difference Result 542 states and 784 transitions. [2024-11-11 20:49:13,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:49:13,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2024-11-11 20:49:13,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:13,046 INFO L225 Difference]: With dead ends: 542 [2024-11-11 20:49:13,046 INFO L226 Difference]: Without dead ends: 341 [2024-11-11 20:49:13,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 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-11 20:49:13,053 INFO L435 NwaCegarLoop]: 511 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, 511 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-11 20:49:13,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:13,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-11 20:49:13,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2024-11-11 20:49:13,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 264 states have (on average 1.5075757575757576) internal successors, (398), 267 states have internal predecessors, (398), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-11 20:49:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 503 transitions. [2024-11-11 20:49:13,105 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 503 transitions. Word has length 101 [2024-11-11 20:49:13,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:13,106 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 503 transitions. [2024-11-11 20:49:13,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:13,107 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 503 transitions. [2024-11-11 20:49:13,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-11 20:49:13,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:13,111 INFO L218 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] [2024-11-11 20:49:13,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:49:13,312 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-11 20:49:13,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash -574775984, now seen corresponding path program 1 times [2024-11-11 20:49:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661095074] [2024-11-11 20:49:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:13,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:13,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:49:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:49:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,677 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-11 20:49:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661095074] [2024-11-11 20:49:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661095074] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537243764] [2024-11-11 20:49:13,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:13,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:13,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:13,683 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-11 20:49:13,685 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-11 20:49:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:13,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:49:13,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:13,943 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-11 20:49:13,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:13,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537243764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:13,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:13,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427329924] [2024-11-11 20:49:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:13,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:13,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:13,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:13,952 INFO L87 Difference]: Start difference. First operand 341 states and 503 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:13,996 INFO L93 Difference]: Finished difference Result 532 states and 765 transitions. [2024-11-11 20:49:13,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:13,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2024-11-11 20:49:13,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:13,999 INFO L225 Difference]: With dead ends: 532 [2024-11-11 20:49:13,999 INFO L226 Difference]: Without dead ends: 344 [2024-11-11 20:49:14,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 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-11 20:49:14,002 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 1 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:14,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1000 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-11-11 20:49:14,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 343. [2024-11-11 20:49:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 266 states have (on average 1.5037593984962405) internal successors, (400), 269 states have internal predecessors, (400), 53 states have call successors, (53), 23 states have call predecessors, (53), 23 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-11 20:49:14,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 505 transitions. [2024-11-11 20:49:14,020 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 505 transitions. Word has length 102 [2024-11-11 20:49:14,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:14,020 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 505 transitions. [2024-11-11 20:49:14,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:14,020 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 505 transitions. [2024-11-11 20:49:14,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:49:14,023 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:14,024 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:14,038 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:49:14,224 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-11 20:49:14,225 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:14,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:14,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1701758514, now seen corresponding path program 1 times [2024-11-11 20:49:14,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:14,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515583147] [2024-11-11 20:49:14,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:14,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:49:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,467 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:14,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515583147] [2024-11-11 20:49:14,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515583147] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:14,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967525706] [2024-11-11 20:49:14,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:14,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:14,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:14,469 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-11 20:49:14,471 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-11 20:49:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:14,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 1049 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:14,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:49:14,707 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:14,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967525706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:14,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:14,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:49:14,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835129042] [2024-11-11 20:49:14,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:14,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:49:14,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:14,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:49:14,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:49:14,709 INFO L87 Difference]: Start difference. First operand 343 states and 505 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:14,737 INFO L93 Difference]: Finished difference Result 716 states and 1069 transitions. [2024-11-11 20:49:14,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:49:14,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2024-11-11 20:49:14,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:14,742 INFO L225 Difference]: With dead ends: 716 [2024-11-11 20:49:14,742 INFO L226 Difference]: Without dead ends: 400 [2024-11-11 20:49:14,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 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-11 20:49:14,743 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 107 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 972 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-11 20:49:14,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 972 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:14,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-11 20:49:14,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2024-11-11 20:49:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 304 states have (on average 1.519736842105263) internal successors, (462), 307 states have internal predecessors, (462), 64 states have call successors, (64), 23 states have call predecessors, (64), 23 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2024-11-11 20:49:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 589 transitions. [2024-11-11 20:49:14,762 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 589 transitions. Word has length 111 [2024-11-11 20:49:14,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:14,762 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 589 transitions. [2024-11-11 20:49:14,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 589 transitions. [2024-11-11 20:49:14,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:49:14,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:14,765 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:14,784 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-11 20:49:14,966 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-11 20:49:14,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:14,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:14,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1695941731, now seen corresponding path program 1 times [2024-11-11 20:49:14,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:14,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997525851] [2024-11-11 20:49:14,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:14,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:15,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:49:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:49:15,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:49:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:49:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:49:15,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:49:15,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,136 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:15,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997525851] [2024-11-11 20:49:15,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997525851] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:15,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100806913] [2024-11-11 20:49:15,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:15,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:15,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:15,138 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-11 20:49:15,142 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-11 20:49:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:49:15,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:15,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:49:15,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:15,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100806913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:15,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:15,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:49:15,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443004381] [2024-11-11 20:49:15,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:15,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:15,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:15,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:15,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:15,448 INFO L87 Difference]: Start difference. First operand 392 states and 589 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:15,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:15,490 INFO L93 Difference]: Finished difference Result 775 states and 1168 transitions. [2024-11-11 20:49:15,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:15,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2024-11-11 20:49:15,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:15,493 INFO L225 Difference]: With dead ends: 775 [2024-11-11 20:49:15,493 INFO L226 Difference]: Without dead ends: 394 [2024-11-11 20:49:15,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 131 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-11 20:49:15,495 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 2 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1969 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-11 20:49:15,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1969 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-11 20:49:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-11 20:49:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 305 states have (on average 1.518032786885246) internal successors, (463), 309 states have internal predecessors, (463), 64 states have call successors, (64), 23 states have call predecessors, (64), 24 states have return successors, (65), 63 states have call predecessors, (65), 63 states have call successors, (65) [2024-11-11 20:49:15,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 592 transitions. [2024-11-11 20:49:15,518 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 592 transitions. Word has length 112 [2024-11-11 20:49:15,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:15,519 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 592 transitions. [2024-11-11 20:49:15,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:15,519 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 592 transitions. [2024-11-11 20:49:15,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:49:15,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:15,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:15,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 20:49:15,721 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-11 20:49:15,722 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:15,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:15,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1112941486, now seen corresponding path program 1 times [2024-11-11 20:49:15,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:15,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100062963] [2024-11-11 20:49:15,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:15,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:15,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:15,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:49:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:49:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:49:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:49:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:15,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:15,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100062963] [2024-11-11 20:49:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100062963] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743613508] [2024-11-11 20:49:15,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:15,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:15,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:15,919 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-11 20:49:15,920 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-11 20:49:16,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:49:16,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:16,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:49:16,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:49:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743613508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:16,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:49:16,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:49:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751587001] [2024-11-11 20:49:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:16,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:49:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:49:16,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:16,193 INFO L87 Difference]: Start difference. First operand 394 states and 592 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:16,248 INFO L93 Difference]: Finished difference Result 777 states and 1173 transitions. [2024-11-11 20:49:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:49:16,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2024-11-11 20:49:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:16,251 INFO L225 Difference]: With dead ends: 777 [2024-11-11 20:49:16,251 INFO L226 Difference]: Without dead ends: 396 [2024-11-11 20:49:16,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:16,253 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 2 mSDsluCounter, 1462 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1955 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.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:16,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1955 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:49:16,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-11 20:49:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-11 20:49:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 311 states have internal predecessors, (464), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-11-11 20:49:16,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 598 transitions. [2024-11-11 20:49:16,269 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 598 transitions. Word has length 113 [2024-11-11 20:49:16,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:16,269 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 598 transitions. [2024-11-11 20:49:16,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:16,270 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 598 transitions. [2024-11-11 20:49:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:49:16,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:16,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:16,285 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-11 20:49:16,475 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-11 20:49:16,476 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:16,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1060391108, now seen corresponding path program 1 times [2024-11-11 20:49:16,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:16,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712844566] [2024-11-11 20:49:16,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:16,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:16,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:16,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:16,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:49:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:49:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:49:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:16,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:16,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:16,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712844566] [2024-11-11 20:49:16,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712844566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:16,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:16,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:16,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582648891] [2024-11-11 20:49:16,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:16,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:16,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:16,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:16,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:16,664 INFO L87 Difference]: Start difference. First operand 396 states and 598 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:18,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:18,366 INFO L93 Difference]: Finished difference Result 885 states and 1338 transitions. [2024-11-11 20:49:18,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:18,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-11 20:49:18,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:18,369 INFO L225 Difference]: With dead ends: 885 [2024-11-11 20:49:18,370 INFO L226 Difference]: Without dead ends: 512 [2024-11-11 20:49:18,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:49:18,371 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1146 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2193 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1147 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:18,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1147 Valid, 1108 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2193 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:49:18,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2024-11-11 20:49:18,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 396. [2024-11-11 20:49:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 306 states have (on average 1.5163398692810457) internal successors, (464), 311 states have internal predecessors, (464), 64 states have call successors, (64), 23 states have call predecessors, (64), 25 states have return successors, (69), 63 states have call predecessors, (69), 63 states have call successors, (69) [2024-11-11 20:49:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 597 transitions. [2024-11-11 20:49:18,394 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 597 transitions. Word has length 114 [2024-11-11 20:49:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:18,395 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 597 transitions. [2024-11-11 20:49:18,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 597 transitions. [2024-11-11 20:49:18,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:49:18,396 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:18,397 INFO L218 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] [2024-11-11 20:49:18,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:49:18,397 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:18,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:18,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1537453393, now seen corresponding path program 2 times [2024-11-11 20:49:18,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:18,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537083129] [2024-11-11 20:49:18,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:18,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:49:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:49:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:49:18,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:18,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:49:18,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:18,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537083129] [2024-11-11 20:49:18,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537083129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:18,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:18,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:49:18,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015589359] [2024-11-11 20:49:18,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:18,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:49:18,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:18,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:49:18,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:49:18,559 INFO L87 Difference]: Start difference. First operand 396 states and 597 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:20,040 INFO L93 Difference]: Finished difference Result 887 states and 1341 transitions. [2024-11-11 20:49:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:49:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-11 20:49:20,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:20,044 INFO L225 Difference]: With dead ends: 887 [2024-11-11 20:49:20,044 INFO L226 Difference]: Without dead ends: 514 [2024-11-11 20:49:20,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 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-11 20:49:20,046 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 1143 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1144 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:20,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1144 Valid, 1108 Invalid, 2565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:49:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-11 20:49:20,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2024-11-11 20:49:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 307 states have (on average 1.514657980456026) internal successors, (465), 313 states have internal predecessors, (465), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (71), 63 states have call predecessors, (71), 63 states have call successors, (71) [2024-11-11 20:49:20,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 600 transitions. [2024-11-11 20:49:20,098 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 600 transitions. Word has length 115 [2024-11-11 20:49:20,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:20,100 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 600 transitions. [2024-11-11 20:49:20,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 6 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-11 20:49:20,100 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 600 transitions. [2024-11-11 20:49:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:49:20,102 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:20,102 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:20,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:49:20,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash -2002771209, now seen corresponding path program 1 times [2024-11-11 20:49:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598549127] [2024-11-11 20:49:20,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:20,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:20,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:20,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:49:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:49:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:20,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:20,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:20,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:49:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:20,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598549127] [2024-11-11 20:49:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598549127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292572847] [2024-11-11 20:49:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:20,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:20,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:20,314 INFO L87 Difference]: Start difference. First operand 398 states and 600 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:22,631 INFO L93 Difference]: Finished difference Result 885 states and 1336 transitions. [2024-11-11 20:49:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:22,632 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 116 [2024-11-11 20:49:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:22,635 INFO L225 Difference]: With dead ends: 885 [2024-11-11 20:49:22,635 INFO L226 Difference]: Without dead ends: 514 [2024-11-11 20:49:22,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:49:22,644 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 1206 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3534 mSolverCounterSat, 365 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 3899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 365 IncrementalHoareTripleChecker+Valid, 3534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:22,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 1535 Invalid, 3899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [365 Valid, 3534 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:49:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-11 20:49:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 398. [2024-11-11 20:49:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 307 states have (on average 1.514657980456026) internal successors, (465), 313 states have internal predecessors, (465), 64 states have call successors, (64), 23 states have call predecessors, (64), 26 states have return successors, (70), 63 states have call predecessors, (70), 63 states have call successors, (70) [2024-11-11 20:49:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 599 transitions. [2024-11-11 20:49:22,674 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 599 transitions. Word has length 116 [2024-11-11 20:49:22,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:22,674 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 599 transitions. [2024-11-11 20:49:22,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:22,674 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 599 transitions. [2024-11-11 20:49:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:49:22,676 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:22,676 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:22,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:49:22,676 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:22,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:22,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1002334185, now seen corresponding path program 2 times [2024-11-11 20:49:22,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:22,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664263980] [2024-11-11 20:49:22,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:22,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:22,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:22,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:22,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:49:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:22,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:22,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:49:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:22,942 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:49:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:22,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664263980] [2024-11-11 20:49:22,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664263980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:22,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:22,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:49:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727717950] [2024-11-11 20:49:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:22,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:49:22,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:49:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:49:22,944 INFO L87 Difference]: Start difference. First operand 398 states and 599 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:24,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:24,959 INFO L93 Difference]: Finished difference Result 887 states and 1342 transitions. [2024-11-11 20:49:24,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:49:24,960 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 117 [2024-11-11 20:49:24,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:24,962 INFO L225 Difference]: With dead ends: 887 [2024-11-11 20:49:24,962 INFO L226 Difference]: Without dead ends: 516 [2024-11-11 20:49:24,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 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-11 20:49:24,965 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1212 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 3519 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 1536 SdHoareTripleChecker+Invalid, 3900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 3519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:24,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 1536 Invalid, 3900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 3519 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:49:24,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-11 20:49:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 400. [2024-11-11 20:49:25,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 308 states have (on average 1.5129870129870129) internal successors, (466), 315 states have internal predecessors, (466), 64 states have call successors, (64), 23 states have call predecessors, (64), 27 states have return successors, (75), 63 states have call predecessors, (75), 63 states have call successors, (75) [2024-11-11 20:49:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 605 transitions. [2024-11-11 20:49:25,017 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 605 transitions. Word has length 117 [2024-11-11 20:49:25,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:25,018 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 605 transitions. [2024-11-11 20:49:25,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (15), 6 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-11 20:49:25,018 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 605 transitions. [2024-11-11 20:49:25,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-11 20:49:25,020 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:25,020 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:25,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:49:25,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:25,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:25,020 INFO L85 PathProgramCache]: Analyzing trace with hash -2130467694, now seen corresponding path program 1 times [2024-11-11 20:49:25,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:25,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190187255] [2024-11-11 20:49:25,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:25,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:25,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:25,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:49:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:49:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:49:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:49:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190187255] [2024-11-11 20:49:25,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190187255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:49:25,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68562884] [2024-11-11 20:49:25,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:25,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:25,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:49:25,297 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-11 20:49:25,298 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-11 20:49:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:25,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:49:25,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:49:25,559 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:25,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:49:25,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:49:25,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68562884] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:49:25,692 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:49:25,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-11 20:49:25,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777684973] [2024-11-11 20:49:25,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:49:25,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:49:25,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:25,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:49:25,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:49:25,697 INFO L87 Difference]: Start difference. First operand 400 states and 605 transitions. Second operand has 15 states, 14 states have (on average 9.642857142857142) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-11 20:49:27,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:27,967 INFO L93 Difference]: Finished difference Result 1237 states and 1974 transitions. [2024-11-11 20:49:27,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:49:27,968 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.642857142857142) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 118 [2024-11-11 20:49:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:27,975 INFO L225 Difference]: With dead ends: 1237 [2024-11-11 20:49:27,975 INFO L226 Difference]: Without dead ends: 868 [2024-11-11 20:49:27,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-11 20:49:27,977 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 2362 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 3872 mSolverCounterSat, 723 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2379 SdHoareTripleChecker+Valid, 1769 SdHoareTripleChecker+Invalid, 4595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 723 IncrementalHoareTripleChecker+Valid, 3872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:27,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2379 Valid, 1769 Invalid, 4595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [723 Valid, 3872 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:49:27,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2024-11-11 20:49:28,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 728. [2024-11-11 20:49:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 572 states have (on average 1.5681818181818181) internal successors, (897), 579 states have internal predecessors, (897), 128 states have call successors, (128), 23 states have call predecessors, (128), 27 states have return successors, (149), 127 states have call predecessors, (149), 127 states have call successors, (149) [2024-11-11 20:49:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1174 transitions. [2024-11-11 20:49:28,046 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1174 transitions. Word has length 118 [2024-11-11 20:49:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:28,047 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1174 transitions. [2024-11-11 20:49:28,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.642857142857142) internal successors, (135), 11 states have internal predecessors, (135), 4 states have call successors, (31), 6 states have call predecessors, (31), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-11 20:49:28,047 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1174 transitions. [2024-11-11 20:49:28,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:49:28,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:28,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:28,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:49:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:49:28,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:28,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2048334358, now seen corresponding path program 1 times [2024-11-11 20:49:28,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:28,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295517749] [2024-11-11 20:49:28,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:28,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:28,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:49:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:28,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:28,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:49:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:49:28,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:28,351 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-11 20:49:28,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:28,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295517749] [2024-11-11 20:49:28,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295517749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:28,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:28,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:28,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756333163] [2024-11-11 20:49:28,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:28,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:28,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:28,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:28,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:28,357 INFO L87 Difference]: Start difference. First operand 728 states and 1174 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:29,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:29,438 INFO L93 Difference]: Finished difference Result 1802 states and 2973 transitions. [2024-11-11 20:49:29,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:29,439 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2024-11-11 20:49:29,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:29,447 INFO L225 Difference]: With dead ends: 1802 [2024-11-11 20:49:29,447 INFO L226 Difference]: Without dead ends: 1152 [2024-11-11 20:49:29,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:29,453 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 1242 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1257 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 405 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:29,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1257 Valid, 844 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [405 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:49:29,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2024-11-11 20:49:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1028. [2024-11-11 20:49:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 808 states have (on average 1.5866336633663367) internal successors, (1282), 815 states have internal predecessors, (1282), 192 states have call successors, (192), 23 states have call predecessors, (192), 27 states have return successors, (223), 191 states have call predecessors, (223), 191 states have call successors, (223) [2024-11-11 20:49:29,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1697 transitions. [2024-11-11 20:49:29,565 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1697 transitions. Word has length 121 [2024-11-11 20:49:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:29,565 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1697 transitions. [2024-11-11 20:49:29,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:29,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1697 transitions. [2024-11-11 20:49:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:49:29,569 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:29,569 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:29,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:49:29,569 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:29,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1488494286, now seen corresponding path program 1 times [2024-11-11 20:49:29,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:29,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558045307] [2024-11-11 20:49:29,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:29,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:29,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:49:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:49:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:49:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:29,674 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-11 20:49:29,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:29,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558045307] [2024-11-11 20:49:29,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558045307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:29,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:29,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273422509] [2024-11-11 20:49:29,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:29,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:29,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:29,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:29,676 INFO L87 Difference]: Start difference. First operand 1028 states and 1697 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:30,643 INFO L93 Difference]: Finished difference Result 2542 states and 4253 transitions. [2024-11-11 20:49:30,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:30,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2024-11-11 20:49:30,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:30,654 INFO L225 Difference]: With dead ends: 2542 [2024-11-11 20:49:30,654 INFO L226 Difference]: Without dead ends: 1645 [2024-11-11 20:49:30,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:30,657 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1240 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1255 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:30,658 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1255 Valid, 813 Invalid, 1646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:49:30,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1645 states. [2024-11-11 20:49:30,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1645 to 1521. [2024-11-11 20:49:30,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1206 states have (on average 1.5953565505804312) internal successors, (1924), 1213 states have internal predecessors, (1924), 287 states have call successors, (287), 23 states have call predecessors, (287), 27 states have return successors, (318), 286 states have call predecessors, (318), 286 states have call successors, (318) [2024-11-11 20:49:30,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2529 transitions. [2024-11-11 20:49:30,738 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2529 transitions. Word has length 122 [2024-11-11 20:49:30,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:30,738 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2529 transitions. [2024-11-11 20:49:30,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:30,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2529 transitions. [2024-11-11 20:49:30,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:49:30,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:30,743 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:30,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:49:30,744 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:30,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:30,744 INFO L85 PathProgramCache]: Analyzing trace with hash 772478308, now seen corresponding path program 1 times [2024-11-11 20:49:30,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:30,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437285068] [2024-11-11 20:49:30,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:30,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:30,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:30,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:49:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:49:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:30,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:49:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:30,815 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-11 20:49:30,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:30,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437285068] [2024-11-11 20:49:30,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437285068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:30,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:30,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:30,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728254551] [2024-11-11 20:49:30,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:30,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:30,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:30,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:30,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:30,817 INFO L87 Difference]: Start difference. First operand 1521 states and 2529 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:31,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:31,867 INFO L93 Difference]: Finished difference Result 3644 states and 6171 transitions. [2024-11-11 20:49:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:31,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-11-11 20:49:31,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:31,878 INFO L225 Difference]: With dead ends: 3644 [2024-11-11 20:49:31,878 INFO L226 Difference]: Without dead ends: 2389 [2024-11-11 20:49:31,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:31,883 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1253 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1268 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:31,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1268 Valid, 808 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:49:31,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2389 states. [2024-11-11 20:49:31,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2389 to 2265. [2024-11-11 20:49:31,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1827 states have (on average 1.60207991242474) internal successors, (2927), 1834 states have internal predecessors, (2927), 410 states have call successors, (410), 23 states have call predecessors, (410), 27 states have return successors, (457), 409 states have call predecessors, (457), 409 states have call successors, (457) [2024-11-11 20:49:31,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3794 transitions. [2024-11-11 20:49:31,987 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3794 transitions. Word has length 123 [2024-11-11 20:49:31,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:31,988 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3794 transitions. [2024-11-11 20:49:31,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3794 transitions. [2024-11-11 20:49:31,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:49:31,994 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:31,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:31,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:49:31,995 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:31,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:31,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1919292335, now seen corresponding path program 1 times [2024-11-11 20:49:31,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:31,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671620991] [2024-11-11 20:49:31,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:31,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:32,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:49:32,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:32,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:49:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:49:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:32,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:49:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:49:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:32,075 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-11 20:49:32,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:32,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671620991] [2024-11-11 20:49:32,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671620991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:32,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:32,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:32,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568229493] [2024-11-11 20:49:32,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:32,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:32,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:32,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:32,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:32,077 INFO L87 Difference]: Start difference. First operand 2265 states and 3794 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:33,303 INFO L93 Difference]: Finished difference Result 5353 states and 9151 transitions. [2024-11-11 20:49:33,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:33,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-11-11 20:49:33,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:33,320 INFO L225 Difference]: With dead ends: 5353 [2024-11-11 20:49:33,321 INFO L226 Difference]: Without dead ends: 3573 [2024-11-11 20:49:33,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:33,327 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1270 mSDsluCounter, 627 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1285 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:33,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1285 Valid, 808 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:49:33,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3573 states. [2024-11-11 20:49:33,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3573 to 3449. [2024-11-11 20:49:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3449 states, 2832 states have (on average 1.6062853107344632) internal successors, (4549), 2839 states have internal predecessors, (4549), 589 states have call successors, (589), 23 states have call predecessors, (589), 27 states have return successors, (662), 588 states have call predecessors, (662), 588 states have call successors, (662) [2024-11-11 20:49:33,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3449 states to 3449 states and 5800 transitions. [2024-11-11 20:49:33,444 INFO L78 Accepts]: Start accepts. Automaton has 3449 states and 5800 transitions. Word has length 124 [2024-11-11 20:49:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:33,445 INFO L471 AbstractCegarLoop]: Abstraction has 3449 states and 5800 transitions. [2024-11-11 20:49:33,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:33,445 INFO L276 IsEmpty]: Start isEmpty. Operand 3449 states and 5800 transitions. [2024-11-11 20:49:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:49:33,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:33,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:49:33,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:49:33,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:33,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:33,453 INFO L85 PathProgramCache]: Analyzing trace with hash 756911328, now seen corresponding path program 1 times [2024-11-11 20:49:33,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:33,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614608657] [2024-11-11 20:49:33,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:33,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:33,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:33,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:33,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:49:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:49:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:49:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:33,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:49:33,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:49:33,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:33,530 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-11 20:49:33,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:33,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614608657] [2024-11-11 20:49:33,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614608657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:33,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:33,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:33,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640311740] [2024-11-11 20:49:33,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:33,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:33,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:33,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:33,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:33,532 INFO L87 Difference]: Start difference. First operand 3449 states and 5800 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:34,866 INFO L93 Difference]: Finished difference Result 8426 states and 14467 transitions. [2024-11-11 20:49:34,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:34,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-11-11 20:49:34,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:34,894 INFO L225 Difference]: With dead ends: 8426 [2024-11-11 20:49:34,895 INFO L226 Difference]: Without dead ends: 5714 [2024-11-11 20:49:34,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:34,905 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 1231 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 1258 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1246 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:34,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1246 Valid, 832 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1258 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:49:34,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5714 states. [2024-11-11 20:49:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5714 to 5590. [2024-11-11 20:49:35,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5590 states, 4597 states have (on average 1.5999564933652382) internal successors, (7355), 4604 states have internal predecessors, (7355), 965 states have call successors, (965), 23 states have call predecessors, (965), 27 states have return successors, (1082), 964 states have call predecessors, (1082), 964 states have call successors, (1082) [2024-11-11 20:49:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 9402 transitions. [2024-11-11 20:49:35,188 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 9402 transitions. Word has length 125 [2024-11-11 20:49:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:35,188 INFO L471 AbstractCegarLoop]: Abstraction has 5590 states and 9402 transitions. [2024-11-11 20:49:35,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 9402 transitions. [2024-11-11 20:49:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:49:35,199 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:35,199 INFO L218 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] [2024-11-11 20:49:35,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:49:35,199 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1547282381, now seen corresponding path program 1 times [2024-11-11 20:49:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13986321] [2024-11-11 20:49:35,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:35,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:35,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:49:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:49:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:49:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:49:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:49:35,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:49:35,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:35,290 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-11 20:49:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:35,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13986321] [2024-11-11 20:49:35,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13986321] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:35,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:35,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933714693] [2024-11-11 20:49:35,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:35,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:35,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:35,292 INFO L87 Difference]: Start difference. First operand 5590 states and 9402 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:36,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:36,476 INFO L93 Difference]: Finished difference Result 13848 states and 23768 transitions. [2024-11-11 20:49:36,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:36,477 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-11 20:49:36,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:36,507 INFO L225 Difference]: With dead ends: 13848 [2024-11-11 20:49:36,508 INFO L226 Difference]: Without dead ends: 9397 [2024-11-11 20:49:36,516 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:36,517 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 1232 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 1249 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 844 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 1249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:36,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 844 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 1249 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:49:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9397 states. [2024-11-11 20:49:36,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9397 to 9273. [2024-11-11 20:49:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9273 states, 7674 states have (on average 1.5978629137346885) internal successors, (12262), 7681 states have internal predecessors, (12262), 1571 states have call successors, (1571), 23 states have call predecessors, (1571), 27 states have return successors, (1766), 1570 states have call predecessors, (1766), 1570 states have call successors, (1766) [2024-11-11 20:49:36,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9273 states to 9273 states and 15599 transitions. [2024-11-11 20:49:36,928 INFO L78 Accepts]: Start accepts. Automaton has 9273 states and 15599 transitions. Word has length 126 [2024-11-11 20:49:36,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:36,931 INFO L471 AbstractCegarLoop]: Abstraction has 9273 states and 15599 transitions. [2024-11-11 20:49:36,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:36,932 INFO L276 IsEmpty]: Start isEmpty. Operand 9273 states and 15599 transitions. [2024-11-11 20:49:36,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:49:36,953 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:36,953 INFO L218 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] [2024-11-11 20:49:36,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:49:36,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:36,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:36,954 INFO L85 PathProgramCache]: Analyzing trace with hash -512727774, now seen corresponding path program 1 times [2024-11-11 20:49:36,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:36,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576708082] [2024-11-11 20:49:36,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:36,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:49:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:49:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:49:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:49:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:49:37,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:49:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:49:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:37,070 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-11 20:49:37,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:37,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576708082] [2024-11-11 20:49:37,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576708082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:37,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:37,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:37,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652151930] [2024-11-11 20:49:37,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:37,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:37,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:37,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:37,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:37,073 INFO L87 Difference]: Start difference. First operand 9273 states and 15599 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:38,583 INFO L93 Difference]: Finished difference Result 24032 states and 41209 transitions. [2024-11-11 20:49:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:38,583 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-11 20:49:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:38,627 INFO L225 Difference]: With dead ends: 24032 [2024-11-11 20:49:38,627 INFO L226 Difference]: Without dead ends: 16350 [2024-11-11 20:49:38,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:38,646 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 1230 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:38,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 833 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:49:38,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16350 states. [2024-11-11 20:49:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16350 to 16226. [2024-11-11 20:49:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16226 states, 13424 states have (on average 1.5890941597139452) internal successors, (21332), 13431 states have internal predecessors, (21332), 2774 states have call successors, (2774), 23 states have call predecessors, (2774), 27 states have return successors, (3113), 2773 states have call predecessors, (3113), 2773 states have call successors, (3113) [2024-11-11 20:49:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16226 states to 16226 states and 27219 transitions. [2024-11-11 20:49:39,113 INFO L78 Accepts]: Start accepts. Automaton has 16226 states and 27219 transitions. Word has length 127 [2024-11-11 20:49:39,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:39,114 INFO L471 AbstractCegarLoop]: Abstraction has 16226 states and 27219 transitions. [2024-11-11 20:49:39,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 16226 states and 27219 transitions. [2024-11-11 20:49:39,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:49:39,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:39,131 INFO L218 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] [2024-11-11 20:49:39,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:49:39,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:39,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:39,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1366896460, now seen corresponding path program 1 times [2024-11-11 20:49:39,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:39,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648556003] [2024-11-11 20:49:39,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:39,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:39,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:49:39,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:49:39,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:49:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:49:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:49:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:49:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:49:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:39,209 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-11 20:49:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648556003] [2024-11-11 20:49:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648556003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:39,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042571364] [2024-11-11 20:49:39,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:39,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:39,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:39,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:39,211 INFO L87 Difference]: Start difference. First operand 16226 states and 27219 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:41,091 INFO L93 Difference]: Finished difference Result 42998 states and 73606 transitions. [2024-11-11 20:49:41,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:41,092 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-11-11 20:49:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:41,221 INFO L225 Difference]: With dead ends: 42998 [2024-11-11 20:49:41,221 INFO L226 Difference]: Without dead ends: 29005 [2024-11-11 20:49:41,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:41,269 INFO L435 NwaCegarLoop]: 178 mSDtfsCounter, 1228 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:41,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 806 Invalid, 1638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:49:41,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29005 states. [2024-11-11 20:49:42,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29005 to 28881. [2024-11-11 20:49:42,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28881 states, 24040 states have (on average 1.5848169717138103) internal successors, (38099), 24047 states have internal predecessors, (38099), 4813 states have call successors, (4813), 23 states have call predecessors, (4813), 27 states have return successors, (5426), 4812 states have call predecessors, (5426), 4812 states have call successors, (5426) [2024-11-11 20:49:42,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28881 states to 28881 states and 48338 transitions. [2024-11-11 20:49:42,503 INFO L78 Accepts]: Start accepts. Automaton has 28881 states and 48338 transitions. Word has length 128 [2024-11-11 20:49:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:42,504 INFO L471 AbstractCegarLoop]: Abstraction has 28881 states and 48338 transitions. [2024-11-11 20:49:42,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:42,504 INFO L276 IsEmpty]: Start isEmpty. Operand 28881 states and 48338 transitions. [2024-11-11 20:49:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:49:42,526 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:42,526 INFO L218 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] [2024-11-11 20:49:42,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:49:42,526 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:42,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:42,527 INFO L85 PathProgramCache]: Analyzing trace with hash 761091524, now seen corresponding path program 1 times [2024-11-11 20:49:42,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:42,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410426643] [2024-11-11 20:49:42,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:42,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:49:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:49:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:49:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:49:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:49:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:49:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:49:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:42,630 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-11 20:49:42,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:42,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410426643] [2024-11-11 20:49:42,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410426643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:42,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:42,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:42,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014900386] [2024-11-11 20:49:42,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:42,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:42,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:42,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:42,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:42,631 INFO L87 Difference]: Start difference. First operand 28881 states and 48338 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:44,955 INFO L93 Difference]: Finished difference Result 78760 states and 133970 transitions. [2024-11-11 20:49:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:44,956 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-11 20:49:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:45,140 INFO L225 Difference]: With dead ends: 78760 [2024-11-11 20:49:45,140 INFO L226 Difference]: Without dead ends: 52884 [2024-11-11 20:49:45,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:45,227 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 1298 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:45,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1313 Valid, 817 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:49:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52884 states. [2024-11-11 20:49:46,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52884 to 52760. [2024-11-11 20:49:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52760 states, 44204 states have (on average 1.5790878653515519) internal successors, (69802), 44211 states have internal predecessors, (69802), 8528 states have call successors, (8528), 23 states have call predecessors, (8528), 27 states have return successors, (9673), 8527 states have call predecessors, (9673), 8527 states have call successors, (9673) [2024-11-11 20:49:47,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52760 states to 52760 states and 88003 transitions. [2024-11-11 20:49:47,497 INFO L78 Accepts]: Start accepts. Automaton has 52760 states and 88003 transitions. Word has length 129 [2024-11-11 20:49:47,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:47,498 INFO L471 AbstractCegarLoop]: Abstraction has 52760 states and 88003 transitions. [2024-11-11 20:49:47,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:47,498 INFO L276 IsEmpty]: Start isEmpty. Operand 52760 states and 88003 transitions. [2024-11-11 20:49:47,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:49:47,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:47,520 INFO L218 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] [2024-11-11 20:49:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:49:47,521 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:47,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:47,522 INFO L85 PathProgramCache]: Analyzing trace with hash -907484908, now seen corresponding path program 1 times [2024-11-11 20:49:47,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:47,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906743438] [2024-11-11 20:49:47,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:47,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:49:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:49:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:49:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:49:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:49:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:49:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:49:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:47,620 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-11 20:49:47,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:47,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906743438] [2024-11-11 20:49:47,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906743438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:47,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:47,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:49:47,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849936021] [2024-11-11 20:49:47,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:47,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:49:47,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:47,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:49:47,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:49:47,622 INFO L87 Difference]: Start difference. First operand 52760 states and 88003 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:49:50,756 INFO L93 Difference]: Finished difference Result 98531 states and 167900 transitions. [2024-11-11 20:49:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:49:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-11 20:49:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:49:51,116 INFO L225 Difference]: With dead ends: 98531 [2024-11-11 20:49:51,117 INFO L226 Difference]: Without dead ends: 98343 [2024-11-11 20:49:51,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-11 20:49:51,169 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 1282 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1199 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1296 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 1199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:49:51,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1296 Valid, 846 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 1199 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:49:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98343 states. [2024-11-11 20:49:54,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98343 to 98219. [2024-11-11 20:49:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98219 states, 82864 states have (on average 1.5718406062946515) internal successors, (130249), 82871 states have internal predecessors, (130249), 15327 states have call successors, (15327), 23 states have call predecessors, (15327), 27 states have return successors, (17518), 15326 states have call predecessors, (17518), 15326 states have call successors, (17518) [2024-11-11 20:49:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98219 states to 98219 states and 163094 transitions. [2024-11-11 20:49:55,086 INFO L78 Accepts]: Start accepts. Automaton has 98219 states and 163094 transitions. Word has length 130 [2024-11-11 20:49:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:49:55,088 INFO L471 AbstractCegarLoop]: Abstraction has 98219 states and 163094 transitions. [2024-11-11 20:49:55,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (15), 6 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-11 20:49:55,088 INFO L276 IsEmpty]: Start isEmpty. Operand 98219 states and 163094 transitions. [2024-11-11 20:49:55,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:49:55,120 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:49:55,121 INFO L218 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] [2024-11-11 20:49:55,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:49:55,121 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:49:55,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:49:55,122 INFO L85 PathProgramCache]: Analyzing trace with hash -819343165, now seen corresponding path program 1 times [2024-11-11 20:49:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:49:55,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407446281] [2024-11-11 20:49:55,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:49:55,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:49:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:49:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:49:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:49:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:49:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:49:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:49:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:49:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:49:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:49:55,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:49:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:49:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:49:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:49:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:49:55,441 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-11 20:49:55,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:49:55,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407446281] [2024-11-11 20:49:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407446281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:49:55,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:49:55,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:49:55,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090206605] [2024-11-11 20:49:55,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:49:55,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:49:55,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:49:55,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:49:55,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:49:55,443 INFO L87 Difference]: Start difference. First operand 98219 states and 163094 transitions. Second operand has 18 states, 16 states have (on average 5.625) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-11 20:50:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:05,840 INFO L93 Difference]: Finished difference Result 196355 states and 337911 transitions. [2024-11-11 20:50:05,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 20:50:05,841 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.625) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 131 [2024-11-11 20:50:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:06,757 INFO L225 Difference]: With dead ends: 196355 [2024-11-11 20:50:06,757 INFO L226 Difference]: Without dead ends: 196173 [2024-11-11 20:50:06,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:50:06,846 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 4983 mSDsluCounter, 2747 mSDsCounter, 0 mSdLazyCounter, 7487 mSolverCounterSat, 1693 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4983 SdHoareTripleChecker+Valid, 2979 SdHoareTripleChecker+Invalid, 9180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1693 IncrementalHoareTripleChecker+Valid, 7487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:06,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4983 Valid, 2979 Invalid, 9180 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1693 Valid, 7487 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-11 20:50:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196173 states. [2024-11-11 20:50:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196173 to 195643. [2024-11-11 20:50:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195643 states, 165120 states have (on average 1.57265625) internal successors, (259677), 165025 states have internal predecessors, (259677), 30451 states have call successors, (30451), 62 states have call predecessors, (30451), 71 states have return successors, (38109), 30561 states have call predecessors, (38109), 30448 states have call successors, (38109) [2024-11-11 20:50:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195643 states to 195643 states and 328237 transitions. [2024-11-11 20:50:15,022 INFO L78 Accepts]: Start accepts. Automaton has 195643 states and 328237 transitions. Word has length 131 [2024-11-11 20:50:15,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:50:15,023 INFO L471 AbstractCegarLoop]: Abstraction has 195643 states and 328237 transitions. [2024-11-11 20:50:15,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.625) internal successors, (90), 12 states have internal predecessors, (90), 6 states have call successors, (15), 7 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2024-11-11 20:50:15,023 INFO L276 IsEmpty]: Start isEmpty. Operand 195643 states and 328237 transitions. [2024-11-11 20:50:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:50:15,094 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:50:15,094 INFO L218 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] [2024-11-11 20:50:15,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:50:15,094 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:50:15,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:50:15,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1257102010, now seen corresponding path program 1 times [2024-11-11 20:50:15,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:50:15,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198965722] [2024-11-11 20:50:15,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:50:15,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:50:15,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:50:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:50:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:50:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:50:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:50:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:50:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:50:15,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:50:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:50:15,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:50:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:50:15,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:50:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:50:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:50:15,418 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-11 20:50:15,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:50:15,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198965722] [2024-11-11 20:50:15,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198965722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:50:15,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:50:15,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:50:15,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036680816] [2024-11-11 20:50:15,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:50:15,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:50:15,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:50:15,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:50:15,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:50:15,421 INFO L87 Difference]: Start difference. First operand 195643 states and 328237 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 8 states have internal predecessors, (91), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-11 20:50:23,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:50:23,297 INFO L93 Difference]: Finished difference Result 197062 states and 336784 transitions. [2024-11-11 20:50:23,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 20:50:23,297 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 8 states have internal predecessors, (91), 5 states have call successors, (15), 7 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 132 [2024-11-11 20:50:23,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:50:24,032 INFO L225 Difference]: With dead ends: 197062 [2024-11-11 20:50:24,033 INFO L226 Difference]: Without dead ends: 196073 [2024-11-11 20:50:24,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=258, Invalid=864, Unknown=0, NotChecked=0, Total=1122 [2024-11-11 20:50:24,105 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2417 mSDsluCounter, 1460 mSDsCounter, 0 mSdLazyCounter, 3753 mSolverCounterSat, 788 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2432 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 4541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 788 IncrementalHoareTripleChecker+Valid, 3753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:50:24,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2432 Valid, 1628 Invalid, 4541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [788 Valid, 3753 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:50:24,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196073 states.