./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.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 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:59:02,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:59:02,633 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:59:02,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:59:02,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:59:02,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:59:02,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:59:02,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:59:02,669 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:59:02,670 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:59:02,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:59:02,670 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:59:02,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:59:02,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:59:02,672 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:59:02,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:59:02,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:59:02,673 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:59:02,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:59:02,673 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:59:02,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:59:02,674 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:59:02,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:59:02,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:59:02,675 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:59:02,676 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:59:02,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:59:02,676 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:59:02,677 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:59:02,677 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:59:02,677 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:59:02,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:59:02,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:59:02,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:59:02,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:59:02,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:59:02,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:59:02,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:59:02,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:59:02,680 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:59:02,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:59:02,684 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:59:02,684 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 -> 2fde44ff6f2aac911c03318478d3361889c0f9ce519411733d9129672caa5fa0 [2024-11-19 21:59:02,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:59:02,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:59:02,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:59:02,974 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:59:02,975 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:59:02,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-11-19 21:59:04,327 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:59:04,731 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:59:04,732 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec7_product13.cil.c [2024-11-19 21:59:04,753 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8286061f7/5adc4d143d98480c81d39e13cec5dd69/FLAG6b7a35482 [2024-11-19 21:59:04,771 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8286061f7/5adc4d143d98480c81d39e13cec5dd69 [2024-11-19 21:59:04,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:59:04,776 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:59:04,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:59:04,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:59:04,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:59:04,783 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:04" (1/1) ... [2024-11-19 21:59:04,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e07127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:04, skipping insertion in model container [2024-11-19 21:59:04,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:04" (1/1) ... [2024-11-19 21:59:04,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:59:05,216 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_spec7_product13.cil.c[16810,16823] [2024-11-19 21:59:05,420 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:59:05,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:59:05,445 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptVerify_spec.i","") [48] [2024-11-19 21:59:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [79] [2024-11-19 21:59:05,447 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [371] [2024-11-19 21:59:05,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [737] [2024-11-19 21:59:05,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [746] [2024-11-19 21:59:05,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [781] [2024-11-19 21:59:05,448 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1193] [2024-11-19 21:59:05,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1210] [2024-11-19 21:59:05,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1308] [2024-11-19 21:59:05,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1562] [2024-11-19 21:59:05,449 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2631] [2024-11-19 21:59:05,475 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_spec7_product13.cil.c[16810,16823] [2024-11-19 21:59:05,515 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:59:05,548 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:59:05,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05 WrapperNode [2024-11-19 21:59:05,549 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:59:05,550 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:59:05,550 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:59:05,550 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:59:05,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,643 INFO L138 Inliner]: procedures = 124, calls = 176, calls flagged for inlining = 54, calls inlined = 45, statements flattened = 851 [2024-11-19 21:59:05,644 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:59:05,645 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:59:05,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:59:05,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:59:05,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,661 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,708 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-19 21:59:05,710 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,711 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,726 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,744 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:59:05,756 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:59:05,756 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:59:05,756 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:59:05,757 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (1/1) ... [2024-11-19 21:59:05,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:59:05,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:05,811 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-19 21:59:05,813 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-19 21:59:05,855 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:59:05,856 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:59:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:59:05,856 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:59:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:59:05,856 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:59:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:59:05,856 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:59:05,856 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-19 21:59:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-19 21:59:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:59:05,857 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:59:05,857 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-19 21:59:05,858 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-19 21:59:05,859 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:59:05,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:59:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:59:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-19 21:59:05,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-19 21:59:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:59:05,860 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:59:05,860 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:59:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:59:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:59:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:59:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:59:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:59:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:59:05,861 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:59:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:59:05,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:59:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:59:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:59:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:59:05,862 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:59:05,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:59:05,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:59:06,052 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:59:06,054 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:59:06,761 INFO L? ?]: Removed 362 outVars from TransFormulas that were not future-live. [2024-11-19 21:59:06,762 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:59:06,786 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:59:06,786 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:59:06,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:06 BoogieIcfgContainer [2024-11-19 21:59:06,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:59:06,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:59:06,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:59:06,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:59:06,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:59:04" (1/3) ... [2024-11-19 21:59:06,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac374c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:06, skipping insertion in model container [2024-11-19 21:59:06,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:05" (2/3) ... [2024-11-19 21:59:06,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac374c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:06, skipping insertion in model container [2024-11-19 21:59:06,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:06" (3/3) ... [2024-11-19 21:59:06,797 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec7_product13.cil.c [2024-11-19 21:59:06,814 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:59:06,815 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:59:06,894 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:59:06,900 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;@411bba7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:59:06,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:59:06,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 264 states, 212 states have (on average 1.5566037735849056) internal successors, (330), 214 states have internal predecessors, (330), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-19 21:59:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-19 21:59:06,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:06,928 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:06,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:06,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:06,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1637377902, now seen corresponding path program 1 times [2024-11-19 21:59:06,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:06,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118767494] [2024-11-19 21:59:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:06,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:07,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:59:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:59:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:59:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:07,700 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-19 21:59:07,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:07,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118767494] [2024-11-19 21:59:07,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118767494] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:07,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004366725] [2024-11-19 21:59:07,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:07,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:07,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:07,706 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-19 21:59:07,708 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-19 21:59:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:59:08,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:08,031 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-19 21:59:08,031 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:08,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004366725] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:08,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:08,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-19 21:59:08,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875080291] [2024-11-19 21:59:08,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:08,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:59:08,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:08,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:59:08,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:59:08,065 INFO L87 Difference]: Start difference. First operand has 264 states, 212 states have (on average 1.5566037735849056) internal successors, (330), 214 states have internal predecessors, (330), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:08,104 INFO L93 Difference]: Finished difference Result 379 states and 562 transitions. [2024-11-19 21:59:08,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:59:08,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 83 [2024-11-19 21:59:08,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:08,123 INFO L225 Difference]: With dead ends: 379 [2024-11-19 21:59:08,124 INFO L226 Difference]: Without dead ends: 257 [2024-11-19 21:59:08,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:59:08,133 INFO L432 NwaCegarLoop]: 396 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, 396 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-19 21:59:08,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-19 21:59:08,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2024-11-19 21:59:08,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 206 states have (on average 1.5485436893203883) internal successors, (319), 207 states have internal predecessors, (319), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 21:59:08,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 388 transitions. [2024-11-19 21:59:08,206 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 388 transitions. Word has length 83 [2024-11-19 21:59:08,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:08,211 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 388 transitions. [2024-11-19 21:59:08,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:08,212 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 388 transitions. [2024-11-19 21:59:08,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 21:59:08,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:08,216 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:08,225 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-19 21:59:08,416 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-19 21:59:08,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:08,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:08,418 INFO L85 PathProgramCache]: Analyzing trace with hash 858974029, now seen corresponding path program 1 times [2024-11-19 21:59:08,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:08,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575125960] [2024-11-19 21:59:08,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:08,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:59:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:59:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:59:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:08,724 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-19 21:59:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:08,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575125960] [2024-11-19 21:59:08,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575125960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:08,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618254842] [2024-11-19 21:59:08,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:08,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:08,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:08,728 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-19 21:59:08,730 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-19 21:59:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:59:09,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:09,048 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-19 21:59:09,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618254842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:09,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:09,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:59:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932193443] [2024-11-19 21:59:09,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:09,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:59:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:09,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:59:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:09,054 INFO L87 Difference]: Start difference. First operand 257 states and 388 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:09,100 INFO L93 Difference]: Finished difference Result 369 states and 543 transitions. [2024-11-19 21:59:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:59:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 84 [2024-11-19 21:59:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:09,105 INFO L225 Difference]: With dead ends: 369 [2024-11-19 21:59:09,108 INFO L226 Difference]: Without dead ends: 260 [2024-11-19 21:59:09,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:09,110 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 1 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 770 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-19 21:59:09,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 770 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-19 21:59:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2024-11-19 21:59:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 208 states have (on average 1.5432692307692308) internal successors, (321), 209 states have internal predecessors, (321), 35 states have call successors, (35), 15 states have call predecessors, (35), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 21:59:09,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 390 transitions. [2024-11-19 21:59:09,139 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 390 transitions. Word has length 84 [2024-11-19 21:59:09,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 390 transitions. [2024-11-19 21:59:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 390 transitions. [2024-11-19 21:59:09,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-19 21:59:09,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:09,144 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:09,156 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-19 21:59:09,345 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-19 21:59:09,345 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:09,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:09,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2058415914, now seen corresponding path program 1 times [2024-11-19 21:59:09,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:09,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339285370] [2024-11-19 21:59:09,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:09,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:09,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:09,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:09,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:59:09,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:59:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:59:09,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,570 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-19 21:59:09,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339285370] [2024-11-19 21:59:09,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339285370] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:09,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117521265] [2024-11-19 21:59:09,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:09,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:09,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:09,575 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-19 21:59:09,576 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-19 21:59:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:09,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 902 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:59:09,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:09,832 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-19 21:59:09,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:09,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117521265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-19 21:59:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845535696] [2024-11-19 21:59:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:59:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:09,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:59:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:09,835 INFO L87 Difference]: Start difference. First operand 259 states and 390 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:09,884 INFO L93 Difference]: Finished difference Result 543 states and 831 transitions. [2024-11-19 21:59:09,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:59:09,885 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 90 [2024-11-19 21:59:09,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:09,887 INFO L225 Difference]: With dead ends: 543 [2024-11-19 21:59:09,888 INFO L226 Difference]: Without dead ends: 311 [2024-11-19 21:59:09,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:59:09,891 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 99 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 737 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-19 21:59:09,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 737 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-19 21:59:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 303. [2024-11-19 21:59:09,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 241 states have (on average 1.5560165975103735) internal successors, (375), 242 states have internal predecessors, (375), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-11-19 21:59:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 466 transitions. [2024-11-19 21:59:09,924 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 466 transitions. Word has length 90 [2024-11-19 21:59:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:09,924 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 466 transitions. [2024-11-19 21:59:09,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 466 transitions. [2024-11-19 21:59:09,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-19 21:59:09,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:09,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:09,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:59:10,127 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-19 21:59:10,128 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:10,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:10,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1120192899, now seen corresponding path program 1 times [2024-11-19 21:59:10,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:10,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222341295] [2024-11-19 21:59:10,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:10,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:10,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:59:10,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:59:10,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:59:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:59:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:59:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:59:10,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:59:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,317 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-19 21:59:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222341295] [2024-11-19 21:59:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222341295] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206413352] [2024-11-19 21:59:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:10,320 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-19 21:59:10,322 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-19 21:59:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:10,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:59:10,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:10,636 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-19 21:59:10,638 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:10,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206413352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:10,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:10,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-19 21:59:10,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801061270] [2024-11-19 21:59:10,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:10,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:59:10,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:10,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:59:10,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:59:10,640 INFO L87 Difference]: Start difference. First operand 303 states and 466 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:10,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:10,698 INFO L93 Difference]: Finished difference Result 597 states and 922 transitions. [2024-11-19 21:59:10,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:59:10,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 91 [2024-11-19 21:59:10,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:10,703 INFO L225 Difference]: With dead ends: 597 [2024-11-19 21:59:10,705 INFO L226 Difference]: Without dead ends: 305 [2024-11-19 21:59:10,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:59:10,707 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 2 mSDsluCounter, 1129 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1509 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-19 21:59:10,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1509 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:10,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2024-11-19 21:59:10,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2024-11-19 21:59:10,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 242 states have (on average 1.5537190082644627) internal successors, (376), 244 states have internal predecessors, (376), 46 states have call successors, (46), 15 states have call predecessors, (46), 16 states have return successors, (47), 45 states have call predecessors, (47), 45 states have call successors, (47) [2024-11-19 21:59:10,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 469 transitions. [2024-11-19 21:59:10,734 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 469 transitions. Word has length 91 [2024-11-19 21:59:10,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:10,734 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 469 transitions. [2024-11-19 21:59:10,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:10,735 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 469 transitions. [2024-11-19 21:59:10,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-19 21:59:10,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:10,737 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:10,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:59:10,940 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-19 21:59:10,940 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:10,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:10,940 INFO L85 PathProgramCache]: Analyzing trace with hash -214697526, now seen corresponding path program 1 times [2024-11-19 21:59:10,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:10,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151983728] [2024-11-19 21:59:10,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:10,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:59:11,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:59:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:59:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:59:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:59:11,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:59:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,233 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-19 21:59:11,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151983728] [2024-11-19 21:59:11,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151983728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:11,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352046225] [2024-11-19 21:59:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:11,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:11,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:11,239 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-19 21:59:11,240 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-19 21:59:11,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:59:11,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:11,556 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-19 21:59:11,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:59:11,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352046225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:11,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:59:11,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-19 21:59:11,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20589534] [2024-11-19 21:59:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:11,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:59:11,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:11,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:59:11,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:59:11,559 INFO L87 Difference]: Start difference. First operand 305 states and 469 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:11,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:11,617 INFO L93 Difference]: Finished difference Result 599 states and 927 transitions. [2024-11-19 21:59:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:59:11,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 92 [2024-11-19 21:59:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:11,621 INFO L225 Difference]: With dead ends: 599 [2024-11-19 21:59:11,621 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 21:59:11,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:59:11,623 INFO L432 NwaCegarLoop]: 378 mSDtfsCounter, 2 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1495 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-19 21:59:11,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1495 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:59:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 21:59:11,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-19 21:59:11,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 243 states have (on average 1.551440329218107) internal successors, (377), 246 states have internal predecessors, (377), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-19 21:59:11,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 475 transitions. [2024-11-19 21:59:11,641 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 475 transitions. Word has length 92 [2024-11-19 21:59:11,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:11,642 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 475 transitions. [2024-11-19 21:59:11,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:11,642 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 475 transitions. [2024-11-19 21:59:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-19 21:59:11,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:11,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:11,654 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-19 21:59:11,846 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-19 21:59:11,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:11,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -660874960, now seen corresponding path program 1 times [2024-11-19 21:59:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933099861] [2024-11-19 21:59:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:59:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:59:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:12,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:59:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:59:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:12,043 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-19 21:59:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:12,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933099861] [2024-11-19 21:59:12,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933099861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:12,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:12,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:59:12,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034369506] [2024-11-19 21:59:12,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:12,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:59:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:12,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:59:12,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:59:12,046 INFO L87 Difference]: Start difference. First operand 307 states and 475 transitions. Second operand has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:13,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:13,279 INFO L93 Difference]: Finished difference Result 652 states and 1017 transitions. [2024-11-19 21:59:13,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:13,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 93 [2024-11-19 21:59:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:13,282 INFO L225 Difference]: With dead ends: 652 [2024-11-19 21:59:13,283 INFO L226 Difference]: Without dead ends: 368 [2024-11-19 21:59:13,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:59:13,286 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 602 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:13,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 926 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:59:13,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-19 21:59:13,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 307. [2024-11-19 21:59:13,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 243 states have (on average 1.551440329218107) internal successors, (377), 246 states have internal predecessors, (377), 46 states have call successors, (46), 15 states have call predecessors, (46), 17 states have return successors, (51), 45 states have call predecessors, (51), 45 states have call successors, (51) [2024-11-19 21:59:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 474 transitions. [2024-11-19 21:59:13,310 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 474 transitions. Word has length 93 [2024-11-19 21:59:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 474 transitions. [2024-11-19 21:59:13,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.571428571428571) internal successors, (60), 5 states have internal predecessors, (60), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:13,311 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 474 transitions. [2024-11-19 21:59:13,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 21:59:13,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:13,313 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:59:13,314 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:13,314 INFO L85 PathProgramCache]: Analyzing trace with hash 225664213, now seen corresponding path program 2 times [2024-11-19 21:59:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407825390] [2024-11-19 21:59:13,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:13,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:59:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:59:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:59:13,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:59:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:59:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:13,498 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-19 21:59:13,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:13,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407825390] [2024-11-19 21:59:13,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407825390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:13,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:13,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:59:13,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261052505] [2024-11-19 21:59:13,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:13,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:59:13,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:13,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:59:13,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:59:13,501 INFO L87 Difference]: Start difference. First operand 307 states and 474 transitions. Second operand has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:14,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:14,663 INFO L93 Difference]: Finished difference Result 654 states and 1020 transitions. [2024-11-19 21:59:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:59:14,664 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2024-11-19 21:59:14,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:14,667 INFO L225 Difference]: With dead ends: 654 [2024-11-19 21:59:14,667 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 21:59:14,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:59:14,669 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 599 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:14,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 925 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:59:14,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 21:59:14,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 309. [2024-11-19 21:59:14,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 248 states have internal predecessors, (378), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-11-19 21:59:14,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 477 transitions. [2024-11-19 21:59:14,704 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 477 transitions. Word has length 94 [2024-11-19 21:59:14,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:14,704 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 477 transitions. [2024-11-19 21:59:14,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:14,704 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 477 transitions. [2024-11-19 21:59:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 21:59:14,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:14,706 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:59:14,706 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:14,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash -393943273, now seen corresponding path program 1 times [2024-11-19 21:59:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123131190] [2024-11-19 21:59:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:59:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:59:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:59:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:14,863 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-19 21:59:14,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:14,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123131190] [2024-11-19 21:59:14,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123131190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:14,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:14,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 21:59:14,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618113485] [2024-11-19 21:59:14,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:14,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 21:59:14,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:14,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 21:59:14,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 21:59:14,865 INFO L87 Difference]: Start difference. First operand 309 states and 477 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:16,060 INFO L93 Difference]: Finished difference Result 654 states and 1019 transitions. [2024-11-19 21:59:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:59:16,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2024-11-19 21:59:16,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:16,064 INFO L225 Difference]: With dead ends: 654 [2024-11-19 21:59:16,065 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 21:59:16,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:59:16,067 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 600 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:16,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [601 Valid, 922 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:59:16,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 21:59:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 309. [2024-11-19 21:59:16,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 248 states have internal predecessors, (378), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (53), 45 states have call predecessors, (53), 45 states have call successors, (53) [2024-11-19 21:59:16,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 477 transitions. [2024-11-19 21:59:16,099 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 477 transitions. Word has length 95 [2024-11-19 21:59:16,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:16,100 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 477 transitions. [2024-11-19 21:59:16,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 5 states have internal predecessors, (62), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-19 21:59:16,100 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 477 transitions. [2024-11-19 21:59:16,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-19 21:59:16,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:16,102 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:16,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:59:16,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:16,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:16,103 INFO L85 PathProgramCache]: Analyzing trace with hash -954643051, now seen corresponding path program 1 times [2024-11-19 21:59:16,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:16,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125665663] [2024-11-19 21:59:16,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:16,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:16,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:16,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:59:16,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:59:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:59:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:16,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-19 21:59:16,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:16,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125665663] [2024-11-19 21:59:16,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125665663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:16,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:16,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:59:16,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875403338] [2024-11-19 21:59:16,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:16,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:59:16,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:16,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:59:16,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:59:16,314 INFO L87 Difference]: Start difference. First operand 309 states and 477 transitions. Second operand has 11 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:59:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:17,830 INFO L93 Difference]: Finished difference Result 652 states and 1014 transitions. [2024-11-19 21:59:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:59:17,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 95 [2024-11-19 21:59:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:17,833 INFO L225 Difference]: With dead ends: 652 [2024-11-19 21:59:17,833 INFO L226 Difference]: Without dead ends: 370 [2024-11-19 21:59:17,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:59:17,834 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 602 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2586 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:17,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1328 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:59:17,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-19 21:59:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 309. [2024-11-19 21:59:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 244 states have (on average 1.5491803278688525) internal successors, (378), 248 states have internal predecessors, (378), 46 states have call successors, (46), 15 states have call predecessors, (46), 18 states have return successors, (52), 45 states have call predecessors, (52), 45 states have call successors, (52) [2024-11-19 21:59:17,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 476 transitions. [2024-11-19 21:59:17,854 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 476 transitions. Word has length 95 [2024-11-19 21:59:17,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:17,854 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 476 transitions. [2024-11-19 21:59:17,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.5) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:59:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 476 transitions. [2024-11-19 21:59:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 21:59:17,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:17,856 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:17,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:59:17,856 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:17,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1638532327, now seen corresponding path program 2 times [2024-11-19 21:59:17,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:17,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063990775] [2024-11-19 21:59:17,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:17,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:17,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:17,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:59:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:59:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:59:18,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:18,085 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-19 21:59:18,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:18,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063990775] [2024-11-19 21:59:18,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063990775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:18,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:18,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:59:18,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408847895] [2024-11-19 21:59:18,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:18,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:59:18,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:18,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:59:18,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:59:18,087 INFO L87 Difference]: Start difference. First operand 309 states and 476 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:59:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:19,572 INFO L93 Difference]: Finished difference Result 654 states and 1020 transitions. [2024-11-19 21:59:19,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:59:19,573 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 96 [2024-11-19 21:59:19,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:19,575 INFO L225 Difference]: With dead ends: 654 [2024-11-19 21:59:19,575 INFO L226 Difference]: Without dead ends: 372 [2024-11-19 21:59:19,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-19 21:59:19,577 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 599 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2620 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:19,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 1329 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2620 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:59:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-19 21:59:19,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 311. [2024-11-19 21:59:19,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 245 states have (on average 1.546938775510204) internal successors, (379), 250 states have internal predecessors, (379), 46 states have call successors, (46), 15 states have call predecessors, (46), 19 states have return successors, (57), 45 states have call predecessors, (57), 45 states have call successors, (57) [2024-11-19 21:59:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 482 transitions. [2024-11-19 21:59:19,596 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 482 transitions. Word has length 96 [2024-11-19 21:59:19,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:19,596 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 482 transitions. [2024-11-19 21:59:19,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-19 21:59:19,597 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 482 transitions. [2024-11-19 21:59:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-19 21:59:19,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:19,598 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:19,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 21:59:19,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:19,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:19,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1892971930, now seen corresponding path program 1 times [2024-11-19 21:59:19,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:19,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313039892] [2024-11-19 21:59:19,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:19,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:19,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:19,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:59:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:59:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:59:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:59:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,723 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-19 21:59:19,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313039892] [2024-11-19 21:59:19,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313039892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:59:19,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052280678] [2024-11-19 21:59:19,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:19,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:19,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:59:19,726 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-19 21:59:19,727 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-19 21:59:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:19,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:59:19,977 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:59:20,002 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-19 21:59:20,003 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:59:20,083 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-19 21:59:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052280678] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:59:20,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:59:20,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-19 21:59:20,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177098618] [2024-11-19 21:59:20,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:59:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:59:20,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:59:20,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:20,085 INFO L87 Difference]: Start difference. First operand 311 states and 482 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 21:59:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:21,124 INFO L93 Difference]: Finished difference Result 808 states and 1318 transitions. [2024-11-19 21:59:21,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 21:59:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 97 [2024-11-19 21:59:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:21,129 INFO L225 Difference]: With dead ends: 808 [2024-11-19 21:59:21,129 INFO L226 Difference]: Without dead ends: 699 [2024-11-19 21:59:21,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-19 21:59:21,131 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 981 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 1924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:21,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1250 Invalid, 1924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 1668 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:59:21,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-19 21:59:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 614. [2024-11-19 21:59:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 484 states have (on average 1.6053719008264462) internal successors, (777), 489 states have internal predecessors, (777), 110 states have call successors, (110), 15 states have call predecessors, (110), 19 states have return successors, (131), 109 states have call predecessors, (131), 109 states have call successors, (131) [2024-11-19 21:59:21,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1018 transitions. [2024-11-19 21:59:21,158 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1018 transitions. Word has length 97 [2024-11-19 21:59:21,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:21,158 INFO L471 AbstractCegarLoop]: Abstraction has 614 states and 1018 transitions. [2024-11-19 21:59:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 7 states have internal predecessors, (87), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-19 21:59:21,159 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1018 transitions. [2024-11-19 21:59:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:59:21,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:21,161 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:21,171 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-19 21:59:21,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:59:21,362 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:21,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:21,363 INFO L85 PathProgramCache]: Analyzing trace with hash 851842103, now seen corresponding path program 1 times [2024-11-19 21:59:21,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:21,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797649854] [2024-11-19 21:59:21,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:21,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:59:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:59:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:59:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:59:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:21,461 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-19 21:59:21,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:21,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797649854] [2024-11-19 21:59:21,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797649854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:21,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:21,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:21,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874940144] [2024-11-19 21:59:21,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:21,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:21,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:21,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:21,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:21,464 INFO L87 Difference]: Start difference. First operand 614 states and 1018 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:22,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:22,338 INFO L93 Difference]: Finished difference Result 1529 states and 2597 transitions. [2024-11-19 21:59:22,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:22,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 103 [2024-11-19 21:59:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:22,345 INFO L225 Difference]: With dead ends: 1529 [2024-11-19 21:59:22,345 INFO L226 Difference]: Without dead ends: 983 [2024-11-19 21:59:22,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:22,350 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 695 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:22,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 674 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:59:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 983 states. [2024-11-19 21:59:22,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 983 to 914. [2024-11-19 21:59:22,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 720 states have (on average 1.613888888888889) internal successors, (1162), 725 states have internal predecessors, (1162), 174 states have call successors, (174), 15 states have call predecessors, (174), 19 states have return successors, (205), 173 states have call predecessors, (205), 173 states have call successors, (205) [2024-11-19 21:59:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1541 transitions. [2024-11-19 21:59:22,392 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1541 transitions. Word has length 103 [2024-11-19 21:59:22,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:22,393 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1541 transitions. [2024-11-19 21:59:22,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:22,393 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1541 transitions. [2024-11-19 21:59:22,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 21:59:22,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:22,396 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:22,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:59:22,397 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:22,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:22,397 INFO L85 PathProgramCache]: Analyzing trace with hash 2105734175, now seen corresponding path program 1 times [2024-11-19 21:59:22,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:22,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953459704] [2024-11-19 21:59:22,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:22,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:22,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:22,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:59:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:59:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:59:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:59:22,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:22,489 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-19 21:59:22,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:22,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953459704] [2024-11-19 21:59:22,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953459704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:22,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:22,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:22,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150669317] [2024-11-19 21:59:22,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:22,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:22,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:22,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:22,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:22,492 INFO L87 Difference]: Start difference. First operand 914 states and 1541 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:23,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:23,439 INFO L93 Difference]: Finished difference Result 2244 states and 3842 transitions. [2024-11-19 21:59:23,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:23,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 104 [2024-11-19 21:59:23,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:23,448 INFO L225 Difference]: With dead ends: 2244 [2024-11-19 21:59:23,448 INFO L226 Difference]: Without dead ends: 1451 [2024-11-19 21:59:23,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:23,452 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 693 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:23,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 651 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:59:23,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2024-11-19 21:59:23,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 1382. [2024-11-19 21:59:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1093 states have (on average 1.6184812442817933) internal successors, (1769), 1098 states have internal predecessors, (1769), 269 states have call successors, (269), 15 states have call predecessors, (269), 19 states have return successors, (300), 268 states have call predecessors, (300), 268 states have call successors, (300) [2024-11-19 21:59:23,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 2338 transitions. [2024-11-19 21:59:23,503 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 2338 transitions. Word has length 104 [2024-11-19 21:59:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:23,504 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 2338 transitions. [2024-11-19 21:59:23,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 2338 transitions. [2024-11-19 21:59:23,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 21:59:23,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:23,509 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:23,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:59:23,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:23,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:23,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1729270425, now seen corresponding path program 1 times [2024-11-19 21:59:23,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:23,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138091289] [2024-11-19 21:59:23,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:23,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:23,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:23,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:59:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:59:23,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:59:23,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:59:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:23,594 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-19 21:59:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:23,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138091289] [2024-11-19 21:59:23,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138091289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:23,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:23,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:23,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633519991] [2024-11-19 21:59:23,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:23,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:23,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:23,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:23,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:23,597 INFO L87 Difference]: Start difference. First operand 1382 states and 2338 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:24,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:24,462 INFO L93 Difference]: Finished difference Result 3291 states and 5683 transitions. [2024-11-19 21:59:24,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:24,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 105 [2024-11-19 21:59:24,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:24,475 INFO L225 Difference]: With dead ends: 3291 [2024-11-19 21:59:24,476 INFO L226 Difference]: Without dead ends: 2155 [2024-11-19 21:59:24,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:24,482 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 691 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:24,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 645 Invalid, 1015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-19 21:59:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2086. [2024-11-19 21:59:24,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 1674 states have (on average 1.6224611708482677) internal successors, (2716), 1679 states have internal predecessors, (2716), 392 states have call successors, (392), 15 states have call predecessors, (392), 19 states have return successors, (439), 391 states have call predecessors, (439), 391 states have call successors, (439) [2024-11-19 21:59:24,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3547 transitions. [2024-11-19 21:59:24,575 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3547 transitions. Word has length 105 [2024-11-19 21:59:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:24,575 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3547 transitions. [2024-11-19 21:59:24,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3547 transitions. [2024-11-19 21:59:24,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-19 21:59:24,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:24,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:24,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:59:24,583 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:24,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:24,583 INFO L85 PathProgramCache]: Analyzing trace with hash -562275392, now seen corresponding path program 1 times [2024-11-19 21:59:24,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:24,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161322071] [2024-11-19 21:59:24,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:24,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:59:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:59:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:59:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:59:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:24,668 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-19 21:59:24,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:24,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161322071] [2024-11-19 21:59:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161322071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:24,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056243369] [2024-11-19 21:59:24,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:24,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:24,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:24,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:24,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:24,669 INFO L87 Difference]: Start difference. First operand 2086 states and 3547 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:25,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:25,509 INFO L93 Difference]: Finished difference Result 4910 states and 8537 transitions. [2024-11-19 21:59:25,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:25,510 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-19 21:59:25,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:25,529 INFO L225 Difference]: With dead ends: 4910 [2024-11-19 21:59:25,529 INFO L226 Difference]: Without dead ends: 3274 [2024-11-19 21:59:25,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:25,537 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 689 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:25,538 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 645 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-11-19 21:59:25,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3205. [2024-11-19 21:59:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3205 states, 2614 states have (on average 1.6247130833970926) internal successors, (4247), 2619 states have internal predecessors, (4247), 571 states have call successors, (571), 15 states have call predecessors, (571), 19 states have return successors, (644), 570 states have call predecessors, (644), 570 states have call successors, (644) [2024-11-19 21:59:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 5462 transitions. [2024-11-19 21:59:25,681 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 5462 transitions. Word has length 106 [2024-11-19 21:59:25,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:25,682 INFO L471 AbstractCegarLoop]: Abstraction has 3205 states and 5462 transitions. [2024-11-19 21:59:25,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:25,682 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 5462 transitions. [2024-11-19 21:59:25,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-19 21:59:25,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:25,689 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:25,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:59:25,689 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:25,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:25,690 INFO L85 PathProgramCache]: Analyzing trace with hash -2024737643, now seen corresponding path program 1 times [2024-11-19 21:59:25,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:25,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154507869] [2024-11-19 21:59:25,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:25,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:25,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:59:25,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:59:25,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:59:25,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:59:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:25,793 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-19 21:59:25,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:25,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154507869] [2024-11-19 21:59:25,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154507869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:25,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:25,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:25,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372248984] [2024-11-19 21:59:25,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:25,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:25,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:25,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:25,797 INFO L87 Difference]: Start difference. First operand 3205 states and 5462 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:26,587 INFO L93 Difference]: Finished difference Result 7828 states and 13636 transitions. [2024-11-19 21:59:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:26,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-11-19 21:59:26,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:26,616 INFO L225 Difference]: With dead ends: 7828 [2024-11-19 21:59:26,616 INFO L226 Difference]: Without dead ends: 5305 [2024-11-19 21:59:26,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:26,627 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 687 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 702 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:26,627 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [702 Valid, 680 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 21:59:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5305 states. [2024-11-19 21:59:26,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5305 to 5236. [2024-11-19 21:59:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 4269 states have (on average 1.6160693370812838) internal successors, (6899), 4274 states have internal predecessors, (6899), 947 states have call successors, (947), 15 states have call predecessors, (947), 19 states have return successors, (1064), 946 states have call predecessors, (1064), 946 states have call successors, (1064) [2024-11-19 21:59:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 8910 transitions. [2024-11-19 21:59:26,937 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 8910 transitions. Word has length 107 [2024-11-19 21:59:26,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:26,938 INFO L471 AbstractCegarLoop]: Abstraction has 5236 states and 8910 transitions. [2024-11-19 21:59:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:26,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 8910 transitions. [2024-11-19 21:59:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 21:59:26,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:26,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:26,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:59:26,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:26,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1474288188, now seen corresponding path program 1 times [2024-11-19 21:59:26,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:26,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183979109] [2024-11-19 21:59:26,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:26,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:59:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:59:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:59:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:59:27,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:27,036 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-19 21:59:27,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:27,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183979109] [2024-11-19 21:59:27,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183979109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:27,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:27,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:27,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085345115] [2024-11-19 21:59:27,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:27,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:27,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:27,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:27,038 INFO L87 Difference]: Start difference. First operand 5236 states and 8910 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:28,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:28,018 INFO L93 Difference]: Finished difference Result 12970 states and 22545 transitions. [2024-11-19 21:59:28,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:28,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-11-19 21:59:28,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:28,062 INFO L225 Difference]: With dead ends: 12970 [2024-11-19 21:59:28,062 INFO L226 Difference]: Without dead ends: 8793 [2024-11-19 21:59:28,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:28,078 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 685 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:28,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 652 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:28,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2024-11-19 21:59:28,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 8724. [2024-11-19 21:59:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8724 states, 7151 states have (on average 1.6127814291707454) internal successors, (11533), 7156 states have internal predecessors, (11533), 1553 states have call successors, (1553), 15 states have call predecessors, (1553), 19 states have return successors, (1748), 1552 states have call predecessors, (1748), 1552 states have call successors, (1748) [2024-11-19 21:59:28,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8724 states to 8724 states and 14834 transitions. [2024-11-19 21:59:28,477 INFO L78 Accepts]: Start accepts. Automaton has 8724 states and 14834 transitions. Word has length 108 [2024-11-19 21:59:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:28,478 INFO L471 AbstractCegarLoop]: Abstraction has 8724 states and 14834 transitions. [2024-11-19 21:59:28,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:28,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8724 states and 14834 transitions. [2024-11-19 21:59:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:59:28,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:28,491 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:28,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:59:28,491 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:28,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:28,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1586732247, now seen corresponding path program 1 times [2024-11-19 21:59:28,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:28,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113468315] [2024-11-19 21:59:28,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:28,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:28,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:28,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:59:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:59:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:59:28,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:59:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:28,583 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-19 21:59:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:28,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113468315] [2024-11-19 21:59:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113468315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:28,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:28,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:28,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624299861] [2024-11-19 21:59:28,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:28,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:28,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:28,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:28,586 INFO L87 Difference]: Start difference. First operand 8724 states and 14834 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:29,720 INFO L93 Difference]: Finished difference Result 22629 states and 39251 transitions. [2024-11-19 21:59:29,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:29,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2024-11-19 21:59:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:29,805 INFO L225 Difference]: With dead ends: 22629 [2024-11-19 21:59:29,806 INFO L226 Difference]: Without dead ends: 15386 [2024-11-19 21:59:29,961 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:29,963 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 683 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:29,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 660 Invalid, 1032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 21:59:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15386 states. [2024-11-19 21:59:30,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15386 to 15317. [2024-11-19 21:59:30,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15317 states, 12541 states have (on average 1.6026632644924648) internal successors, (20099), 12546 states have internal predecessors, (20099), 2756 states have call successors, (2756), 15 states have call predecessors, (2756), 19 states have return successors, (3095), 2755 states have call predecessors, (3095), 2755 states have call successors, (3095) [2024-11-19 21:59:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15317 states to 15317 states and 25950 transitions. [2024-11-19 21:59:30,786 INFO L78 Accepts]: Start accepts. Automaton has 15317 states and 25950 transitions. Word has length 109 [2024-11-19 21:59:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:30,786 INFO L471 AbstractCegarLoop]: Abstraction has 15317 states and 25950 transitions. [2024-11-19 21:59:30,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 15317 states and 25950 transitions. [2024-11-19 21:59:30,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:59:30,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:30,804 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:30,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:59:30,804 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:30,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:30,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1070991099, now seen corresponding path program 1 times [2024-11-19 21:59:30,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:30,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789348540] [2024-11-19 21:59:30,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:30,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:30,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:59:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:59:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:59:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:59:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:30,902 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-19 21:59:30,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:30,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789348540] [2024-11-19 21:59:30,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789348540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:30,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:30,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:30,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564248750] [2024-11-19 21:59:30,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:30,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:30,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:30,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:30,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:30,905 INFO L87 Difference]: Start difference. First operand 15317 states and 25950 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:32,261 INFO L93 Difference]: Finished difference Result 40585 states and 70234 transitions. [2024-11-19 21:59:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:32,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2024-11-19 21:59:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:32,372 INFO L225 Difference]: With dead ends: 40585 [2024-11-19 21:59:32,372 INFO L226 Difference]: Without dead ends: 27356 [2024-11-19 21:59:32,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:32,409 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 681 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 841 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:32,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 646 Invalid, 1025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 841 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:32,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27356 states. [2024-11-19 21:59:33,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27356 to 27287. [2024-11-19 21:59:33,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27287 states, 22472 states have (on average 1.5978551085795656) internal successors, (35907), 22477 states have internal predecessors, (35907), 4795 states have call successors, (4795), 15 states have call predecessors, (4795), 19 states have return successors, (5408), 4794 states have call predecessors, (5408), 4794 states have call successors, (5408) [2024-11-19 21:59:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27287 states to 27287 states and 46110 transitions. [2024-11-19 21:59:33,693 INFO L78 Accepts]: Start accepts. Automaton has 27287 states and 46110 transitions. Word has length 110 [2024-11-19 21:59:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 27287 states and 46110 transitions. [2024-11-19 21:59:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 27287 states and 46110 transitions. [2024-11-19 21:59:33,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:59:33,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:33,714 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:33,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:59:33,714 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:33,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:33,715 INFO L85 PathProgramCache]: Analyzing trace with hash -681781895, now seen corresponding path program 1 times [2024-11-19 21:59:33,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:33,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118689734] [2024-11-19 21:59:33,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:33,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:33,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:33,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:33,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:59:33,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:59:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:59:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:59:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:33,822 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-19 21:59:33,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:33,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118689734] [2024-11-19 21:59:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118689734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:33,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:33,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:33,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784636877] [2024-11-19 21:59:33,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:33,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:33,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:33,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:33,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:33,825 INFO L87 Difference]: Start difference. First operand 27287 states and 46110 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:35,672 INFO L93 Difference]: Finished difference Result 74372 states and 127833 transitions. [2024-11-19 21:59:35,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:35,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2024-11-19 21:59:35,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:35,873 INFO L225 Difference]: With dead ends: 74372 [2024-11-19 21:59:35,873 INFO L226 Difference]: Without dead ends: 49905 [2024-11-19 21:59:35,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:35,936 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 679 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:35,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 647 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:35,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49905 states. [2024-11-19 21:59:37,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49905 to 49836. [2024-11-19 21:59:37,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49836 states, 41306 states have (on average 1.5917300150099258) internal successors, (65748), 41311 states have internal predecessors, (65748), 8510 states have call successors, (8510), 15 states have call predecessors, (8510), 19 states have return successors, (9655), 8509 states have call predecessors, (9655), 8509 states have call successors, (9655) [2024-11-19 21:59:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49836 states to 49836 states and 83913 transitions. [2024-11-19 21:59:38,147 INFO L78 Accepts]: Start accepts. Automaton has 49836 states and 83913 transitions. Word has length 111 [2024-11-19 21:59:38,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:38,148 INFO L471 AbstractCegarLoop]: Abstraction has 49836 states and 83913 transitions. [2024-11-19 21:59:38,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:38,148 INFO L276 IsEmpty]: Start isEmpty. Operand 49836 states and 83913 transitions. [2024-11-19 21:59:38,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:59:38,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:38,170 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:38,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:59:38,170 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash 687328741, now seen corresponding path program 1 times [2024-11-19 21:59:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139664705] [2024-11-19 21:59:38,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:38,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:38,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:38,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:38,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:38,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:59:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:59:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:59:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:59:38,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:38,276 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-19 21:59:38,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:38,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139664705] [2024-11-19 21:59:38,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139664705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:38,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:38,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 21:59:38,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898333521] [2024-11-19 21:59:38,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:38,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 21:59:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:38,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 21:59:38,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 21:59:38,280 INFO L87 Difference]: Start difference. First operand 49836 states and 83913 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:41,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:41,138 INFO L93 Difference]: Finished difference Result 92858 states and 159964 transitions. [2024-11-19 21:59:41,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 21:59:41,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-19 21:59:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:41,748 INFO L225 Difference]: With dead ends: 92858 [2024-11-19 21:59:41,748 INFO L226 Difference]: Without dead ends: 92749 [2024-11-19 21:59:41,784 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:41,785 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 674 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:41,785 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 678 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 21:59:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92749 states. [2024-11-19 21:59:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92749 to 92680. [2024-11-19 21:59:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92680 states, 77351 states have (on average 1.5841294876601466) internal successors, (122534), 77356 states have internal predecessors, (122534), 15309 states have call successors, (15309), 15 states have call predecessors, (15309), 19 states have return successors, (17500), 15308 states have call predecessors, (17500), 15308 states have call successors, (17500) [2024-11-19 21:59:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92680 states to 92680 states and 155343 transitions. [2024-11-19 21:59:45,080 INFO L78 Accepts]: Start accepts. Automaton has 92680 states and 155343 transitions. Word has length 112 [2024-11-19 21:59:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:45,081 INFO L471 AbstractCegarLoop]: Abstraction has 92680 states and 155343 transitions. [2024-11-19 21:59:45,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-19 21:59:45,081 INFO L276 IsEmpty]: Start isEmpty. Operand 92680 states and 155343 transitions. [2024-11-19 21:59:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:59:45,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:59:45,099 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:45,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 21:59:45,099 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:59:45,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:59:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash 790398392, now seen corresponding path program 1 times [2024-11-19 21:59:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:59:45,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415116923] [2024-11-19 21:59:45,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:59:45,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:59:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:59:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:59:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:59:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:59:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:59:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:59:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:59:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:59:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:59:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:59:45,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:59:45,320 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-19 21:59:45,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:59:45,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415116923] [2024-11-19 21:59:45,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415116923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:59:45,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:59:45,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 21:59:45,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216107315] [2024-11-19 21:59:45,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:59:45,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 21:59:45,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:59:45,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 21:59:45,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:59:45,324 INFO L87 Difference]: Start difference. First operand 92680 states and 155343 transitions. Second operand has 10 states, 10 states have (on average 7.8) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-19 21:59:48,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:59:48,433 INFO L93 Difference]: Finished difference Result 92739 states and 158710 transitions. [2024-11-19 21:59:48,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 21:59:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 113 [2024-11-19 21:59:48,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:59:48,462 INFO L225 Difference]: With dead ends: 92739 [2024-11-19 21:59:48,462 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 21:59:48,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-19 21:59:48,635 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 592 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 2330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:59:48,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1192 Invalid, 2330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:59:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 21:59:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 21:59:48,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 21:59:48,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 21:59:48,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 113 [2024-11-19 21:59:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:59:48,663 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 21:59:48,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.8) internal successors, (78), 6 states have internal predecessors, (78), 1 states have call successors, (12), 4 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-19 21:59:48,664 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 21:59:48,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 21:59:48,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:59:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:59:48,669 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:59:48,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-19 21:59:55,580 WARN L286 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-19 22:00:00,654 WARN L286 SmtUtils]: Spent 5.07s on a formula simplification. DAG size of input: 1122 DAG size of output: 3 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)