./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product24.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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_spec3_product24.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 d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 15:03:20,793 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 15:03:20,859 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 15:03:20,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 15:03:20,868 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 15:03:20,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 15:03:20,895 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 15:03:20,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 15:03:20,896 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 15:03:20,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 15:03:20,897 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 15:03:20,897 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 15:03:20,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 15:03:20,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 15:03:20,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 15:03:20,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 15:03:20,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 15:03:20,903 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 15:03:20,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 15:03:20,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 15:03:20,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 15:03:20,908 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 15:03:20,909 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 15:03:20,909 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 15:03:20,909 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 15:03:20,910 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 15:03:20,910 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 15:03:20,910 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 15:03:20,910 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 15:03:20,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 15:03:20,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 15:03:20,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 15:03:20,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:03:20,912 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 15:03:20,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 15:03:20,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 15:03:20,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 15:03:20,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 15:03:20,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 15:03:20,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 15:03:20,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 15:03:20,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 15:03:20,916 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 -> d6572e4842c262533bee65d100c3a8328a4505c101a30c259390a3fe459f824d [2024-11-08 15:03:21,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 15:03:21,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 15:03:21,191 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 15:03:21,192 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 15:03:21,193 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 15:03:21,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-11-08 15:03:22,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 15:03:23,030 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 15:03:23,031 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product24.cil.c [2024-11-08 15:03:23,063 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a45f679/cf0f5262159e446dbaacd989f5aab7c3/FLAG2298d5be4 [2024-11-08 15:03:23,077 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8a45f679/cf0f5262159e446dbaacd989f5aab7c3 [2024-11-08 15:03:23,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 15:03:23,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 15:03:23,084 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 15:03:23,084 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 15:03:23,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 15:03:23,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:23,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8898f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23, skipping insertion in model container [2024-11-08 15:03:23,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:23,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 15:03:23,660 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_spec3_product24.cil.c[52737,52750] [2024-11-08 15:03:23,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:03:23,732 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 15:03:23,742 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-08 15:03:23,743 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [97] [2024-11-08 15:03:23,743 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [410] [2024-11-08 15:03:23,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [517] [2024-11-08 15:03:23,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1588] [2024-11-08 15:03:23,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1807] [2024-11-08 15:03:23,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2211] [2024-11-08 15:03:23,744 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2536] [2024-11-08 15:03:23,745 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2545] [2024-11-08 15:03:23,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2911] [2024-11-08 15:03:23,746 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2928] [2024-11-08 15:03:23,838 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_spec3_product24.cil.c[52737,52750] [2024-11-08 15:03:23,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 15:03:23,888 INFO L204 MainTranslator]: Completed translation [2024-11-08 15:03:23,888 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23 WrapperNode [2024-11-08 15:03:23,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 15:03:23,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 15:03:23,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 15:03:23,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 15:03:23,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:23,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:23,995 INFO L138 Inliner]: procedures = 131, calls = 200, calls flagged for inlining = 62, calls inlined = 57, statements flattened = 1029 [2024-11-08 15:03:23,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 15:03:23,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 15:03:23,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 15:03:23,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 15:03:24,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,021 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,052 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-08 15:03:24,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,055 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 15:03:24,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 15:03:24,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 15:03:24,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 15:03:24,099 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (1/1) ... [2024-11-08 15:03:24,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 15:03:24,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:24,142 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-08 15:03:24,145 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-08 15:03:24,194 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-08 15:03:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-08 15:03:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-08 15:03:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-08 15:03:24,195 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-08 15:03:24,195 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-08 15:03:24,196 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-08 15:03:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-08 15:03:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-08 15:03:24,197 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-08 15:03:24,197 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-08 15:03:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-08 15:03:24,198 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-08 15:03:24,198 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2024-11-08 15:03:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-08 15:03:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-08 15:03:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-08 15:03:24,199 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-08 15:03:24,199 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-08 15:03:24,200 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-08 15:03:24,200 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-08 15:03:24,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-08 15:03:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-08 15:03:24,201 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-08 15:03:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 15:03:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 15:03:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 15:03:24,201 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 15:03:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-08 15:03:24,204 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-08 15:03:24,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 15:03:24,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 15:03:24,447 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 15:03:24,449 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 15:03:25,284 INFO L? ?]: Removed 457 outVars from TransFormulas that were not future-live. [2024-11-08 15:03:25,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 15:03:25,311 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 15:03:25,311 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 15:03:25,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:03:25 BoogieIcfgContainer [2024-11-08 15:03:25,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 15:03:25,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 15:03:25,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 15:03:25,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 15:03:25,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 03:03:23" (1/3) ... [2024-11-08 15:03:25,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8bdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:03:25, skipping insertion in model container [2024-11-08 15:03:25,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 03:03:23" (2/3) ... [2024-11-08 15:03:25,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7de8bdcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 03:03:25, skipping insertion in model container [2024-11-08 15:03:25,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 03:03:25" (3/3) ... [2024-11-08 15:03:25,320 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec3_product24.cil.c [2024-11-08 15:03:25,334 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 15:03:25,334 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 15:03:25,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 15:03:25,420 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;@144d0c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 15:03:25,420 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 15:03:25,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 342 states, 266 states have (on average 1.518796992481203) internal successors, (404), 270 states have internal predecessors, (404), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-08 15:03:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-08 15:03:25,444 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:25,445 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:25,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:25,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:25,450 INFO L85 PathProgramCache]: Analyzing trace with hash -1780526954, now seen corresponding path program 1 times [2024-11-08 15:03:25,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:25,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322699169] [2024-11-08 15:03:25,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:25,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:25,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:03:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:03:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:03:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 15:03:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-08 15:03:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:03:26,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:03:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:03:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:03:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:03:26,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,304 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-08 15:03:26,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:26,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322699169] [2024-11-08 15:03:26,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322699169] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:26,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813508090] [2024-11-08 15:03:26,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:26,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:26,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:26,309 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-08 15:03:26,310 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-08 15:03:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:26,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 15:03:26,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:26,730 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-08 15:03:26,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:03:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [813508090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:03:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-08 15:03:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413660257] [2024-11-08 15:03:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:26,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 15:03:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:26,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 15:03:26,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:03:26,765 INFO L87 Difference]: Start difference. First operand has 342 states, 266 states have (on average 1.518796992481203) internal successors, (404), 270 states have internal predecessors, (404), 54 states have call successors, (54), 20 states have call predecessors, (54), 20 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:26,815 INFO L93 Difference]: Finished difference Result 524 states and 770 transitions. [2024-11-08 15:03:26,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 15:03:26,818 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2024-11-08 15:03:26,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:26,831 INFO L225 Difference]: With dead ends: 524 [2024-11-08 15:03:26,831 INFO L226 Difference]: Without dead ends: 334 [2024-11-08 15:03:26,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:03:26,840 INFO L432 NwaCegarLoop]: 506 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, 506 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-08 15:03:26,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:03:26,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-08 15:03:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-08 15:03:26,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 260 states have (on average 1.5115384615384615) internal successors, (393), 262 states have internal predecessors, (393), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 15:03:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 498 transitions. [2024-11-08 15:03:26,906 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 498 transitions. Word has length 103 [2024-11-08 15:03:26,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:26,907 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 498 transitions. [2024-11-08 15:03:26,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:26,908 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 498 transitions. [2024-11-08 15:03:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-08 15:03:26,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:26,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:26,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 15:03:27,112 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-08 15:03:27,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 344225564, now seen corresponding path program 1 times [2024-11-08 15:03:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226552627] [2024-11-08 15:03:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:27,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:03:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:03:27,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:03:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 15:03:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-08 15:03:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:03:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:03:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:03:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:03:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:03:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,495 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-08 15:03:27,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226552627] [2024-11-08 15:03:27,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226552627] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:27,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044002487] [2024-11-08 15:03:27,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:27,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:27,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:27,499 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-08 15:03:27,500 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-08 15:03:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:27,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 1023 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 15:03:27,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:27,860 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-08 15:03:27,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:03:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044002487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:27,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:03:27,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-08 15:03:27,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441017297] [2024-11-08 15:03:27,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:27,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:03:27,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:27,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:03:27,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:03:27,869 INFO L87 Difference]: Start difference. First operand 334 states and 498 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:27,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:27,936 INFO L93 Difference]: Finished difference Result 513 states and 747 transitions. [2024-11-08 15:03:27,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:03:27,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 104 [2024-11-08 15:03:27,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:27,940 INFO L225 Difference]: With dead ends: 513 [2024-11-08 15:03:27,944 INFO L226 Difference]: Without dead ends: 337 [2024-11-08 15:03:27,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:03:27,946 INFO L432 NwaCegarLoop]: 496 mSDtfsCounter, 1 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:27,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 990 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:03:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-08 15:03:27,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 336. [2024-11-08 15:03:27,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 262 states have (on average 1.5076335877862594) internal successors, (395), 264 states have internal predecessors, (395), 54 states have call successors, (54), 20 states have call predecessors, (54), 19 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-08 15:03:27,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 500 transitions. [2024-11-08 15:03:27,984 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 500 transitions. Word has length 104 [2024-11-08 15:03:27,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:27,986 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 500 transitions. [2024-11-08 15:03:27,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 500 transitions. [2024-11-08 15:03:27,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-08 15:03:27,990 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:27,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:28,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 15:03:28,191 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-08 15:03:28,192 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:28,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:28,192 INFO L85 PathProgramCache]: Analyzing trace with hash 726734753, now seen corresponding path program 1 times [2024-11-08 15:03:28,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:28,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693310473] [2024-11-08 15:03:28,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:28,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:03:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:03:28,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:03:28,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-08 15:03:28,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:03:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:03:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:03:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:03:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:03:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:03:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:03:28,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693310473] [2024-11-08 15:03:28,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693310473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:28,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260103679] [2024-11-08 15:03:28,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:28,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:28,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:28,521 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-08 15:03:28,523 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-08 15:03:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:28,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:03:28,821 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:28,843 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-08 15:03:28,843 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:03:28,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260103679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:28,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:03:28,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-08 15:03:28,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270331764] [2024-11-08 15:03:28,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:28,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 15:03:28,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:28,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 15:03:28,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:03:28,846 INFO L87 Difference]: Start difference. First operand 336 states and 500 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:28,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:28,871 INFO L93 Difference]: Finished difference Result 707 states and 1067 transitions. [2024-11-08 15:03:28,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 15:03:28,872 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2024-11-08 15:03:28,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:28,875 INFO L225 Difference]: With dead ends: 707 [2024-11-08 15:03:28,875 INFO L226 Difference]: Without dead ends: 398 [2024-11-08 15:03:28,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-08 15:03:28,877 INFO L432 NwaCegarLoop]: 508 mSDtfsCounter, 115 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 959 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-08 15:03:28,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 959 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:03:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-08 15:03:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2024-11-08 15:03:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 305 states have (on average 1.5245901639344261) internal successors, (465), 307 states have internal predecessors, (465), 65 states have call successors, (65), 20 states have call predecessors, (65), 19 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-08 15:03:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 592 transitions. [2024-11-08 15:03:28,904 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 592 transitions. Word has length 113 [2024-11-08 15:03:28,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:28,904 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 592 transitions. [2024-11-08 15:03:28,904 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:28,904 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 592 transitions. [2024-11-08 15:03:28,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-08 15:03:28,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:28,909 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:03:28,928 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-08 15:03:29,109 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-08 15:03:29,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:29,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:29,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1706986505, now seen corresponding path program 1 times [2024-11-08 15:03:29,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:29,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823974300] [2024-11-08 15:03:29,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:29,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:29,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-08 15:03:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-08 15:03:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-08 15:03:29,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-08 15:03:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 15:03:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:03:29,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:03:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:03:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 15:03:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:03:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:03:29,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823974300] [2024-11-08 15:03:29,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823974300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:29,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926319353] [2024-11-08 15:03:29,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:29,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:29,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:29,315 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-08 15:03:29,316 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-08 15:03:29,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:29,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 15:03:29,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:03:29,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:03:29,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926319353] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:29,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:03:29,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-08 15:03:29,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306075322] [2024-11-08 15:03:29,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:29,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:03:29,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:29,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:03:29,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:03:29,689 INFO L87 Difference]: Start difference. First operand 390 states and 592 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:29,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:29,752 INFO L93 Difference]: Finished difference Result 771 states and 1174 transitions. [2024-11-08 15:03:29,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:03:29,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2024-11-08 15:03:29,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:29,759 INFO L225 Difference]: With dead ends: 771 [2024-11-08 15:03:29,759 INFO L226 Difference]: Without dead ends: 392 [2024-11-08 15:03:29,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:03:29,762 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 2 mSDsluCounter, 1459 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1949 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-08 15:03:29,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1949 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 15:03:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-08 15:03:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2024-11-08 15:03:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 306 states have (on average 1.522875816993464) internal successors, (466), 309 states have internal predecessors, (466), 65 states have call successors, (65), 20 states have call predecessors, (65), 20 states have return successors, (64), 62 states have call predecessors, (64), 62 states have call successors, (64) [2024-11-08 15:03:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 595 transitions. [2024-11-08 15:03:29,793 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 595 transitions. Word has length 114 [2024-11-08 15:03:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:29,794 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 595 transitions. [2024-11-08 15:03:29,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 states have internal predecessors, (78), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 595 transitions. [2024-11-08 15:03:29,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-08 15:03:29,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:29,798 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:03:29,821 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-08 15:03:29,998 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-08 15:03:29,999 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:30,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:30,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1134399862, now seen corresponding path program 1 times [2024-11-08 15:03:30,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:30,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219714154] [2024-11-08 15:03:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:30,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:30,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-08 15:03:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-08 15:03:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-08 15:03:30,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:03:30,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:03:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-08 15:03:30,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:03:30,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 15:03:30,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:03:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 15:03:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219714154] [2024-11-08 15:03:30,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219714154] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:30,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141136815] [2024-11-08 15:03:30,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:30,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:30,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:30,242 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-08 15:03:30,244 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-08 15:03:30,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:30,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 15:03:30,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 15:03:30,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 15:03:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141136815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:30,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 15:03:30,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-08 15:03:30,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641265337] [2024-11-08 15:03:30,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:30,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 15:03:30,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:30,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 15:03:30,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:03:30,594 INFO L87 Difference]: Start difference. First operand 392 states and 595 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:30,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:30,696 INFO L93 Difference]: Finished difference Result 773 states and 1179 transitions. [2024-11-08 15:03:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 15:03:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2024-11-08 15:03:30,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:30,701 INFO L225 Difference]: With dead ends: 773 [2024-11-08 15:03:30,701 INFO L226 Difference]: Without dead ends: 394 [2024-11-08 15:03:30,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:03:30,704 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 2 mSDsluCounter, 1447 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:30,705 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1935 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 15:03:30,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-08 15:03:30,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-08 15:03:30,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.521172638436482) internal successors, (467), 311 states have internal predecessors, (467), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-11-08 15:03:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 601 transitions. [2024-11-08 15:03:30,727 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 601 transitions. Word has length 115 [2024-11-08 15:03:30,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:30,728 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 601 transitions. [2024-11-08 15:03:30,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:30,728 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 601 transitions. [2024-11-08 15:03:30,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-08 15:03:30,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:30,731 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:30,745 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-08 15:03:30,931 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-08 15:03:30,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:30,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:30,932 INFO L85 PathProgramCache]: Analyzing trace with hash 562962283, now seen corresponding path program 1 times [2024-11-08 15:03:30,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400243401] [2024-11-08 15:03:30,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:30,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:30,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 15:03:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 15:03:31,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 15:03:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:03:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-08 15:03:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:03:31,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:03:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 15:03:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:03:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400243401] [2024-11-08 15:03:31,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400243401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:31,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:31,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:03:31,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539771109] [2024-11-08 15:03:31,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:31,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:03:31,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:31,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:03:31,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:03:31,190 INFO L87 Difference]: Start difference. First operand 394 states and 601 transitions. Second operand has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:33,462 INFO L93 Difference]: Finished difference Result 952 states and 1463 transitions. [2024-11-08 15:03:33,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:03:33,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2024-11-08 15:03:33,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:33,467 INFO L225 Difference]: With dead ends: 952 [2024-11-08 15:03:33,467 INFO L226 Difference]: Without dead ends: 581 [2024-11-08 15:03:33,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:03:33,469 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1081 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1171 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:33,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1171 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-08 15:03:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-08 15:03:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 394. [2024-11-08 15:03:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 307 states have (on average 1.521172638436482) internal successors, (467), 311 states have internal predecessors, (467), 65 states have call successors, (65), 20 states have call predecessors, (65), 21 states have return successors, (68), 62 states have call predecessors, (68), 62 states have call successors, (68) [2024-11-08 15:03:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 600 transitions. [2024-11-08 15:03:33,516 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 600 transitions. Word has length 116 [2024-11-08 15:03:33,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:33,516 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 600 transitions. [2024-11-08 15:03:33,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.5) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 600 transitions. [2024-11-08 15:03:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-08 15:03:33,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:33,520 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:33,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 15:03:33,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:33,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1066176242, now seen corresponding path program 2 times [2024-11-08 15:03:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409174449] [2024-11-08 15:03:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:33,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:33,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-08 15:03:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-08 15:03:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 15:03:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:03:33,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:03:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:03:33,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:03:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 15:03:33,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:33,744 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-08 15:03:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409174449] [2024-11-08 15:03:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409174449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:03:33,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519469906] [2024-11-08 15:03:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:33,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:03:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:03:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:03:33,746 INFO L87 Difference]: Start difference. First operand 394 states and 600 transitions. Second operand has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:35,854 INFO L93 Difference]: Finished difference Result 954 states and 1466 transitions. [2024-11-08 15:03:35,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 15:03:35,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2024-11-08 15:03:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:35,858 INFO L225 Difference]: With dead ends: 954 [2024-11-08 15:03:35,858 INFO L226 Difference]: Without dead ends: 583 [2024-11-08 15:03:35,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-08 15:03:35,861 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 1076 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1077 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:35,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1077 Valid, 1172 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-08 15:03:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-08 15:03:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 396. [2024-11-08 15:03:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 308 states have (on average 1.5194805194805194) internal successors, (468), 313 states have internal predecessors, (468), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (70), 62 states have call predecessors, (70), 62 states have call successors, (70) [2024-11-08 15:03:35,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 603 transitions. [2024-11-08 15:03:35,894 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 603 transitions. Word has length 117 [2024-11-08 15:03:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:35,897 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 603 transitions. [2024-11-08 15:03:35,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.625) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 603 transitions. [2024-11-08 15:03:35,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-08 15:03:35,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:35,900 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:35,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 15:03:35,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:35,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:35,901 INFO L85 PathProgramCache]: Analyzing trace with hash -407935386, now seen corresponding path program 1 times [2024-11-08 15:03:35,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:35,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475515034] [2024-11-08 15:03:35,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:35,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:36,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-08 15:03:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:03:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:03:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:03:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:03:36,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:03:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 15:03:36,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:36,133 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 15:03:36,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:36,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475515034] [2024-11-08 15:03:36,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475515034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:36,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:36,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 15:03:36,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439574376] [2024-11-08 15:03:36,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:36,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:03:36,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:03:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:03:36,135 INFO L87 Difference]: Start difference. First operand 396 states and 603 transitions. Second operand has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 15:03:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:38,708 INFO L93 Difference]: Finished difference Result 952 states and 1461 transitions. [2024-11-08 15:03:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:03:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 118 [2024-11-08 15:03:38,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:38,714 INFO L225 Difference]: With dead ends: 952 [2024-11-08 15:03:38,714 INFO L226 Difference]: Without dead ends: 583 [2024-11-08 15:03:38,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:03:38,716 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1081 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4495 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1082 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 4845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 4495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:38,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1082 Valid, 1622 Invalid, 4845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 4495 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 15:03:38,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-08 15:03:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 396. [2024-11-08 15:03:38,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 308 states have (on average 1.5194805194805194) internal successors, (468), 313 states have internal predecessors, (468), 65 states have call successors, (65), 20 states have call predecessors, (65), 22 states have return successors, (69), 62 states have call predecessors, (69), 62 states have call successors, (69) [2024-11-08 15:03:38,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 602 transitions. [2024-11-08 15:03:38,746 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 602 transitions. Word has length 118 [2024-11-08 15:03:38,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:38,746 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 602 transitions. [2024-11-08 15:03:38,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.363636363636363) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 15:03:38,746 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 602 transitions. [2024-11-08 15:03:38,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-08 15:03:38,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:38,748 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 15:03:38,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 15:03:38,749 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:38,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -408110983, now seen corresponding path program 2 times [2024-11-08 15:03:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857364561] [2024-11-08 15:03:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:38,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:38,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:38,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:38,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:38,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-08 15:03:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:03:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 15:03:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:03:38,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:03:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:03:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 15:03:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:38,979 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-08 15:03:38,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:38,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857364561] [2024-11-08 15:03:38,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857364561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:38,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:38,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-08 15:03:38,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697749249] [2024-11-08 15:03:38,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:38,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 15:03:38,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:38,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 15:03:38,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-08 15:03:38,980 INFO L87 Difference]: Start difference. First operand 396 states and 602 transitions. Second operand has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 15:03:41,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:41,477 INFO L93 Difference]: Finished difference Result 954 states and 1467 transitions. [2024-11-08 15:03:41,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 15:03:41,478 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 119 [2024-11-08 15:03:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:41,482 INFO L225 Difference]: With dead ends: 954 [2024-11-08 15:03:41,482 INFO L226 Difference]: Without dead ends: 585 [2024-11-08 15:03:41,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-08 15:03:41,484 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1077 mSDsluCounter, 1438 mSDsCounter, 0 mSdLazyCounter, 4514 mSolverCounterSat, 347 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1079 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 4861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 347 IncrementalHoareTripleChecker+Valid, 4514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:41,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1079 Valid, 1622 Invalid, 4861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [347 Valid, 4514 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-08 15:03:41,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-08 15:03:41,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-08 15:03:41,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 315 states have internal predecessors, (469), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-11-08 15:03:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 608 transitions. [2024-11-08 15:03:41,514 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 608 transitions. Word has length 119 [2024-11-08 15:03:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:41,515 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 608 transitions. [2024-11-08 15:03:41,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.454545454545454) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-08 15:03:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 608 transitions. [2024-11-08 15:03:41,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 15:03:41,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:41,517 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:03:41,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 15:03:41,518 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:41,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:41,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1241782689, now seen corresponding path program 1 times [2024-11-08 15:03:41,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:41,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820764987] [2024-11-08 15:03:41,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:41,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:41,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:41,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:41,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:03:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:03:41,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:03:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:03:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:03:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:03:41,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:03:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-08 15:03:41,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:41,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820764987] [2024-11-08 15:03:41,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820764987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:41,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:41,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 15:03:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336501209] [2024-11-08 15:03:41,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:41,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 15:03:41,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:41,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 15:03:41,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 15:03:41,694 INFO L87 Difference]: Start difference. First operand 398 states and 608 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:43,530 INFO L93 Difference]: Finished difference Result 956 states and 1470 transitions. [2024-11-08 15:03:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 15:03:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2024-11-08 15:03:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:43,536 INFO L225 Difference]: With dead ends: 956 [2024-11-08 15:03:43,536 INFO L226 Difference]: Without dead ends: 585 [2024-11-08 15:03:43,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-08 15:03:43,538 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 1079 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 348 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 3054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 348 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:43,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1162 Invalid, 3054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [348 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-08 15:03:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-08 15:03:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 398. [2024-11-08 15:03:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 309 states have (on average 1.5177993527508091) internal successors, (469), 315 states have internal predecessors, (469), 65 states have call successors, (65), 20 states have call predecessors, (65), 23 states have return successors, (74), 62 states have call predecessors, (74), 62 states have call successors, (74) [2024-11-08 15:03:43,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 608 transitions. [2024-11-08 15:03:43,572 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 608 transitions. Word has length 120 [2024-11-08 15:03:43,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:43,572 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 608 transitions. [2024-11-08 15:03:43,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:03:43,572 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 608 transitions. [2024-11-08 15:03:43,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-08 15:03:43,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:43,574 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 15:03:43,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 15:03:43,575 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:43,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:43,577 INFO L85 PathProgramCache]: Analyzing trace with hash 835554209, now seen corresponding path program 1 times [2024-11-08 15:03:43,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:43,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533180787] [2024-11-08 15:03:43,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:43,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:43,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:43,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:43,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-08 15:03:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:03:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-08 15:03:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:03:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:03:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:03:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:03:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-08 15:03:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:43,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533180787] [2024-11-08 15:03:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533180787] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 15:03:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [169565488] [2024-11-08 15:03:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:43,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 15:03:43,815 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-08 15:03:43,816 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-08 15:03:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:44,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 1059 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 15:03:44,118 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 15:03:44,157 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 15:03:44,161 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 15:03:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-08 15:03:44,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [169565488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 15:03:44,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 15:03:44,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-08 15:03:44,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359690603] [2024-11-08 15:03:44,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 15:03:44,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:03:44,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:44,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:03:44,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:03:44,260 INFO L87 Difference]: Start difference. First operand 398 states and 608 transitions. Second operand has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 15:03:46,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:46,933 INFO L93 Difference]: Finished difference Result 1329 states and 2138 transitions. [2024-11-08 15:03:46,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 15:03:46,934 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 120 [2024-11-08 15:03:46,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:46,939 INFO L225 Difference]: With dead ends: 1329 [2024-11-08 15:03:46,939 INFO L226 Difference]: Without dead ends: 962 [2024-11-08 15:03:46,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-11-08 15:03:46,943 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 2206 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 4886 mSolverCounterSat, 678 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2223 SdHoareTripleChecker+Valid, 1836 SdHoareTripleChecker+Invalid, 5564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 678 IncrementalHoareTripleChecker+Valid, 4886 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:46,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2223 Valid, 1836 Invalid, 5564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [678 Valid, 4886 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-08 15:03:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-08 15:03:46,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 751. [2024-11-08 15:03:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 598 states have (on average 1.5719063545150502) internal successors, (940), 604 states have internal predecessors, (940), 129 states have call successors, (129), 20 states have call predecessors, (129), 23 states have return successors, (148), 126 states have call predecessors, (148), 126 states have call successors, (148) [2024-11-08 15:03:46,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1217 transitions. [2024-11-08 15:03:46,990 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1217 transitions. Word has length 120 [2024-11-08 15:03:46,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:46,990 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1217 transitions. [2024-11-08 15:03:46,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.714285714285714) internal successors, (136), 11 states have internal predecessors, (136), 4 states have call successors, (32), 6 states have call predecessors, (32), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2024-11-08 15:03:46,991 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1217 transitions. [2024-11-08 15:03:46,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-08 15:03:46,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:46,994 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] [2024-11-08 15:03:47,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 15:03:47,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 15:03:47,195 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:47,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:47,196 INFO L85 PathProgramCache]: Analyzing trace with hash -455326846, now seen corresponding path program 1 times [2024-11-08 15:03:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496670105] [2024-11-08 15:03:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:47,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:47,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:47,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-08 15:03:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:03:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 15:03:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:03:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:03:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 15:03:47,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:03:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:47,316 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-08 15:03:47,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:47,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496670105] [2024-11-08 15:03:47,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496670105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:47,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:47,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:47,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74816663] [2024-11-08 15:03:47,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:47,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:47,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:47,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:47,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:47,318 INFO L87 Difference]: Start difference. First operand 751 states and 1217 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:48,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:48,848 INFO L93 Difference]: Finished difference Result 1944 states and 3217 transitions. [2024-11-08 15:03:48,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:48,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2024-11-08 15:03:48,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:48,859 INFO L225 Difference]: With dead ends: 1944 [2024-11-08 15:03:48,859 INFO L226 Difference]: Without dead ends: 1271 [2024-11-08 15:03:48,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:48,862 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1187 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1560 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1202 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:48,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1202 Valid, 864 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1560 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:03:48,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1271 states. [2024-11-08 15:03:48,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1271 to 1076. [2024-11-08 15:03:48,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 859 states have (on average 1.589057043073341) internal successors, (1365), 865 states have internal predecessors, (1365), 193 states have call successors, (193), 20 states have call predecessors, (193), 23 states have return successors, (222), 190 states have call predecessors, (222), 190 states have call successors, (222) [2024-11-08 15:03:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1780 transitions. [2024-11-08 15:03:48,927 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1780 transitions. Word has length 123 [2024-11-08 15:03:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:48,928 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1780 transitions. [2024-11-08 15:03:48,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:48,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1780 transitions. [2024-11-08 15:03:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-08 15:03:48,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:48,933 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] [2024-11-08 15:03:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 15:03:48,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:48,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1637464419, now seen corresponding path program 1 times [2024-11-08 15:03:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420566509] [2024-11-08 15:03:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:48,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:48,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:49,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:49,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-08 15:03:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:03:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 15:03:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:03:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:03:49,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 15:03:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 15:03:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:49,041 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-08 15:03:49,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:49,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420566509] [2024-11-08 15:03:49,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420566509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:49,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:49,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:49,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492740231] [2024-11-08 15:03:49,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:49,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:49,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:49,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:49,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:49,044 INFO L87 Difference]: Start difference. First operand 1076 states and 1780 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:50,478 INFO L93 Difference]: Finished difference Result 2749 states and 4601 transitions. [2024-11-08 15:03:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2024-11-08 15:03:50,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:50,489 INFO L225 Difference]: With dead ends: 2749 [2024-11-08 15:03:50,489 INFO L226 Difference]: Without dead ends: 1804 [2024-11-08 15:03:50,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:50,493 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 1186 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:50,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 858 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:03:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-08 15:03:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1609. [2024-11-08 15:03:50,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1609 states, 1297 states have (on average 1.5967617579028528) internal successors, (2071), 1303 states have internal predecessors, (2071), 288 states have call successors, (288), 20 states have call predecessors, (288), 23 states have return successors, (317), 285 states have call predecessors, (317), 285 states have call successors, (317) [2024-11-08 15:03:50,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 2676 transitions. [2024-11-08 15:03:50,579 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 2676 transitions. Word has length 124 [2024-11-08 15:03:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:50,580 INFO L471 AbstractCegarLoop]: Abstraction has 1609 states and 2676 transitions. [2024-11-08 15:03:50,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 2676 transitions. [2024-11-08 15:03:50,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-08 15:03:50,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:50,588 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] [2024-11-08 15:03:50,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 15:03:50,589 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:50,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:50,589 INFO L85 PathProgramCache]: Analyzing trace with hash 311963568, now seen corresponding path program 1 times [2024-11-08 15:03:50,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:50,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016032572] [2024-11-08 15:03:50,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-08 15:03:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:03:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 15:03:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:03:50,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:03:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 15:03:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:03:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:50,719 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-08 15:03:50,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:50,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016032572] [2024-11-08 15:03:50,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016032572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:50,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:50,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:50,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129233334] [2024-11-08 15:03:50,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:50,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:50,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:50,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:50,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:50,722 INFO L87 Difference]: Start difference. First operand 1609 states and 2676 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:52,099 INFO L93 Difference]: Finished difference Result 3956 states and 6687 transitions. [2024-11-08 15:03:52,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2024-11-08 15:03:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:52,115 INFO L225 Difference]: With dead ends: 3956 [2024-11-08 15:03:52,115 INFO L226 Difference]: Without dead ends: 2613 [2024-11-08 15:03:52,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:52,122 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1183 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:52,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 852 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-08 15:03:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2613 states. [2024-11-08 15:03:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2613 to 2418. [2024-11-08 15:03:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 1983 states have (on average 1.6026222894604134) internal successors, (3178), 1989 states have internal predecessors, (3178), 411 states have call successors, (411), 20 states have call predecessors, (411), 23 states have return successors, (456), 408 states have call predecessors, (456), 408 states have call successors, (456) [2024-11-08 15:03:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 4045 transitions. [2024-11-08 15:03:52,263 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 4045 transitions. Word has length 125 [2024-11-08 15:03:52,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:52,263 INFO L471 AbstractCegarLoop]: Abstraction has 2418 states and 4045 transitions. [2024-11-08 15:03:52,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:52,264 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 4045 transitions. [2024-11-08 15:03:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-08 15:03:52,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:52,272 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] [2024-11-08 15:03:52,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 15:03:52,273 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:52,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:52,273 INFO L85 PathProgramCache]: Analyzing trace with hash 920782558, now seen corresponding path program 1 times [2024-11-08 15:03:52,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:52,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775395771] [2024-11-08 15:03:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:52,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:52,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:52,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-08 15:03:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:03:52,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-08 15:03:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:03:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:03:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:03:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 15:03:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:52,379 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-08 15:03:52,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:52,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775395771] [2024-11-08 15:03:52,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775395771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:52,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:52,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:52,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026962522] [2024-11-08 15:03:52,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:52,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:52,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:52,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:52,381 INFO L87 Difference]: Start difference. First operand 2418 states and 4045 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:53,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:53,778 INFO L93 Difference]: Finished difference Result 5840 states and 9947 transitions. [2024-11-08 15:03:53,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:53,779 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2024-11-08 15:03:53,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:53,800 INFO L225 Difference]: With dead ends: 5840 [2024-11-08 15:03:53,800 INFO L226 Difference]: Without dead ends: 3907 [2024-11-08 15:03:53,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:53,808 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1181 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:53,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 852 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1542 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:03:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3907 states. [2024-11-08 15:03:53,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3907 to 3712. [2024-11-08 15:03:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3098 states have (on average 1.6061975468043899) internal successors, (4976), 3104 states have internal predecessors, (4976), 590 states have call successors, (590), 20 states have call predecessors, (590), 23 states have return successors, (661), 587 states have call predecessors, (661), 587 states have call successors, (661) [2024-11-08 15:03:53,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 6227 transitions. [2024-11-08 15:03:53,972 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 6227 transitions. Word has length 126 [2024-11-08 15:03:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:53,973 INFO L471 AbstractCegarLoop]: Abstraction has 3712 states and 6227 transitions. [2024-11-08 15:03:53,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 6227 transitions. [2024-11-08 15:03:53,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-08 15:03:53,984 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:53,984 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] [2024-11-08 15:03:53,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 15:03:53,985 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:53,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:53,985 INFO L85 PathProgramCache]: Analyzing trace with hash -309154676, now seen corresponding path program 1 times [2024-11-08 15:03:53,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:53,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015916290] [2024-11-08 15:03:53,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:53,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:54,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:54,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 15:03:54,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:03:54,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-08 15:03:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:03:54,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 15:03:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:03:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 15:03:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:54,107 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-08 15:03:54,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:54,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015916290] [2024-11-08 15:03:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015916290] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696055040] [2024-11-08 15:03:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:54,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:54,110 INFO L87 Difference]: Start difference. First operand 3712 states and 6227 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:55,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:55,635 INFO L93 Difference]: Finished difference Result 8943 states and 15311 transitions. [2024-11-08 15:03:55,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:55,636 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2024-11-08 15:03:55,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:55,668 INFO L225 Difference]: With dead ends: 8943 [2024-11-08 15:03:55,668 INFO L226 Difference]: Without dead ends: 6048 [2024-11-08 15:03:55,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:55,681 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1179 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 398 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1194 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 398 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:55,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1194 Valid, 878 Invalid, 1984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [398 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:03:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2024-11-08 15:03:55,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 5853. [2024-11-08 15:03:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5853 states, 4863 states have (on average 1.6002467612584823) internal successors, (7782), 4869 states have internal predecessors, (7782), 966 states have call successors, (966), 20 states have call predecessors, (966), 23 states have return successors, (1081), 963 states have call predecessors, (1081), 963 states have call successors, (1081) [2024-11-08 15:03:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5853 states to 5853 states and 9829 transitions. [2024-11-08 15:03:55,937 INFO L78 Accepts]: Start accepts. Automaton has 5853 states and 9829 transitions. Word has length 127 [2024-11-08 15:03:55,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:55,938 INFO L471 AbstractCegarLoop]: Abstraction has 5853 states and 9829 transitions. [2024-11-08 15:03:55,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5853 states and 9829 transitions. [2024-11-08 15:03:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-08 15:03:55,953 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:55,953 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] [2024-11-08 15:03:55,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 15:03:55,954 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:55,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:55,954 INFO L85 PathProgramCache]: Analyzing trace with hash 261739010, now seen corresponding path program 1 times [2024-11-08 15:03:55,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714924009] [2024-11-08 15:03:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:55,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:56,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:56,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-08 15:03:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:03:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-08 15:03:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 15:03:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 15:03:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 15:03:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 15:03:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:56,118 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-08 15:03:56,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:56,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714924009] [2024-11-08 15:03:56,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714924009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:56,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:56,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:56,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465748426] [2024-11-08 15:03:56,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:56,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:56,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:56,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:56,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:56,123 INFO L87 Difference]: Start difference. First operand 5853 states and 9829 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:57,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:03:57,586 INFO L93 Difference]: Finished difference Result 14560 states and 24924 transitions. [2024-11-08 15:03:57,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:03:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2024-11-08 15:03:57,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:03:57,634 INFO L225 Difference]: With dead ends: 14560 [2024-11-08 15:03:57,634 INFO L226 Difference]: Without dead ends: 9926 [2024-11-08 15:03:57,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:03:57,650 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1178 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1559 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1193 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:03:57,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1193 Valid, 867 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1559 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 15:03:57,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9926 states. [2024-11-08 15:03:58,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9926 to 9731. [2024-11-08 15:03:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9731 states, 8135 states have (on average 1.5981561155500923) internal successors, (13001), 8141 states have internal predecessors, (13001), 1572 states have call successors, (1572), 20 states have call predecessors, (1572), 23 states have return successors, (1765), 1569 states have call predecessors, (1765), 1569 states have call successors, (1765) [2024-11-08 15:03:58,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9731 states to 9731 states and 16338 transitions. [2024-11-08 15:03:58,093 INFO L78 Accepts]: Start accepts. Automaton has 9731 states and 16338 transitions. Word has length 128 [2024-11-08 15:03:58,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:03:58,096 INFO L471 AbstractCegarLoop]: Abstraction has 9731 states and 16338 transitions. [2024-11-08 15:03:58,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:03:58,096 INFO L276 IsEmpty]: Start isEmpty. Operand 9731 states and 16338 transitions. [2024-11-08 15:03:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-08 15:03:58,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:03:58,116 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] [2024-11-08 15:03:58,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 15:03:58,116 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:03:58,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:03:58,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1891859226, now seen corresponding path program 1 times [2024-11-08 15:03:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:03:58,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122095860] [2024-11-08 15:03:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:03:58,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:03:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:03:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:03:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:03:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:03:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:03:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:03:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-08 15:03:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-08 15:03:58,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 15:03:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 15:03:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-08 15:03:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 15:03:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 15:03:58,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:03:58,233 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-08 15:03:58,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:03:58,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122095860] [2024-11-08 15:03:58,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122095860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:03:58,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:03:58,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:03:58,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22682302] [2024-11-08 15:03:58,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:03:58,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:03:58,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:03:58,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:03:58,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:03:58,236 INFO L87 Difference]: Start difference. First operand 9731 states and 16338 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:00,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:04:00,062 INFO L93 Difference]: Finished difference Result 25269 states and 43205 transitions. [2024-11-08 15:04:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:04:00,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2024-11-08 15:04:00,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:04:00,129 INFO L225 Difference]: With dead ends: 25269 [2024-11-08 15:04:00,129 INFO L226 Difference]: Without dead ends: 17239 [2024-11-08 15:04:00,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:04:00,254 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1176 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 400 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 400 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:04:00,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 877 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [400 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:04:00,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17239 states. [2024-11-08 15:04:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17239 to 17044. [2024-11-08 15:04:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17044 states, 14245 states have (on average 1.5898209898209898) internal successors, (22647), 14251 states have internal predecessors, (22647), 2775 states have call successors, (2775), 20 states have call predecessors, (2775), 23 states have return successors, (3112), 2772 states have call predecessors, (3112), 2772 states have call successors, (3112) [2024-11-08 15:04:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17044 states to 17044 states and 28534 transitions. [2024-11-08 15:04:00,961 INFO L78 Accepts]: Start accepts. Automaton has 17044 states and 28534 transitions. Word has length 129 [2024-11-08 15:04:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:04:00,961 INFO L471 AbstractCegarLoop]: Abstraction has 17044 states and 28534 transitions. [2024-11-08 15:04:00,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 17044 states and 28534 transitions. [2024-11-08 15:04:00,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-08 15:04:00,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:04:00,989 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-08 15:04:00,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 15:04:00,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:04:00,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:04:00,990 INFO L85 PathProgramCache]: Analyzing trace with hash 637643619, now seen corresponding path program 1 times [2024-11-08 15:04:00,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:04:00,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708466756] [2024-11-08 15:04:00,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:04:00,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:04:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:04:01,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:04:01,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:04:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:04:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:04:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:04:01,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-08 15:04:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-08 15:04:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 15:04:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-08 15:04:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 15:04:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-08 15:04:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 15:04:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:01,101 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-08 15:04:01,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:04:01,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708466756] [2024-11-08 15:04:01,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708466756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:04:01,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:04:01,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:04:01,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819771526] [2024-11-08 15:04:01,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:04:01,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:04:01,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:04:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:04:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:04:01,104 INFO L87 Difference]: Start difference. First operand 17044 states and 28534 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:03,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:04:03,165 INFO L93 Difference]: Finished difference Result 45245 states and 77218 transitions. [2024-11-08 15:04:03,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:04:03,166 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2024-11-08 15:04:03,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:04:03,298 INFO L225 Difference]: With dead ends: 45245 [2024-11-08 15:04:03,299 INFO L226 Difference]: Without dead ends: 30579 [2024-11-08 15:04:03,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:04:03,350 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 1174 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:04:03,351 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 853 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:04:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30579 states. [2024-11-08 15:04:04,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30579 to 30384. [2024-11-08 15:04:04,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30384 states, 25546 states have (on average 1.585766851953339) internal successors, (40510), 25552 states have internal predecessors, (40510), 4814 states have call successors, (4814), 20 states have call predecessors, (4814), 23 states have return successors, (5425), 4811 states have call predecessors, (5425), 4811 states have call successors, (5425) [2024-11-08 15:04:04,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30384 states to 30384 states and 50749 transitions. [2024-11-08 15:04:04,760 INFO L78 Accepts]: Start accepts. Automaton has 30384 states and 50749 transitions. Word has length 130 [2024-11-08 15:04:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:04:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 30384 states and 50749 transitions. [2024-11-08 15:04:04,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 30384 states and 50749 transitions. [2024-11-08 15:04:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-08 15:04:04,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:04:04,797 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-08 15:04:04,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 15:04:04,798 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:04:04,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:04:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash -138218980, now seen corresponding path program 1 times [2024-11-08 15:04:04,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:04:04,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772637473] [2024-11-08 15:04:04,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:04:04,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:04:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:04:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:04:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:04:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:04:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:04:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:04:04,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-08 15:04:04,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-08 15:04:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 15:04:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 15:04:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-08 15:04:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 15:04:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-08 15:04:04,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:04,920 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-08 15:04:04,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:04:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772637473] [2024-11-08 15:04:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772637473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:04:04,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:04:04,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:04:04,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949762381] [2024-11-08 15:04:04,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:04:04,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:04:04,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:04:04,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:04:04,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:04:04,923 INFO L87 Difference]: Start difference. First operand 30384 states and 50749 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:07,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:04:07,694 INFO L93 Difference]: Finished difference Result 82982 states and 140742 transitions. [2024-11-08 15:04:07,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:04:07,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2024-11-08 15:04:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:04:07,935 INFO L225 Difference]: With dead ends: 82982 [2024-11-08 15:04:07,936 INFO L226 Difference]: Without dead ends: 55788 [2024-11-08 15:04:08,012 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:04:08,014 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 1172 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1187 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 15:04:08,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1187 Valid, 865 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 15:04:08,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55788 states. [2024-11-08 15:04:10,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55788 to 55593. [2024-11-08 15:04:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55593 states, 47040 states have (on average 1.5803784013605442) internal successors, (74341), 47046 states have internal predecessors, (74341), 8529 states have call successors, (8529), 20 states have call predecessors, (8529), 23 states have return successors, (9672), 8526 states have call predecessors, (9672), 8526 states have call successors, (9672) [2024-11-08 15:04:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55593 states to 55593 states and 92542 transitions. [2024-11-08 15:04:10,408 INFO L78 Accepts]: Start accepts. Automaton has 55593 states and 92542 transitions. Word has length 131 [2024-11-08 15:04:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:04:10,408 INFO L471 AbstractCegarLoop]: Abstraction has 55593 states and 92542 transitions. [2024-11-08 15:04:10,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 55593 states and 92542 transitions. [2024-11-08 15:04:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-08 15:04:10,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:04:10,781 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-08 15:04:10,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 15:04:10,781 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:04:10,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:04:10,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1072047901, now seen corresponding path program 1 times [2024-11-08 15:04:10,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:04:10,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563584377] [2024-11-08 15:04:10,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:04:10,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:04:10,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:04:10,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:04:10,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:04:10,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:04:10,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:04:10,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:04:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 15:04:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 15:04:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-08 15:04:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-08 15:04:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 15:04:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-08 15:04:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-08 15:04:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:10,910 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-08 15:04:10,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:04:10,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563584377] [2024-11-08 15:04:10,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563584377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:04:10,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:04:10,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 15:04:10,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980225604] [2024-11-08 15:04:10,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:04:10,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 15:04:10,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:04:10,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 15:04:10,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-08 15:04:10,914 INFO L87 Difference]: Start difference. First operand 55593 states and 92542 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:14,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:04:14,354 INFO L93 Difference]: Finished difference Result 104038 states and 176728 transitions. [2024-11-08 15:04:14,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 15:04:14,355 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2024-11-08 15:04:14,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:04:14,802 INFO L225 Difference]: With dead ends: 104038 [2024-11-08 15:04:14,802 INFO L226 Difference]: Without dead ends: 103862 [2024-11-08 15:04:14,849 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:04:14,850 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 1167 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 1551 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 1946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 1551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 15:04:14,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 891 Invalid, 1946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 1551 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-08 15:04:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103862 states. [2024-11-08 15:04:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103862 to 103667. [2024-11-08 15:04:18,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103667 states, 88315 states have (on average 1.5735945196172791) internal successors, (138972), 88321 states have internal predecessors, (138972), 15328 states have call successors, (15328), 20 states have call predecessors, (15328), 23 states have return successors, (17517), 15325 states have call predecessors, (17517), 15325 states have call successors, (17517) [2024-11-08 15:04:18,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103667 states to 103667 states and 171817 transitions. [2024-11-08 15:04:19,002 INFO L78 Accepts]: Start accepts. Automaton has 103667 states and 171817 transitions. Word has length 132 [2024-11-08 15:04:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:04:19,003 INFO L471 AbstractCegarLoop]: Abstraction has 103667 states and 171817 transitions. [2024-11-08 15:04:19,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-08 15:04:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 103667 states and 171817 transitions. [2024-11-08 15:04:19,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-08 15:04:19,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:04:19,049 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-08 15:04:19,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 15:04:19,050 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:04:19,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:04:19,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1752864827, now seen corresponding path program 1 times [2024-11-08 15:04:19,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:04:19,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164239074] [2024-11-08 15:04:19,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:04:19,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:04:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:04:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:04:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:04:19,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:04:19,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:04:19,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:04:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:04:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:04:19,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:04:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:04:19,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 15:04:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 15:04:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 15:04:19,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:19,364 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-08 15:04:19,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:04:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164239074] [2024-11-08 15:04:19,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164239074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:04:19,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:04:19,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-08 15:04:19,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883309728] [2024-11-08 15:04:19,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:04:19,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 15:04:19,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:04:19,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 15:04:19,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-08 15:04:19,367 INFO L87 Difference]: Start difference. First operand 103667 states and 171817 transitions. Second operand has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:04:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 15:04:27,032 INFO L93 Difference]: Finished difference Result 104991 states and 177065 transitions. [2024-11-08 15:04:27,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-08 15:04:27,032 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 133 [2024-11-08 15:04:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 15:04:27,472 INFO L225 Difference]: With dead ends: 104991 [2024-11-08 15:04:27,472 INFO L226 Difference]: Without dead ends: 104821 [2024-11-08 15:04:27,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=399, Invalid=1323, Unknown=0, NotChecked=0, Total=1722 [2024-11-08 15:04:27,510 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 2736 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 7830 mSolverCounterSat, 805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2736 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 8635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 805 IncrementalHoareTripleChecker+Valid, 7830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-08 15:04:27,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2736 Valid, 1306 Invalid, 8635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [805 Valid, 7830 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-08 15:04:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104821 states. [2024-11-08 15:04:31,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104821 to 104138. [2024-11-08 15:04:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104138 states, 88685 states have (on average 1.5729943056886735) internal successors, (139501), 88694 states have internal predecessors, (139501), 15391 states have call successors, (15391), 53 states have call predecessors, (15391), 61 states have return successors, (17588), 15390 states have call predecessors, (17588), 15385 states have call successors, (17588) [2024-11-08 15:04:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104138 states to 104138 states and 172480 transitions. [2024-11-08 15:04:31,486 INFO L78 Accepts]: Start accepts. Automaton has 104138 states and 172480 transitions. Word has length 133 [2024-11-08 15:04:31,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 15:04:31,487 INFO L471 AbstractCegarLoop]: Abstraction has 104138 states and 172480 transitions. [2024-11-08 15:04:31,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.0) internal successors, (91), 8 states have internal predecessors, (91), 3 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-08 15:04:31,487 INFO L276 IsEmpty]: Start isEmpty. Operand 104138 states and 172480 transitions. [2024-11-08 15:04:31,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-08 15:04:31,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 15:04:31,524 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-08 15:04:31,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 15:04:31,525 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 15:04:31,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 15:04:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1126944471, now seen corresponding path program 1 times [2024-11-08 15:04:31,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 15:04:31,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136736586] [2024-11-08 15:04:31,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 15:04:31,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 15:04:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 15:04:32,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-08 15:04:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-08 15:04:32,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 15:04:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 15:04:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-08 15:04:32,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 15:04:32,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 15:04:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-08 15:04:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-08 15:04:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-08 15:04:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-08 15:04:32,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-08 15:04:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 15:04:32,422 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-08 15:04:32,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 15:04:32,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136736586] [2024-11-08 15:04:32,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136736586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 15:04:32,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 15:04:32,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-08 15:04:32,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006258338] [2024-11-08 15:04:32,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 15:04:32,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-08 15:04:32,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 15:04:32,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-08 15:04:32,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2024-11-08 15:04:32,424 INFO L87 Difference]: Start difference. First operand 104138 states and 172480 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 10 states have internal predecessors, (92), 6 states have call successors, (16), 7 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13)