./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec9_product28.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec9_product28.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 6fc432013ed2168eea9a323e37470d64fe5b972a8b4d9d4e2e5fdd67cd32ffed --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 07:50:05,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 07:50:05,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 07:50:05,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 07:50:05,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 07:50:05,654 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 07:50:05,654 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 07:50:05,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 07:50:05,655 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 07:50:05,655 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 07:50:05,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 07:50:05,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 07:50:05,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 07:50:05,657 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 07:50:05,657 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 07:50:05,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 07:50:05,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 07:50:05,658 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 07:50:05,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 07:50:05,659 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 07:50:05,659 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 07:50:05,660 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 07:50:05,660 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 07:50:05,660 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 07:50:05,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 07:50:05,661 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 07:50:05,661 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 07:50:05,661 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 07:50:05,661 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 07:50:05,662 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 07:50:05,662 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 07:50:05,662 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 07:50:05,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:50:05,663 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 07:50:05,663 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 07:50:05,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 07:50:05,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 07:50:05,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 07:50:05,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 07:50:05,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 07:50:05,665 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 07:50:05,666 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 07:50:05,666 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 -> 6fc432013ed2168eea9a323e37470d64fe5b972a8b4d9d4e2e5fdd67cd32ffed [2024-11-16 07:50:05,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 07:50:05,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 07:50:05,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 07:50:05,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 07:50:05,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 07:50:05,856 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec9_product28.cil.c [2024-11-16 07:50:07,244 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 07:50:07,473 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 07:50:07,473 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product28.cil.c [2024-11-16 07:50:07,487 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025314363/4fbb61ff86f342a48ed7d59d1481df13/FLAG94a00fbdf [2024-11-16 07:50:07,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025314363/4fbb61ff86f342a48ed7d59d1481df13 [2024-11-16 07:50:07,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 07:50:07,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 07:50:07,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 07:50:07,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 07:50:07,816 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 07:50:07,817 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:50:07" (1/1) ... [2024-11-16 07:50:07,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ea08936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:07, skipping insertion in model container [2024-11-16 07:50:07,818 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:50:07" (1/1) ... [2024-11-16 07:50:07,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 07:50:08,640 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_spec9_product28.cil.c[63802,63815] [2024-11-16 07:50:08,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:50:08,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 07:50:08,658 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [48] [2024-11-16 07:50:08,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [105] [2024-11-16 07:50:08,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [122] [2024-11-16 07:50:08,659 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [160] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [505] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [726] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1801] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2167] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2432] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2571] [2024-11-16 07:50:08,660 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2968] [2024-11-16 07:50:08,712 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_spec9_product28.cil.c[63802,63815] [2024-11-16 07:50:08,713 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 07:50:08,738 INFO L204 MainTranslator]: Completed translation [2024-11-16 07:50:08,739 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08 WrapperNode [2024-11-16 07:50:08,739 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 07:50:08,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 07:50:08,740 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 07:50:08,740 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 07:50:08,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,768 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,804 INFO L138 Inliner]: procedures = 129, calls = 199, calls flagged for inlining = 56, calls inlined = 46, statements flattened = 872 [2024-11-16 07:50:08,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 07:50:08,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 07:50:08,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 07:50:08,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 07:50:08,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,823 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,854 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-16 07:50:08,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,874 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,889 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,896 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 07:50:08,897 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 07:50:08,897 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 07:50:08,897 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 07:50:08,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (1/1) ... [2024-11-16 07:50:08,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 07:50:08,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:08,931 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-16 07:50:08,937 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-16 07:50:08,970 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-16 07:50:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-16 07:50:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-16 07:50:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-16 07:50:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-16 07:50:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-16 07:50:08,971 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-16 07:50:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-16 07:50:08,972 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-16 07:50:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-16 07:50:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-16 07:50:08,973 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-16 07:50:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-16 07:50:08,973 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-16 07:50:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-16 07:50:08,973 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-16 07:50:08,973 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-16 07:50:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-16 07:50:08,974 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-16 07:50:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-16 07:50:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-16 07:50:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-16 07:50:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-16 07:50:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-16 07:50:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 07:50:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-16 07:50:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-16 07:50:08,975 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-16 07:50:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-16 07:50:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-16 07:50:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-16 07:50:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-16 07:50:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-16 07:50:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-16 07:50:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-16 07:50:08,977 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-16 07:50:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-16 07:50:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-16 07:50:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-16 07:50:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-16 07:50:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-16 07:50:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-16 07:50:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-16 07:50:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 07:50:08,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 07:50:08,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-16 07:50:08,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-16 07:50:08,979 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-16 07:50:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-16 07:50:08,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 07:50:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 07:50:09,163 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 07:50:09,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 07:50:09,351 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1778-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2024-11-16 07:50:09,358 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2875: #res := ~retValue_acc~41; [2024-11-16 07:50:09,373 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L423: #res := ~retValue_acc~7; [2024-11-16 07:50:09,413 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1435: #res#1 := ~retValue_acc~19#1; [2024-11-16 07:50:09,413 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1390-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2024-11-16 07:50:09,431 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1659: #res := ~retValue_acc~22; [2024-11-16 07:50:09,438 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1343: #res := ~retValue_acc~17; [2024-11-16 07:50:09,450 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2568-1: createEmail_#res#1 := createEmail_~retValue_acc~32#1; [2024-11-16 07:50:09,460 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2801: #res := ~retValue_acc~39; [2024-11-16 07:50:09,470 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2838: #res := ~retValue_acc~40; [2024-11-16 07:50:09,480 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2912: #res := ~retValue_acc~42; [2024-11-16 07:50:09,498 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2686: #res := ~retValue_acc~36; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1605-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L1498-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L157-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L380-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~4#1; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L389-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~5#1; [2024-11-16 07:50:09,817 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L398-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~6#1; [2024-11-16 07:50:09,824 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2649: #res := ~retValue_acc~35; [2024-11-16 07:50:09,831 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544: #res#1 := ~retValue_acc~30#1; [2024-11-16 07:50:09,831 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2524-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~29#1; [2024-11-16 07:50:09,936 INFO L? ?]: Removed 401 outVars from TransFormulas that were not future-live. [2024-11-16 07:50:09,937 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 07:50:09,951 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 07:50:09,952 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 07:50:09,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:50:09 BoogieIcfgContainer [2024-11-16 07:50:09,952 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 07:50:09,954 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 07:50:09,954 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 07:50:09,957 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 07:50:09,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:50:07" (1/3) ... [2024-11-16 07:50:09,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa977d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:09, skipping insertion in model container [2024-11-16 07:50:09,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:50:08" (2/3) ... [2024-11-16 07:50:09,958 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29fa977d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:50:09, skipping insertion in model container [2024-11-16 07:50:09,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:50:09" (3/3) ... [2024-11-16 07:50:09,959 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product28.cil.c [2024-11-16 07:50:09,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 07:50:09,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 07:50:10,029 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 07:50:10,035 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;@309545ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 07:50:10,035 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 07:50:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand has 341 states, 267 states have (on average 1.4943820224719102) internal successors, (399), 271 states have internal predecessors, (399), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-16 07:50:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 07:50:10,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:10,055 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:10,055 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:10,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1576807162, now seen corresponding path program 1 times [2024-11-16 07:50:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:10,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704837953] [2024-11-16 07:50:10,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-16 07:50:10,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 07:50:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 07:50:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 07:50:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 07:50:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,643 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-16 07:50:10,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:10,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704837953] [2024-11-16 07:50:10,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704837953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:10,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239934200] [2024-11-16 07:50:10,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:10,647 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-16 07:50:10,652 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-16 07:50:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:10,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 07:50:10,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:10,918 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-16 07:50:10,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239934200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-16 07:50:10,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215875824] [2024-11-16 07:50:10,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:10,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 07:50:10,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:10,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 07:50:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:50:10,950 INFO L87 Difference]: Start difference. First operand has 341 states, 267 states have (on average 1.4943820224719102) internal successors, (399), 271 states have internal predecessors, (399), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:10,990 INFO L93 Difference]: Finished difference Result 521 states and 748 transitions. [2024-11-16 07:50:10,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 07:50:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-16 07:50:10,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:11,002 INFO L225 Difference]: With dead ends: 521 [2024-11-16 07:50:11,002 INFO L226 Difference]: Without dead ends: 333 [2024-11-16 07:50:11,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:50:11,008 INFO L432 NwaCegarLoop]: 494 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, 494 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-16 07:50:11,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:11,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-16 07:50:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2024-11-16 07:50:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 260 states have (on average 1.4884615384615385) internal successors, (387), 263 states have internal predecessors, (387), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 07:50:11,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 486 transitions. [2024-11-16 07:50:11,061 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 486 transitions. Word has length 99 [2024-11-16 07:50:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:11,062 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 486 transitions. [2024-11-16 07:50:11,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:11,062 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 486 transitions. [2024-11-16 07:50:11,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-16 07:50:11,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:11,070 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:11,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 07:50:11,274 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-16 07:50:11,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:11,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:11,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1760082604, now seen corresponding path program 1 times [2024-11-16 07:50:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213835568] [2024-11-16 07:50:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:11,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:11,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 07:50:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 07:50:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 07:50:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:50:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:50:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,517 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-16 07:50:11,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213835568] [2024-11-16 07:50:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213835568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:11,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290555316] [2024-11-16 07:50:11,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:11,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:11,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:11,521 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-16 07:50:11,522 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-16 07:50:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:11,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 07:50:11,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:11,763 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-16 07:50:11,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290555316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-16 07:50:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74639584] [2024-11-16 07:50:11,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:50:11,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:11,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:50:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:11,770 INFO L87 Difference]: Start difference. First operand 333 states and 486 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:11,809 INFO L93 Difference]: Finished difference Result 511 states and 729 transitions. [2024-11-16 07:50:11,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:50:11,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 102 [2024-11-16 07:50:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:11,816 INFO L225 Difference]: With dead ends: 511 [2024-11-16 07:50:11,816 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 07:50:11,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 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-16 07:50:11,818 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 0 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:11,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:11,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 07:50:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2024-11-16 07:50:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 264 states have (on average 1.481060606060606) internal successors, (391), 267 states have internal predecessors, (391), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-16 07:50:11,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 490 transitions. [2024-11-16 07:50:11,836 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 490 transitions. Word has length 102 [2024-11-16 07:50:11,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:11,837 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 490 transitions. [2024-11-16 07:50:11,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 490 transitions. [2024-11-16 07:50:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 07:50:11,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:11,840 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:50:11,867 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-16 07:50:12,040 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-16 07:50:12,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:12,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1067805426, now seen corresponding path program 1 times [2024-11-16 07:50:12,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:12,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176744560] [2024-11-16 07:50:12,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-16 07:50:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-16 07:50:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 07:50:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 07:50:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:50:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176744560] [2024-11-16 07:50:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176744560] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927557412] [2024-11-16 07:50:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:12,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:12,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:12,239 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-16 07:50:12,239 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-16 07:50:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 07:50:12,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:12,508 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-16 07:50:12,510 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:12,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927557412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:12,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:12,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-16 07:50:12,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603668728] [2024-11-16 07:50:12,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:12,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 07:50:12,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:12,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 07:50:12,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-16 07:50:12,512 INFO L87 Difference]: Start difference. First operand 337 states and 490 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:12,553 INFO L93 Difference]: Finished difference Result 708 states and 1040 transitions. [2024-11-16 07:50:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 07:50:12,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2024-11-16 07:50:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:12,556 INFO L225 Difference]: With dead ends: 708 [2024-11-16 07:50:12,556 INFO L226 Difference]: Without dead ends: 400 [2024-11-16 07:50:12,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 130 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-16 07:50:12,561 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 109 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 937 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-16 07:50:12,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 937 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-16 07:50:12,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 392. [2024-11-16 07:50:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 308 states have (on average 1.4805194805194806) internal successors, (456), 311 states have internal predecessors, (456), 61 states have call successors, (61), 22 states have call predecessors, (61), 22 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-16 07:50:12,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 577 transitions. [2024-11-16 07:50:12,588 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 577 transitions. Word has length 110 [2024-11-16 07:50:12,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:12,589 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 577 transitions. [2024-11-16 07:50:12,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 577 transitions. [2024-11-16 07:50:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 07:50:12,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:12,591 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:50:12,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 07:50:12,794 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-16 07:50:12,795 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 2108033768, now seen corresponding path program 1 times [2024-11-16 07:50:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23687809] [2024-11-16 07:50:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:12,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-16 07:50:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-16 07:50:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-16 07:50:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-16 07:50:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-16 07:50:13,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:50:13,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 07:50:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:50:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:13,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23687809] [2024-11-16 07:50:13,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23687809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630954386] [2024-11-16 07:50:13,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:13,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:13,097 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-16 07:50:13,104 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-16 07:50:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-16 07:50:13,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:50:13,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:13,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630954386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:13,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:13,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-16 07:50:13,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055480265] [2024-11-16 07:50:13,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:13,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:50:13,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:13,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:50:13,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:50:13,450 INFO L87 Difference]: Start difference. First operand 392 states and 577 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:13,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:13,492 INFO L93 Difference]: Finished difference Result 775 states and 1144 transitions. [2024-11-16 07:50:13,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:50:13,492 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2024-11-16 07:50:13,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:13,494 INFO L225 Difference]: With dead ends: 775 [2024-11-16 07:50:13,494 INFO L226 Difference]: Without dead ends: 394 [2024-11-16 07:50:13,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 129 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-16 07:50:13,496 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 2 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1901 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-16 07:50:13,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1901 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:13,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-16 07:50:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-16 07:50:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 309 states have (on average 1.4789644012944985) internal successors, (457), 313 states have internal predecessors, (457), 61 states have call successors, (61), 22 states have call predecessors, (61), 23 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-16 07:50:13,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 580 transitions. [2024-11-16 07:50:13,508 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 580 transitions. Word has length 111 [2024-11-16 07:50:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:13,508 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 580 transitions. [2024-11-16 07:50:13,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:13,509 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 580 transitions. [2024-11-16 07:50:13,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 07:50:13,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:13,510 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 07:50:13,524 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-16 07:50:13,711 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-16 07:50:13,711 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:13,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:13,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1044962321, now seen corresponding path program 1 times [2024-11-16 07:50:13,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:13,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718228582] [2024-11-16 07:50:13,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:13,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-16 07:50:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-16 07:50:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-16 07:50:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 07:50:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 07:50:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 07:50:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 07:50:13,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 07:50:13,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:13,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718228582] [2024-11-16 07:50:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718228582] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:13,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789116621] [2024-11-16 07:50:13,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:13,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:13,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:13,890 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-16 07:50:13,891 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-16 07:50:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 07:50:14,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-16 07:50:14,132 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 07:50:14,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789116621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:14,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-16 07:50:14,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-16 07:50:14,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318259062] [2024-11-16 07:50:14,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:14,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 07:50:14,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:14,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 07:50:14,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-16 07:50:14,134 INFO L87 Difference]: Start difference. First operand 394 states and 580 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:14,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:14,178 INFO L93 Difference]: Finished difference Result 777 states and 1149 transitions. [2024-11-16 07:50:14,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 07:50:14,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2024-11-16 07:50:14,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:14,181 INFO L225 Difference]: With dead ends: 777 [2024-11-16 07:50:14,181 INFO L226 Difference]: Without dead ends: 396 [2024-11-16 07:50:14,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 129 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-16 07:50:14,183 INFO L432 NwaCegarLoop]: 476 mSDtfsCounter, 2 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1887 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-16 07:50:14,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1887 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 07:50:14,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-16 07:50:14,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-16 07:50:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.4774193548387098) internal successors, (458), 315 states have internal predecessors, (458), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-16 07:50:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 586 transitions. [2024-11-16 07:50:14,194 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 586 transitions. Word has length 112 [2024-11-16 07:50:14,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:14,194 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 586 transitions. [2024-11-16 07:50:14,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:14,195 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 586 transitions. [2024-11-16 07:50:14,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 07:50:14,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:14,196 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:14,213 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-16 07:50:14,400 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-16 07:50:14,401 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:14,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:14,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1517092447, now seen corresponding path program 1 times [2024-11-16 07:50:14,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:14,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855409833] [2024-11-16 07:50:14,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:14,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 07:50:14,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 07:50:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 07:50:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:50:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 07:50:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:14,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855409833] [2024-11-16 07:50:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855409833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:14,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:50:14,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112690025] [2024-11-16 07:50:14,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:50:14,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:14,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:50:14,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:50:14,544 INFO L87 Difference]: Start difference. First operand 396 states and 586 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:15,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:15,849 INFO L93 Difference]: Finished difference Result 842 states and 1253 transitions. [2024-11-16 07:50:15,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:15,850 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2024-11-16 07:50:15,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:15,852 INFO L225 Difference]: With dead ends: 842 [2024-11-16 07:50:15,852 INFO L226 Difference]: Without dead ends: 469 [2024-11-16 07:50:15,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 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-16 07:50:15,854 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 797 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 2116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:15,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 1003 Invalid, 2116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1875 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 07:50:15,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-16 07:50:15,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 396. [2024-11-16 07:50:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.4774193548387098) internal successors, (458), 315 states have internal predecessors, (458), 61 states have call successors, (61), 22 states have call predecessors, (61), 24 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-16 07:50:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 585 transitions. [2024-11-16 07:50:15,875 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 585 transitions. Word has length 113 [2024-11-16 07:50:15,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:15,875 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 585 transitions. [2024-11-16 07:50:15,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:15,875 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 585 transitions. [2024-11-16 07:50:15,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 07:50:15,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:15,877 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:15,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 07:50:15,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:15,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash -733005780, now seen corresponding path program 2 times [2024-11-16 07:50:15,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:15,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222795971] [2024-11-16 07:50:15,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:15,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:15,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:15,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:15,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:15,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:15,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:15,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:16,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 07:50:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 07:50:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 07:50:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 07:50:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:50:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 07:50:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:50:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-16 07:50:16,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:16,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222795971] [2024-11-16 07:50:16,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222795971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:16,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:16,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 07:50:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763786616] [2024-11-16 07:50:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:16,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 07:50:16,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 07:50:16,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 07:50:16,036 INFO L87 Difference]: Start difference. First operand 396 states and 585 transitions. Second operand has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:17,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:17,199 INFO L93 Difference]: Finished difference Result 844 states and 1256 transitions. [2024-11-16 07:50:17,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 07:50:17,200 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2024-11-16 07:50:17,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:17,202 INFO L225 Difference]: With dead ends: 844 [2024-11-16 07:50:17,203 INFO L226 Difference]: Without dead ends: 471 [2024-11-16 07:50:17,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 27 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-16 07:50:17,204 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 772 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:17,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1003 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 07:50:17,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-16 07:50:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 398. [2024-11-16 07:50:17,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 311 states have (on average 1.4758842443729903) internal successors, (459), 317 states have internal predecessors, (459), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (68), 60 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-16 07:50:17,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 588 transitions. [2024-11-16 07:50:17,243 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 588 transitions. Word has length 114 [2024-11-16 07:50:17,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:17,243 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 588 transitions. [2024-11-16 07:50:17,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.714285714285714) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (14), 5 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-16 07:50:17,243 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 588 transitions. [2024-11-16 07:50:17,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 07:50:17,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:17,246 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:17,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 07:50:17,246 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:17,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -933500540, now seen corresponding path program 1 times [2024-11-16 07:50:17,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:17,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629549084] [2024-11-16 07:50:17,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:17,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:17,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-16 07:50:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-16 07:50:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 07:50:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:50:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 07:50:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:17,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:17,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629549084] [2024-11-16 07:50:17,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629549084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:17,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:17,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 07:50:17,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451443555] [2024-11-16 07:50:17,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:17,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 07:50:17,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:17,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 07:50:17,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:50:17,438 INFO L87 Difference]: Start difference. First operand 398 states and 588 transitions. Second operand has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 07:50:19,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:19,028 INFO L93 Difference]: Finished difference Result 842 states and 1251 transitions. [2024-11-16 07:50:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 07:50:19,029 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 115 [2024-11-16 07:50:19,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:19,031 INFO L225 Difference]: With dead ends: 842 [2024-11-16 07:50:19,031 INFO L226 Difference]: Without dead ends: 471 [2024-11-16 07:50:19,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 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-16 07:50:19,033 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 809 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 3129 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 3129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:19,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 1439 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 3129 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 07:50:19,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2024-11-16 07:50:19,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 398. [2024-11-16 07:50:19,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 311 states have (on average 1.4758842443729903) internal successors, (459), 317 states have internal predecessors, (459), 61 states have call successors, (61), 22 states have call predecessors, (61), 25 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-16 07:50:19,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 587 transitions. [2024-11-16 07:50:19,052 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 587 transitions. Word has length 115 [2024-11-16 07:50:19,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:19,052 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 587 transitions. [2024-11-16 07:50:19,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.9) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 07:50:19,052 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 587 transitions. [2024-11-16 07:50:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-16 07:50:19,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:19,054 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:19,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 07:50:19,054 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:19,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:19,054 INFO L85 PathProgramCache]: Analyzing trace with hash -960643578, now seen corresponding path program 2 times [2024-11-16 07:50:19,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:19,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584292499] [2024-11-16 07:50:19,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:19,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:19,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-16 07:50:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-16 07:50:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 07:50:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:50:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:19,227 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-16 07:50:19,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:19,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584292499] [2024-11-16 07:50:19,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584292499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:19,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:19,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 07:50:19,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323274088] [2024-11-16 07:50:19,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:19,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 07:50:19,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:19,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 07:50:19,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-16 07:50:19,229 INFO L87 Difference]: Start difference. First operand 398 states and 587 transitions. Second operand has 11 states, 10 states have (on average 8.0) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 07:50:20,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:20,875 INFO L93 Difference]: Finished difference Result 844 states and 1257 transitions. [2024-11-16 07:50:20,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 07:50:20,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2024-11-16 07:50:20,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:20,877 INFO L225 Difference]: With dead ends: 844 [2024-11-16 07:50:20,877 INFO L226 Difference]: Without dead ends: 473 [2024-11-16 07:50:20,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 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-16 07:50:20,879 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 790 mSDsluCounter, 1261 mSDsCounter, 0 mSdLazyCounter, 3241 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 3241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:20,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 1440 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 3241 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 07:50:20,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-16 07:50:20,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 400. [2024-11-16 07:50:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 312 states have (on average 1.4743589743589745) internal successors, (460), 319 states have internal predecessors, (460), 61 states have call successors, (61), 22 states have call predecessors, (61), 26 states have return successors, (72), 60 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-16 07:50:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 593 transitions. [2024-11-16 07:50:20,912 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 593 transitions. Word has length 116 [2024-11-16 07:50:20,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:20,912 INFO L471 AbstractCegarLoop]: Abstraction has 400 states and 593 transitions. [2024-11-16 07:50:20,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.0) internal successors, (80), 8 states have internal predecessors, (80), 4 states have call successors, (14), 5 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-16 07:50:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 593 transitions. [2024-11-16 07:50:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-16 07:50:20,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:20,914 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:20,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 07:50:20,914 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:20,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:20,918 INFO L85 PathProgramCache]: Analyzing trace with hash 650145415, now seen corresponding path program 1 times [2024-11-16 07:50:20,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:20,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931973398] [2024-11-16 07:50:20,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:20,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:21,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:21,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:21,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-16 07:50:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-16 07:50:21,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 07:50:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:50:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:50:21,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:21,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931973398] [2024-11-16 07:50:21,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931973398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 07:50:21,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533014307] [2024-11-16 07:50:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 07:50:21,069 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-16 07:50:21,076 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-16 07:50:21,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:21,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 1012 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 07:50:21,297 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 07:50:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:21,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 07:50:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:21,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533014307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 07:50:21,468 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 07:50:21,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-16 07:50:21,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530324402] [2024-11-16 07:50:21,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 07:50:21,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 07:50:21,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:21,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 07:50:21,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:21,471 INFO L87 Difference]: Start difference. First operand 400 states and 593 transitions. Second operand has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 07:50:22,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:22,792 INFO L93 Difference]: Finished difference Result 1031 states and 1588 transitions. [2024-11-16 07:50:22,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 07:50:22,792 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2024-11-16 07:50:22,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:22,796 INFO L225 Difference]: With dead ends: 1031 [2024-11-16 07:50:22,796 INFO L226 Difference]: Without dead ends: 857 [2024-11-16 07:50:22,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 255 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-16 07:50:22,802 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 1236 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1281 SdHoareTripleChecker+Valid, 1407 SdHoareTripleChecker+Invalid, 2698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:22,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1281 Valid, 1407 Invalid, 2698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-16 07:50:22,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2024-11-16 07:50:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 760. [2024-11-16 07:50:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 608 states have (on average 1.5049342105263157) internal successors, (915), 615 states have internal predecessors, (915), 125 states have call successors, (125), 22 states have call predecessors, (125), 26 states have return successors, (146), 124 states have call predecessors, (146), 124 states have call successors, (146) [2024-11-16 07:50:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1186 transitions. [2024-11-16 07:50:22,853 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1186 transitions. Word has length 117 [2024-11-16 07:50:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:22,856 INFO L471 AbstractCegarLoop]: Abstraction has 760 states and 1186 transitions. [2024-11-16 07:50:22,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.6) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (28), 5 states have call predecessors, (28), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-16 07:50:22,856 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1186 transitions. [2024-11-16 07:50:22,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-16 07:50:22,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:22,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:22,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 07:50:23,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 07:50:23,064 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:23,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:23,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1846280713, now seen corresponding path program 1 times [2024-11-16 07:50:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:23,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434984572] [2024-11-16 07:50:23,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:23,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:23,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:23,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 07:50:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 07:50:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 07:50:23,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 07:50:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 07:50:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 07:50:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:23,184 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-16 07:50:23,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:23,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434984572] [2024-11-16 07:50:23,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434984572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:23,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:23,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:23,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013626116] [2024-11-16 07:50:23,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:23,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:23,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:23,190 INFO L87 Difference]: Start difference. First operand 760 states and 1186 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:24,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:24,148 INFO L93 Difference]: Finished difference Result 1888 states and 3003 transitions. [2024-11-16 07:50:24,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:24,148 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 130 [2024-11-16 07:50:24,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:24,153 INFO L225 Difference]: With dead ends: 1888 [2024-11-16 07:50:24,153 INFO L226 Difference]: Without dead ends: 1200 [2024-11-16 07:50:24,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:24,156 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 901 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:24,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 748 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:50:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2024-11-16 07:50:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1119. [2024-11-16 07:50:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1119 states, 903 states have (on average 1.504983388704319) internal successors, (1359), 910 states have internal predecessors, (1359), 189 states have call successors, (189), 22 states have call predecessors, (189), 26 states have return successors, (220), 188 states have call predecessors, (220), 188 states have call successors, (220) [2024-11-16 07:50:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1768 transitions. [2024-11-16 07:50:24,199 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1768 transitions. Word has length 130 [2024-11-16 07:50:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:24,199 INFO L471 AbstractCegarLoop]: Abstraction has 1119 states and 1768 transitions. [2024-11-16 07:50:24,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1768 transitions. [2024-11-16 07:50:24,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-16 07:50:24,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:24,203 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:24,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 07:50:24,203 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:24,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:24,203 INFO L85 PathProgramCache]: Analyzing trace with hash -2080912021, now seen corresponding path program 1 times [2024-11-16 07:50:24,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:24,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329796066] [2024-11-16 07:50:24,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:24,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:24,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:24,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-16 07:50:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-16 07:50:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 07:50:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-16 07:50:24,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 07:50:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:24,288 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-16 07:50:24,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329796066] [2024-11-16 07:50:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329796066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:24,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:24,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:24,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810424282] [2024-11-16 07:50:24,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:24,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:24,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:24,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:24,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:24,290 INFO L87 Difference]: Start difference. First operand 1119 states and 1768 transitions. Second operand has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:25,303 INFO L93 Difference]: Finished difference Result 2750 states and 4395 transitions. [2024-11-16 07:50:25,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:25,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 131 [2024-11-16 07:50:25,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:25,315 INFO L225 Difference]: With dead ends: 2750 [2024-11-16 07:50:25,315 INFO L226 Difference]: Without dead ends: 1764 [2024-11-16 07:50:25,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:25,319 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 896 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:25,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 732 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-16 07:50:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2024-11-16 07:50:25,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1683. [2024-11-16 07:50:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1683 states, 1372 states have (on average 1.5029154518950438) internal successors, (2062), 1379 states have internal predecessors, (2062), 284 states have call successors, (284), 22 states have call predecessors, (284), 26 states have return successors, (315), 283 states have call predecessors, (315), 283 states have call successors, (315) [2024-11-16 07:50:25,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2661 transitions. [2024-11-16 07:50:25,369 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2661 transitions. Word has length 131 [2024-11-16 07:50:25,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:25,369 INFO L471 AbstractCegarLoop]: Abstraction has 1683 states and 2661 transitions. [2024-11-16 07:50:25,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.333333333333334) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:25,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2661 transitions. [2024-11-16 07:50:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-16 07:50:25,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:25,375 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:25,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 07:50:25,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:25,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1600793737, now seen corresponding path program 1 times [2024-11-16 07:50:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:25,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883882854] [2024-11-16 07:50:25,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-16 07:50:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-16 07:50:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 07:50:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:50:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 07:50:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 07:50:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:25,466 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-16 07:50:25,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:25,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883882854] [2024-11-16 07:50:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883882854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422149871] [2024-11-16 07:50:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:25,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:25,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:25,468 INFO L87 Difference]: Start difference. First operand 1683 states and 2661 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:26,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:26,345 INFO L93 Difference]: Finished difference Result 4032 states and 6471 transitions. [2024-11-16 07:50:26,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:26,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 132 [2024-11-16 07:50:26,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:26,356 INFO L225 Difference]: With dead ends: 4032 [2024-11-16 07:50:26,356 INFO L226 Difference]: Without dead ends: 2625 [2024-11-16 07:50:26,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:26,360 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 879 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:26,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 701 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 07:50:26,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2024-11-16 07:50:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2544. [2024-11-16 07:50:26,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 2110 states have (on average 1.5004739336492892) internal successors, (3166), 2117 states have internal predecessors, (3166), 407 states have call successors, (407), 22 states have call predecessors, (407), 26 states have return successors, (454), 406 states have call predecessors, (454), 406 states have call successors, (454) [2024-11-16 07:50:26,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 4027 transitions. [2024-11-16 07:50:26,430 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 4027 transitions. Word has length 132 [2024-11-16 07:50:26,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:26,430 INFO L471 AbstractCegarLoop]: Abstraction has 2544 states and 4027 transitions. [2024-11-16 07:50:26,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 4027 transitions. [2024-11-16 07:50:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-16 07:50:26,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:26,438 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:26,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 07:50:26,438 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:26,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:26,438 INFO L85 PathProgramCache]: Analyzing trace with hash 154380683, now seen corresponding path program 1 times [2024-11-16 07:50:26,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:26,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314287192] [2024-11-16 07:50:26,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:26,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-16 07:50:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-16 07:50:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:50:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 07:50:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 07:50:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-16 07:50:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:26,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314287192] [2024-11-16 07:50:26,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314287192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975103818] [2024-11-16 07:50:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:26,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:26,514 INFO L87 Difference]: Start difference. First operand 2544 states and 4027 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:27,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:27,410 INFO L93 Difference]: Finished difference Result 6039 states and 9713 transitions. [2024-11-16 07:50:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-11-16 07:50:27,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:27,426 INFO L225 Difference]: With dead ends: 6039 [2024-11-16 07:50:27,426 INFO L226 Difference]: Without dead ends: 4008 [2024-11-16 07:50:27,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:27,432 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 874 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:27,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 701 Invalid, 1312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:50:27,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4008 states. [2024-11-16 07:50:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4008 to 3927. [2024-11-16 07:50:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3927 states, 3314 states have (on average 1.4969824984912492) internal successors, (4961), 3321 states have internal predecessors, (4961), 586 states have call successors, (586), 22 states have call predecessors, (586), 26 states have return successors, (659), 585 states have call predecessors, (659), 585 states have call successors, (659) [2024-11-16 07:50:27,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3927 states to 3927 states and 6206 transitions. [2024-11-16 07:50:27,544 INFO L78 Accepts]: Start accepts. Automaton has 3927 states and 6206 transitions. Word has length 133 [2024-11-16 07:50:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:27,544 INFO L471 AbstractCegarLoop]: Abstraction has 3927 states and 6206 transitions. [2024-11-16 07:50:27,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 3927 states and 6206 transitions. [2024-11-16 07:50:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-16 07:50:27,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:27,553 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:27,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 07:50:27,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:27,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash 628848791, now seen corresponding path program 1 times [2024-11-16 07:50:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435544999] [2024-11-16 07:50:27,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:27,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:27,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:27,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-16 07:50:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-16 07:50:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-16 07:50:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-16 07:50:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 07:50:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:27,665 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-16 07:50:27,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:27,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435544999] [2024-11-16 07:50:27,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435544999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:27,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:27,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:27,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091627082] [2024-11-16 07:50:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:27,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:27,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:27,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:27,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:27,667 INFO L87 Difference]: Start difference. First operand 3927 states and 6206 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:28,555 INFO L93 Difference]: Finished difference Result 9629 states and 15484 transitions. [2024-11-16 07:50:28,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:28,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 134 [2024-11-16 07:50:28,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:28,582 INFO L225 Difference]: With dead ends: 9629 [2024-11-16 07:50:28,582 INFO L226 Difference]: Without dead ends: 6500 [2024-11-16 07:50:28,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:28,591 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 865 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 282 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:28,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 732 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [282 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 07:50:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6500 states. [2024-11-16 07:50:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6500 to 6419. [2024-11-16 07:50:28,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6419 states, 5430 states have (on average 1.4869244935543278) internal successors, (8074), 5437 states have internal predecessors, (8074), 962 states have call successors, (962), 22 states have call predecessors, (962), 26 states have return successors, (1079), 961 states have call predecessors, (1079), 961 states have call successors, (1079) [2024-11-16 07:50:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6419 states to 6419 states and 10115 transitions. [2024-11-16 07:50:28,863 INFO L78 Accepts]: Start accepts. Automaton has 6419 states and 10115 transitions. Word has length 134 [2024-11-16 07:50:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:28,863 INFO L471 AbstractCegarLoop]: Abstraction has 6419 states and 10115 transitions. [2024-11-16 07:50:28,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 6419 states and 10115 transitions. [2024-11-16 07:50:28,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-16 07:50:28,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:28,875 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:28,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 07:50:28,875 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:28,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:28,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1721507435, now seen corresponding path program 1 times [2024-11-16 07:50:28,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:28,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402919959] [2024-11-16 07:50:28,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:28,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:28,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 07:50:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 07:50:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-16 07:50:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:50:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-16 07:50:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-16 07:50:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:28,950 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-16 07:50:28,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:28,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402919959] [2024-11-16 07:50:28,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402919959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:28,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:28,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:28,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387071351] [2024-11-16 07:50:28,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:28,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:28,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:28,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:28,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:28,953 INFO L87 Difference]: Start difference. First operand 6419 states and 10115 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:29,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:29,894 INFO L93 Difference]: Finished difference Result 15990 states and 25612 transitions. [2024-11-16 07:50:29,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:29,894 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 135 [2024-11-16 07:50:29,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:29,929 INFO L225 Difference]: With dead ends: 15990 [2024-11-16 07:50:29,930 INFO L226 Difference]: Without dead ends: 10824 [2024-11-16 07:50:29,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 07:50:29,945 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 902 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:29,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 731 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:50:29,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10824 states. [2024-11-16 07:50:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10824 to 10743. [2024-11-16 07:50:30,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10743 states, 9148 states have (on average 1.480542195015304) internal successors, (13544), 9155 states have internal predecessors, (13544), 1568 states have call successors, (1568), 22 states have call predecessors, (1568), 26 states have return successors, (1763), 1567 states have call predecessors, (1763), 1567 states have call successors, (1763) [2024-11-16 07:50:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10743 states to 10743 states and 16875 transitions. [2024-11-16 07:50:30,240 INFO L78 Accepts]: Start accepts. Automaton has 10743 states and 16875 transitions. Word has length 135 [2024-11-16 07:50:30,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:30,241 INFO L471 AbstractCegarLoop]: Abstraction has 10743 states and 16875 transitions. [2024-11-16 07:50:30,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 10743 states and 16875 transitions. [2024-11-16 07:50:30,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-16 07:50:30,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:30,256 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:30,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 07:50:30,257 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:30,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1496686057, now seen corresponding path program 1 times [2024-11-16 07:50:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:30,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524870159] [2024-11-16 07:50:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 07:50:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 07:50:30,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-16 07:50:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-16 07:50:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-16 07:50:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 07:50:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:30,326 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-16 07:50:30,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:30,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524870159] [2024-11-16 07:50:30,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524870159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:30,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:30,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:30,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402495837] [2024-11-16 07:50:30,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:30,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:30,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:30,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:30,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:30,329 INFO L87 Difference]: Start difference. First operand 10743 states and 16875 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:31,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:31,426 INFO L93 Difference]: Finished difference Result 27942 states and 44611 transitions. [2024-11-16 07:50:31,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:31,426 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 136 [2024-11-16 07:50:31,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:31,484 INFO L225 Difference]: With dead ends: 27942 [2024-11-16 07:50:31,484 INFO L226 Difference]: Without dead ends: 18982 [2024-11-16 07:50:31,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:31,508 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 899 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 1301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:31,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 722 Invalid, 1301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 07:50:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18982 states. [2024-11-16 07:50:32,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18982 to 18901. [2024-11-16 07:50:32,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18901 states, 16103 states have (on average 1.4702229398248774) internal successors, (23675), 16110 states have internal predecessors, (23675), 2771 states have call successors, (2771), 22 states have call predecessors, (2771), 26 states have return successors, (3110), 2770 states have call predecessors, (3110), 2770 states have call successors, (3110) [2024-11-16 07:50:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18901 states to 18901 states and 29556 transitions. [2024-11-16 07:50:32,117 INFO L78 Accepts]: Start accepts. Automaton has 18901 states and 29556 transitions. Word has length 136 [2024-11-16 07:50:32,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:32,117 INFO L471 AbstractCegarLoop]: Abstraction has 18901 states and 29556 transitions. [2024-11-16 07:50:32,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 18901 states and 29556 transitions. [2024-11-16 07:50:32,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-16 07:50:32,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:32,138 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:32,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 07:50:32,138 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:32,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:32,138 INFO L85 PathProgramCache]: Analyzing trace with hash -502407349, now seen corresponding path program 1 times [2024-11-16 07:50:32,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:32,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347542535] [2024-11-16 07:50:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:32,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:32,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:32,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:32,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:32,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-16 07:50:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-16 07:50:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-16 07:50:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-16 07:50:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-16 07:50:32,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-16 07:50:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:32,232 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-16 07:50:32,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:32,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347542535] [2024-11-16 07:50:32,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347542535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:32,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:32,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:32,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402072464] [2024-11-16 07:50:32,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:32,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:32,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:32,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:32,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:32,235 INFO L87 Difference]: Start difference. First operand 18901 states and 29556 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:33,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:33,513 INFO L93 Difference]: Finished difference Result 50320 states and 80016 transitions. [2024-11-16 07:50:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:33,514 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 137 [2024-11-16 07:50:33,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:33,833 INFO L225 Difference]: With dead ends: 50320 [2024-11-16 07:50:33,833 INFO L226 Difference]: Without dead ends: 33952 [2024-11-16 07:50:33,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:33,873 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 904 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:33,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 702 Invalid, 1279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:50:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33952 states. [2024-11-16 07:50:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33952 to 33871. [2024-11-16 07:50:34,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33871 states, 29034 states have (on average 1.4632155404009093) internal successors, (42483), 29041 states have internal predecessors, (42483), 4810 states have call successors, (4810), 22 states have call predecessors, (4810), 26 states have return successors, (5423), 4809 states have call predecessors, (5423), 4809 states have call successors, (5423) [2024-11-16 07:50:34,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33871 states to 33871 states and 52716 transitions. [2024-11-16 07:50:34,935 INFO L78 Accepts]: Start accepts. Automaton has 33871 states and 52716 transitions. Word has length 137 [2024-11-16 07:50:34,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:34,937 INFO L471 AbstractCegarLoop]: Abstraction has 33871 states and 52716 transitions. [2024-11-16 07:50:34,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:34,937 INFO L276 IsEmpty]: Start isEmpty. Operand 33871 states and 52716 transitions. [2024-11-16 07:50:34,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-16 07:50:34,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:34,964 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:34,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 07:50:34,964 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:34,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1484149687, now seen corresponding path program 1 times [2024-11-16 07:50:34,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:34,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009195793] [2024-11-16 07:50:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-16 07:50:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-16 07:50:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 07:50:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 07:50:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 07:50:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 07:50:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:35,068 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-16 07:50:35,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:35,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009195793] [2024-11-16 07:50:35,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009195793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:35,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:35,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919806372] [2024-11-16 07:50:35,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:35,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:35,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:35,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:35,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:35,071 INFO L87 Difference]: Start difference. First operand 33871 states and 52716 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:37,155 INFO L93 Difference]: Finished difference Result 92769 states and 146277 transitions. [2024-11-16 07:50:37,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:37,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 138 [2024-11-16 07:50:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:37,402 INFO L225 Difference]: With dead ends: 92769 [2024-11-16 07:50:37,402 INFO L226 Difference]: Without dead ends: 62346 [2024-11-16 07:50:37,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:37,478 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 867 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 294 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:37,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 712 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [294 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 07:50:37,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62346 states. [2024-11-16 07:50:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62346 to 62265. [2024-11-16 07:50:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62265 states, 53713 states have (on average 1.45530877068866) internal successors, (78169), 53720 states have internal predecessors, (78169), 8525 states have call successors, (8525), 22 states have call predecessors, (8525), 26 states have return successors, (9670), 8524 states have call predecessors, (9670), 8524 states have call successors, (9670) [2024-11-16 07:50:39,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62265 states to 62265 states and 96364 transitions. [2024-11-16 07:50:39,457 INFO L78 Accepts]: Start accepts. Automaton has 62265 states and 96364 transitions. Word has length 138 [2024-11-16 07:50:39,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:39,459 INFO L471 AbstractCegarLoop]: Abstraction has 62265 states and 96364 transitions. [2024-11-16 07:50:39,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:39,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62265 states and 96364 transitions. [2024-11-16 07:50:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 07:50:39,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:39,482 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:39,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 07:50:39,482 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:39,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:39,482 INFO L85 PathProgramCache]: Analyzing trace with hash 840934347, now seen corresponding path program 1 times [2024-11-16 07:50:39,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:39,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876182926] [2024-11-16 07:50:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:39,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:39,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:39,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:39,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-16 07:50:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-16 07:50:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 07:50:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-16 07:50:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 07:50:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-16 07:50:39,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:39,576 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-16 07:50:39,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:39,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876182926] [2024-11-16 07:50:39,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876182926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:39,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 07:50:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168085927] [2024-11-16 07:50:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:39,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 07:50:39,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 07:50:39,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 07:50:39,578 INFO L87 Difference]: Start difference. First operand 62265 states and 96364 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:42,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:42,260 INFO L93 Difference]: Finished difference Result 116867 states and 184020 transitions. [2024-11-16 07:50:42,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 07:50:42,261 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 139 [2024-11-16 07:50:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:42,610 INFO L225 Difference]: With dead ends: 116867 [2024-11-16 07:50:42,611 INFO L226 Difference]: Without dead ends: 116693 [2024-11-16 07:50:42,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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-16 07:50:42,654 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 871 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:42,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 734 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-16 07:50:42,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116693 states. [2024-11-16 07:50:45,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116693 to 116612. [2024-11-16 07:50:45,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116612 states, 101261 states have (on average 1.446341632020225) internal successors, (146458), 101268 states have internal predecessors, (146458), 15324 states have call successors, (15324), 22 states have call predecessors, (15324), 26 states have return successors, (17515), 15323 states have call predecessors, (17515), 15323 states have call successors, (17515) [2024-11-16 07:50:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116612 states to 116612 states and 179297 transitions. [2024-11-16 07:50:46,149 INFO L78 Accepts]: Start accepts. Automaton has 116612 states and 179297 transitions. Word has length 139 [2024-11-16 07:50:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:50:46,149 INFO L471 AbstractCegarLoop]: Abstraction has 116612 states and 179297 transitions. [2024-11-16 07:50:46,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-16 07:50:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 116612 states and 179297 transitions. [2024-11-16 07:50:46,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-16 07:50:46,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:50:46,172 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:50:46,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 07:50:46,453 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:50:46,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:50:46,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1100884311, now seen corresponding path program 1 times [2024-11-16 07:50:46,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:50:46,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691053597] [2024-11-16 07:50:46,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:50:46,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:50:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:50:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:50:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:50:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:50:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:50:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:50:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:50:46,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-16 07:50:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-16 07:50:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-16 07:50:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-16 07:50:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-16 07:50:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:50:46,706 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-16 07:50:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:50:46,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691053597] [2024-11-16 07:50:46,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691053597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:50:46,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:50:46,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-16 07:50:46,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799482103] [2024-11-16 07:50:46,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:50:46,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 07:50:46,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:50:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 07:50:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-11-16 07:50:46,709 INFO L87 Difference]: Start difference. First operand 116612 states and 179297 transitions. Second operand has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 07:50:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 07:50:54,372 INFO L93 Difference]: Finished difference Result 232726 states and 369847 transitions. [2024-11-16 07:50:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-16 07:50:54,373 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 140 [2024-11-16 07:50:54,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 07:50:55,145 INFO L225 Difference]: With dead ends: 232726 [2024-11-16 07:50:55,145 INFO L226 Difference]: Without dead ends: 232560 [2024-11-16 07:50:55,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=512, Invalid=1938, Unknown=0, NotChecked=0, Total=2450 [2024-11-16 07:50:55,219 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 3531 mSDsluCounter, 2436 mSDsCounter, 0 mSdLazyCounter, 6269 mSolverCounterSat, 1175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3531 SdHoareTripleChecker+Valid, 2673 SdHoareTripleChecker+Invalid, 7444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1175 IncrementalHoareTripleChecker+Valid, 6269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-16 07:50:55,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3531 Valid, 2673 Invalid, 7444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1175 Valid, 6269 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-16 07:50:55,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232560 states. [2024-11-16 07:51:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232560 to 232194. [2024-11-16 07:51:02,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232194 states, 201685 states have (on average 1.4472667774004015) internal successors, (291892), 201589 states have internal predecessors, (291892), 30443 states have call successors, (30443), 59 states have call predecessors, (30443), 65 states have return successors, (38094), 30551 states have call predecessors, (38094), 30440 states have call successors, (38094) [2024-11-16 07:51:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232194 states to 232194 states and 360429 transitions. [2024-11-16 07:51:03,446 INFO L78 Accepts]: Start accepts. Automaton has 232194 states and 360429 transitions. Word has length 140 [2024-11-16 07:51:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 07:51:03,447 INFO L471 AbstractCegarLoop]: Abstraction has 232194 states and 360429 transitions. [2024-11-16 07:51:03,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.733333333333333) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (14), 6 states have call predecessors, (14), 3 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2024-11-16 07:51:03,447 INFO L276 IsEmpty]: Start isEmpty. Operand 232194 states and 360429 transitions. [2024-11-16 07:51:03,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-16 07:51:03,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 07:51:03,496 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 07:51:03,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 07:51:03,496 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 07:51:03,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 07:51:03,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1498845378, now seen corresponding path program 1 times [2024-11-16 07:51:03,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 07:51:03,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951223773] [2024-11-16 07:51:03,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 07:51:03,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 07:51:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 07:51:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-16 07:51:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-16 07:51:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-16 07:51:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-16 07:51:03,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 07:51:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 07:51:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 07:51:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-16 07:51:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-16 07:51:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-16 07:51:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-16 07:51:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 07:51:03,610 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-16 07:51:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 07:51:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951223773] [2024-11-16 07:51:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951223773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 07:51:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 07:51:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 07:51:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734557179] [2024-11-16 07:51:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 07:51:03,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 07:51:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 07:51:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 07:51:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 07:51:03,612 INFO L87 Difference]: Start difference. First operand 232194 states and 360429 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 4 states have internal predecessors, (102), 3 states have call successors, (14), 5 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)