./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/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/ntdrivers-simplified/diskperf_simpl1.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.graphml --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 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:43:26,448 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:43:26,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:43:26,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:43:26,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:43:26,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:43:26,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:43:26,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:43:26,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:43:26,494 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:43:26,494 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:43:26,496 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:43:26,496 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:43:26,497 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:43:26,498 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:43:26,500 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:43:26,501 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:43:26,502 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:43:26,503 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:43:26,508 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:43:26,509 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:43:26,510 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:43:26,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:43:26,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:43:26,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:43:26,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:43:26,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:43:26,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:43:26,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:43:26,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:43:26,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:43:26,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:43:26,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:43:26,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:43:26,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:43:26,523 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:43:26,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:43:26,524 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:43:26,524 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:43:26,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:43:26,525 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:43:26,526 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:43:26,527 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:43:26,549 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:43:26,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:43:26,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:43:26,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:43:26,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:43:26,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:43:26,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:43:26,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:43:26,552 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:43:26,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:43:26,552 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:43:26,553 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:43:26,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:43:26,554 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:43:26,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:43:26,554 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:43:26,554 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:43:26,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:43:26,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:43:26,555 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:43:26,555 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:43:26,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:43:26,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:43:26,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:43:26,556 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:43:26,556 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:43:26,556 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:43:26,556 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 48b194ce99c1fa112b5c4d4ed6cc0216b9fbb33f6f6efd57d62e9c27b1f7eb5c [2022-07-11 23:43:26,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:43:26,775 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:43:26,777 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:43:26,778 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:43:26,778 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:43:26,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-11 23:43:26,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c32c4734/a1594cdf803741f3a8965ec66cf09130/FLAGdb233a509 [2022-07-11 23:43:27,128 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:43:27,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2022-07-11 23:43:27,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c32c4734/a1594cdf803741f3a8965ec66cf09130/FLAGdb233a509 [2022-07-11 23:43:27,543 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c32c4734/a1594cdf803741f3a8965ec66cf09130 [2022-07-11 23:43:27,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:43:27,546 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:43:27,548 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:43:27,548 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:43:27,552 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:43:27,553 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:27,554 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69afe946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27, skipping insertion in model container [2022-07-11 23:43:27,554 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:27,558 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:43:27,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:43:27,723 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-11 23:43:27,849 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:43:27,856 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:43:27,878 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c[2072,2085] [2022-07-11 23:43:27,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:43:27,948 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:43:27,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27 WrapperNode [2022-07-11 23:43:27,950 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:43:27,951 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:43:27,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:43:27,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:43:27,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:27,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,015 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2022-07-11 23:43:28,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:43:28,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:43:28,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:43:28,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:43:28,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,034 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:43:28,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:43:28,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:43:28,083 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:43:28,087 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (1/1) ... [2022-07-11 23:43:28,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:43:28,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:43:28,110 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-11 23:43:28,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-11 23:43:28,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:43:28,140 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2022-07-11 23:43:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2022-07-11 23:43:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2022-07-11 23:43:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2022-07-11 23:43:28,141 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2022-07-11 23:43:28,141 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2022-07-11 23:43:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2022-07-11 23:43:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2022-07-11 23:43:28,147 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2022-07-11 23:43:28,147 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2022-07-11 23:43:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2022-07-11 23:43:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2022-07-11 23:43:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:43:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2022-07-11 23:43:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2022-07-11 23:43:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2022-07-11 23:43:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2022-07-11 23:43:28,148 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2022-07-11 23:43:28,148 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2022-07-11 23:43:28,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:43:28,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:43:28,311 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:43:28,312 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:43:28,316 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,386 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2022-07-11 23:43:28,387 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2022-07-11 23:43:28,388 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,419 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2022-07-11 23:43:28,419 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2022-07-11 23:43:28,455 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,459 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,466 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,803 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2022-07-11 23:43:28,803 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2022-07-11 23:43:28,803 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-07-11 23:43:28,804 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-07-11 23:43:28,804 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2022-07-11 23:43:28,804 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2022-07-11 23:43:28,805 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-11 23:43:28,825 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2022-07-11 23:43:28,826 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2022-07-11 23:43:28,857 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:43:28,863 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:43:28,863 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:43:28,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:43:28 BoogieIcfgContainer [2022-07-11 23:43:28,864 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:43:28,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:43:28,866 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:43:28,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:43:28,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:43:27" (1/3) ... [2022-07-11 23:43:28,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc57f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:43:28, skipping insertion in model container [2022-07-11 23:43:28,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:43:27" (2/3) ... [2022-07-11 23:43:28,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fc57f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:43:28, skipping insertion in model container [2022-07-11 23:43:28,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:43:28" (3/3) ... [2022-07-11 23:43:28,870 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2022-07-11 23:43:28,879 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:43:28,879 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:43:28,911 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:43:28,915 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2f3ed58a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37c7e6de [2022-07-11 23:43:28,916 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:43:28,919 INFO L276 IsEmpty]: Start isEmpty. Operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2022-07-11 23:43:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-11 23:43:28,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:28,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:28,925 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:28,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:28,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2022-07-11 23:43:28,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:28,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376072278] [2022-07-11 23:43:28,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:28,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:29,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376072278] [2022-07-11 23:43:29,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376072278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31072858] [2022-07-11 23:43:29,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,097 INFO L87 Difference]: Start difference. First operand has 243 states, 188 states have (on average 1.4680851063829787) internal successors, (276), 205 states have internal predecessors, (276), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,220 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2022-07-11 23:43:29,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-11 23:43:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,229 INFO L225 Difference]: With dead ends: 449 [2022-07-11 23:43:29,229 INFO L226 Difference]: Without dead ends: 236 [2022-07-11 23:43:29,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,235 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 8 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-07-11 23:43:29,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2022-07-11 23:43:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 183 states have (on average 1.4098360655737705) internal successors, (258), 198 states have internal predecessors, (258), 44 states have call successors, (44), 9 states have call predecessors, (44), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-11 23:43:29,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2022-07-11 23:43:29,273 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2022-07-11 23:43:29,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,273 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2022-07-11 23:43:29,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2022-07-11 23:43:29,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-11 23:43:29,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:29,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:43:29,275 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2022-07-11 23:43:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086306158] [2022-07-11 23:43:29,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086306158] [2022-07-11 23:43:29,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086306158] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866707221] [2022-07-11 23:43:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,319 INFO L87 Difference]: Start difference. First operand 236 states and 332 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,403 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2022-07-11 23:43:29,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-11 23:43:29,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,407 INFO L225 Difference]: With dead ends: 536 [2022-07-11 23:43:29,411 INFO L226 Difference]: Without dead ends: 377 [2022-07-11 23:43:29,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,416 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:29,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-11 23:43:29,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2022-07-11 23:43:29,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 283 states have (on average 1.3851590106007068) internal successors, (392), 291 states have internal predecessors, (392), 59 states have call successors, (59), 16 states have call predecessors, (59), 14 states have return successors, (67), 51 states have call predecessors, (67), 48 states have call successors, (67) [2022-07-11 23:43:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2022-07-11 23:43:29,452 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2022-07-11 23:43:29,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,452 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2022-07-11 23:43:29,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2022-07-11 23:43:29,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:43:29,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:29,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:43:29,454 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,454 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2022-07-11 23:43:29,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224310936] [2022-07-11 23:43:29,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:29,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224310936] [2022-07-11 23:43:29,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224310936] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229855410] [2022-07-11 23:43:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,505 INFO L87 Difference]: Start difference. First operand 357 states and 518 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,529 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2022-07-11 23:43:29,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:43:29,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,555 INFO L225 Difference]: With dead ends: 823 [2022-07-11 23:43:29,555 INFO L226 Difference]: Without dead ends: 550 [2022-07-11 23:43:29,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,560 INFO L413 NwaCegarLoop]: 365 mSDtfsCounter, 255 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:29,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2022-07-11 23:43:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2022-07-11 23:43:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 411 states have (on average 1.389294403892944) internal successors, (571), 418 states have internal predecessors, (571), 84 states have call successors, (84), 24 states have call predecessors, (84), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-11 23:43:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2022-07-11 23:43:29,590 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2022-07-11 23:43:29,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,591 INFO L495 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2022-07-11 23:43:29,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2022-07-11 23:43:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:43:29,596 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:29,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:43:29,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,598 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2022-07-11 23:43:29,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100091610] [2022-07-11 23:43:29,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:29,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100091610] [2022-07-11 23:43:29,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100091610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:29,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538691913] [2022-07-11 23:43:29,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:29,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,652 INFO L87 Difference]: Start difference. First operand 519 states and 772 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:29,704 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2022-07-11 23:43:29,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:29,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:43:29,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:29,706 INFO L225 Difference]: With dead ends: 534 [2022-07-11 23:43:29,706 INFO L226 Difference]: Without dead ends: 530 [2022-07-11 23:43:29,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:29,708 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 21 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:29,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:29,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-07-11 23:43:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2022-07-11 23:43:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 422 states have (on average 1.386255924170616) internal successors, (585), 427 states have internal predecessors, (585), 83 states have call successors, (83), 25 states have call predecessors, (83), 23 states have return successors, (117), 77 states have call predecessors, (117), 74 states have call successors, (117) [2022-07-11 23:43:29,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2022-07-11 23:43:29,722 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2022-07-11 23:43:29,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:29,723 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2022-07-11 23:43:29,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2022-07-11 23:43:29,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:43:29,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:29,724 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:29,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:43:29,724 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:29,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:29,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2022-07-11 23:43:29,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:29,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474513441] [2022-07-11 23:43:29,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:29,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-11 23:43:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:29,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:29,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:29,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474513441] [2022-07-11 23:43:29,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474513441] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:29,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:29,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:29,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767354436] [2022-07-11 23:43:29,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:29,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:29,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:29,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:29,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:29,790 INFO L87 Difference]: Start difference. First operand 529 states and 785 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,110 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2022-07-11 23:43:30,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:30,111 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-11 23:43:30,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,113 INFO L225 Difference]: With dead ends: 582 [2022-07-11 23:43:30,113 INFO L226 Difference]: Without dead ends: 571 [2022-07-11 23:43:30,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:30,114 INFO L413 NwaCegarLoop]: 290 mSDtfsCounter, 410 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-11 23:43:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-11 23:43:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.3803131991051454) internal successors, (617), 454 states have internal predecessors, (617), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-11 23:43:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2022-07-11 23:43:30,135 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2022-07-11 23:43:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,136 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2022-07-11 23:43:30,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,136 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2022-07-11 23:43:30,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:43:30,137 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,137 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:30,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:43:30,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2022-07-11 23:43:30,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801638893] [2022-07-11 23:43:30,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-11 23:43:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:30,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801638893] [2022-07-11 23:43:30,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801638893] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040913607] [2022-07-11 23:43:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:30,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:30,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:30,219 INFO L87 Difference]: Start difference. First operand 556 states and 826 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,475 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2022-07-11 23:43:30,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:30,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-11 23:43:30,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,478 INFO L225 Difference]: With dead ends: 579 [2022-07-11 23:43:30,478 INFO L226 Difference]: Without dead ends: 571 [2022-07-11 23:43:30,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:30,481 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 408 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-11 23:43:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2022-07-11 23:43:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 447 states have (on average 1.378076062639821) internal successors, (616), 454 states have internal predecessors, (616), 83 states have call successors, (83), 25 states have call predecessors, (83), 25 states have return successors, (126), 77 states have call predecessors, (126), 74 states have call successors, (126) [2022-07-11 23:43:30,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2022-07-11 23:43:30,510 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2022-07-11 23:43:30,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,510 INFO L495 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2022-07-11 23:43:30,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,510 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2022-07-11 23:43:30,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:43:30,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:30,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:43:30,512 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2022-07-11 23:43:30,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663712541] [2022-07-11 23:43:30,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-11 23:43:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:30,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663712541] [2022-07-11 23:43:30,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663712541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:30,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86546797] [2022-07-11 23:43:30,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:30,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:30,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:30,559 INFO L87 Difference]: Start difference. First operand 556 states and 825 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,730 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2022-07-11 23:43:30,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:30,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-11 23:43:30,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,734 INFO L225 Difference]: With dead ends: 1018 [2022-07-11 23:43:30,734 INFO L226 Difference]: Without dead ends: 989 [2022-07-11 23:43:30,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:30,735 INFO L413 NwaCegarLoop]: 372 mSDtfsCounter, 417 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 772 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:30,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2022-07-11 23:43:30,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2022-07-11 23:43:30,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 759 states have (on average 1.391304347826087) internal successors, (1056), 766 states have internal predecessors, (1056), 141 states have call successors, (141), 47 states have call predecessors, (141), 48 states have return successors, (249), 137 states have call predecessors, (249), 132 states have call successors, (249) [2022-07-11 23:43:30,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2022-07-11 23:43:30,765 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2022-07-11 23:43:30,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,765 INFO L495 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2022-07-11 23:43:30,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,766 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2022-07-11 23:43:30,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:43:30,766 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:30,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:43:30,772 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,776 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2022-07-11 23:43:30,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419215244] [2022-07-11 23:43:30,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-11 23:43:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:30,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:30,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419215244] [2022-07-11 23:43:30,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419215244] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:30,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:30,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256585067] [2022-07-11 23:43:30,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:30,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:30,822 INFO L87 Difference]: Start difference. First operand 949 states and 1446 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:30,950 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2022-07-11 23:43:30,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:30,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-11 23:43:30,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:30,955 INFO L225 Difference]: With dead ends: 985 [2022-07-11 23:43:30,955 INFO L226 Difference]: Without dead ends: 966 [2022-07-11 23:43:30,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:30,956 INFO L413 NwaCegarLoop]: 300 mSDtfsCounter, 84 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-07-11 23:43:30,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2022-07-11 23:43:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 756 states have (on average 1.3915343915343916) internal successors, (1052), 763 states have internal predecessors, (1052), 140 states have call successors, (140), 47 states have call predecessors, (140), 48 states have return successors, (248), 136 states have call predecessors, (248), 131 states have call successors, (248) [2022-07-11 23:43:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2022-07-11 23:43:30,989 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2022-07-11 23:43:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:30,990 INFO L495 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2022-07-11 23:43:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2022-07-11 23:43:30,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:30,991 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:30,991 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:30,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:43:30,991 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:30,992 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2022-07-11 23:43:30,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:30,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922269289] [2022-07-11 23:43:30,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:30,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:31,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922269289] [2022-07-11 23:43:31,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922269289] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:31,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969644889] [2022-07-11 23:43:31,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:31,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:31,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:31,031 INFO L87 Difference]: Start difference. First operand 945 states and 1440 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:31,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,052 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2022-07-11 23:43:31,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:31,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:43:31,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,055 INFO L225 Difference]: With dead ends: 1334 [2022-07-11 23:43:31,055 INFO L226 Difference]: Without dead ends: 510 [2022-07-11 23:43:31,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:31,061 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2022-07-11 23:43:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2022-07-11 23:43:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 408 states have (on average 1.3553921568627452) internal successors, (553), 414 states have internal predecessors, (553), 78 states have call successors, (78), 23 states have call predecessors, (78), 23 states have return successors, (123), 73 states have call predecessors, (123), 71 states have call successors, (123) [2022-07-11 23:43:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2022-07-11 23:43:31,077 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2022-07-11 23:43:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,077 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2022-07-11 23:43:31,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 3 states have call successors, (4), 3 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2022-07-11 23:43:31,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:31,079 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:31,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:43:31,080 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2022-07-11 23:43:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374395696] [2022-07-11 23:43:31,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:31,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374395696] [2022-07-11 23:43:31,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374395696] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:31,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649683887] [2022-07-11 23:43:31,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:31,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:31,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:31,135 INFO L87 Difference]: Start difference. First operand 510 states and 754 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,268 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2022-07-11 23:43:31,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:31,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-11 23:43:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,272 INFO L225 Difference]: With dead ends: 553 [2022-07-11 23:43:31,272 INFO L226 Difference]: Without dead ends: 519 [2022-07-11 23:43:31,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:31,273 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 94 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1167 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:31,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-07-11 23:43:31,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2022-07-11 23:43:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 407 states have (on average 1.3513513513513513) internal successors, (550), 413 states have internal predecessors, (550), 77 states have call successors, (77), 23 states have call predecessors, (77), 23 states have return successors, (122), 72 states have call predecessors, (122), 70 states have call successors, (122) [2022-07-11 23:43:31,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2022-07-11 23:43:31,290 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2022-07-11 23:43:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,291 INFO L495 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2022-07-11 23:43:31,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,292 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2022-07-11 23:43:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:31,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:31,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:43:31,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2022-07-11 23:43:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101785050] [2022-07-11 23:43:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:43:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101785050] [2022-07-11 23:43:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101785050] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:31,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568010511] [2022-07-11 23:43:31,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:31,336 INFO L87 Difference]: Start difference. First operand 508 states and 749 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,593 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2022-07-11 23:43:31,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-11 23:43:31,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-11 23:43:31,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,597 INFO L225 Difference]: With dead ends: 720 [2022-07-11 23:43:31,597 INFO L226 Difference]: Without dead ends: 712 [2022-07-11 23:43:31,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:31,598 INFO L413 NwaCegarLoop]: 299 mSDtfsCounter, 232 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-11 23:43:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2022-07-11 23:43:31,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 566 states, 455 states have (on average 1.3516483516483517) internal successors, (615), 461 states have internal predecessors, (615), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-11 23:43:31,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2022-07-11 23:43:31,621 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2022-07-11 23:43:31,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,622 INFO L495 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2022-07-11 23:43:31,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,622 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2022-07-11 23:43:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:31,622 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,623 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:31,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:43:31,623 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2022-07-11 23:43:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100198689] [2022-07-11 23:43:31,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:43:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:31,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:31,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100198689] [2022-07-11 23:43:31,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100198689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:31,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:31,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:31,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042983319] [2022-07-11 23:43:31,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:31,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:31,668 INFO L87 Difference]: Start difference. First operand 566 states and 841 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:31,935 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2022-07-11 23:43:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-11 23:43:31,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:31,938 INFO L225 Difference]: With dead ends: 583 [2022-07-11 23:43:31,938 INFO L226 Difference]: Without dead ends: 579 [2022-07-11 23:43:31,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:31,938 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 66 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:31,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:31,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-07-11 23:43:31,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2022-07-11 23:43:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 463 states have (on average 1.349892008639309) internal successors, (625), 469 states have internal predecessors, (625), 84 states have call successors, (84), 25 states have call predecessors, (84), 26 states have return successors, (142), 80 states have call predecessors, (142), 77 states have call successors, (142) [2022-07-11 23:43:31,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2022-07-11 23:43:31,969 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2022-07-11 23:43:31,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:31,969 INFO L495 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2022-07-11 23:43:31,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2022-07-11 23:43:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:31,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:31,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:31,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:43:31,970 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:31,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:31,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2022-07-11 23:43:31,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:31,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224395786] [2022-07-11 23:43:31,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:31,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:31,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:43:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224395786] [2022-07-11 23:43:32,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224395786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190295268] [2022-07-11 23:43:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:32,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:32,020 INFO L87 Difference]: Start difference. First operand 574 states and 851 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,279 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2022-07-11 23:43:32,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:32,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-07-11 23:43:32,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,286 INFO L225 Difference]: With dead ends: 1065 [2022-07-11 23:43:32,286 INFO L226 Difference]: Without dead ends: 605 [2022-07-11 23:43:32,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:32,288 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1572 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:32,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-11 23:43:32,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2022-07-11 23:43:32,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 586 states, 474 states have (on average 1.3544303797468353) internal successors, (642), 481 states have internal predecessors, (642), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (161), 80 states have call predecessors, (161), 77 states have call successors, (161) [2022-07-11 23:43:32,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2022-07-11 23:43:32,310 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2022-07-11 23:43:32,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,310 INFO L495 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2022-07-11 23:43:32,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:32,311 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2022-07-11 23:43:32,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:43:32,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:32,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:43:32,312 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2022-07-11 23:43:32,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586210096] [2022-07-11 23:43:32,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586210096] [2022-07-11 23:43:32,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586210096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:32,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874315099] [2022-07-11 23:43:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:32,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:32,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:32,346 INFO L87 Difference]: Start difference. First operand 586 states and 887 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:32,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,449 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2022-07-11 23:43:32,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:32,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:43:32,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,452 INFO L225 Difference]: With dead ends: 610 [2022-07-11 23:43:32,452 INFO L226 Difference]: Without dead ends: 582 [2022-07-11 23:43:32,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:32,453 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 270 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:32,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2022-07-11 23:43:32,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2022-07-11 23:43:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 580 states, 468 states have (on average 1.3525641025641026) internal successors, (633), 476 states have internal predecessors, (633), 84 states have call successors, (84), 25 states have call predecessors, (84), 27 states have return successors, (159), 79 states have call predecessors, (159), 77 states have call successors, (159) [2022-07-11 23:43:32,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2022-07-11 23:43:32,488 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2022-07-11 23:43:32,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,488 INFO L495 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2022-07-11 23:43:32,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2022-07-11 23:43:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:43:32,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:32,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:43:32,490 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2022-07-11 23:43:32,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137193167] [2022-07-11 23:43:32,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:32,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-11 23:43:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:32,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:32,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:32,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137193167] [2022-07-11 23:43:32,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137193167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:32,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:32,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:32,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733709237] [2022-07-11 23:43:32,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:32,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:32,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:32,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:32,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:32,549 INFO L87 Difference]: Start difference. First operand 580 states and 876 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:32,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:32,946 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2022-07-11 23:43:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-07-11 23:43:32,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:32,949 INFO L225 Difference]: With dead ends: 738 [2022-07-11 23:43:32,950 INFO L226 Difference]: Without dead ends: 721 [2022-07-11 23:43:32,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:32,950 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:32,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-07-11 23:43:32,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2022-07-11 23:43:32,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 457 states have (on average 1.3544857768052516) internal successors, (619), 464 states have internal predecessors, (619), 83 states have call successors, (83), 25 states have call predecessors, (83), 26 states have return successors, (140), 78 states have call predecessors, (140), 76 states have call successors, (140) [2022-07-11 23:43:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2022-07-11 23:43:32,982 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2022-07-11 23:43:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:32,983 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2022-07-11 23:43:32,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:32,983 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2022-07-11 23:43:32,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-11 23:43:32,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:32,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:32,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:43:32,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:32,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:32,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2022-07-11 23:43:32,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:32,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297810668] [2022-07-11 23:43:32,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:32,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:43:33,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297810668] [2022-07-11 23:43:33,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297810668] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:33,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153079481] [2022-07-11 23:43:33,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:33,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:33,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:33,026 INFO L87 Difference]: Start difference. First operand 567 states and 842 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:33,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,184 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2022-07-11 23:43:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-07-11 23:43:33,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,187 INFO L225 Difference]: With dead ends: 630 [2022-07-11 23:43:33,188 INFO L226 Difference]: Without dead ends: 377 [2022-07-11 23:43:33,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:33,189 INFO L413 NwaCegarLoop]: 286 mSDtfsCounter, 315 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-07-11 23:43:33,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2022-07-11 23:43:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 295 states have (on average 1.3016949152542372) internal successors, (384), 302 states have internal predecessors, (384), 47 states have call successors, (47), 17 states have call predecessors, (47), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-11 23:43:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2022-07-11 23:43:33,207 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2022-07-11 23:43:33,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,207 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2022-07-11 23:43:33,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:33,207 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2022-07-11 23:43:33,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:33,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:43:33,208 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2022-07-11 23:43:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034804582] [2022-07-11 23:43:33,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034804582] [2022-07-11 23:43:33,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034804582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:43:33,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507562721] [2022-07-11 23:43:33,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:43:33,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:43:33,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:33,229 INFO L87 Difference]: Start difference. First operand 359 states and 492 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,299 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2022-07-11 23:43:33,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:43:33,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 23:43:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,301 INFO L225 Difference]: With dead ends: 504 [2022-07-11 23:43:33,301 INFO L226 Difference]: Without dead ends: 491 [2022-07-11 23:43:33,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:43:33,302 INFO L413 NwaCegarLoop]: 417 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 638 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-11 23:43:33,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2022-07-11 23:43:33,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 310 states have (on average 1.2903225806451613) internal successors, (400), 317 states have internal predecessors, (400), 47 states have call successors, (47), 17 states have call predecessors, (47), 17 states have return successors, (62), 41 states have call predecessors, (62), 40 states have call successors, (62) [2022-07-11 23:43:33,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2022-07-11 23:43:33,330 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2022-07-11 23:43:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,330 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2022-07-11 23:43:33,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2022-07-11 23:43:33,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-11 23:43:33,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:43:33,331 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2022-07-11 23:43:33,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377475192] [2022-07-11 23:43:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377475192] [2022-07-11 23:43:33,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377475192] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:33,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807439846] [2022-07-11 23:43:33,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:33,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:33,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:33,360 INFO L87 Difference]: Start difference. First operand 375 states and 509 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,460 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2022-07-11 23:43:33,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-11 23:43:33,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,463 INFO L225 Difference]: With dead ends: 387 [2022-07-11 23:43:33,464 INFO L226 Difference]: Without dead ends: 353 [2022-07-11 23:43:33,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:33,464 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 262 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:33,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-11 23:43:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-07-11 23:43:33,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 288 states have (on average 1.28125) internal successors, (369), 294 states have internal predecessors, (369), 46 states have call successors, (46), 17 states have call predecessors, (46), 16 states have return successors, (61), 40 states have call predecessors, (61), 40 states have call successors, (61) [2022-07-11 23:43:33,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2022-07-11 23:43:33,482 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2022-07-11 23:43:33,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,483 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2022-07-11 23:43:33,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,483 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2022-07-11 23:43:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:43:33,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,484 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:43:33,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2022-07-11 23:43:33,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652626697] [2022-07-11 23:43:33,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:33,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652626697] [2022-07-11 23:43:33,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652626697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:33,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169300243] [2022-07-11 23:43:33,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:33,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:33,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:33,525 INFO L87 Difference]: Start difference. First operand 351 states and 476 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:33,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,732 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2022-07-11 23:43:33,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-07-11 23:43:33,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,734 INFO L225 Difference]: With dead ends: 355 [2022-07-11 23:43:33,734 INFO L226 Difference]: Without dead ends: 324 [2022-07-11 23:43:33,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:33,735 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:33,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-07-11 23:43:33,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2022-07-11 23:43:33,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 263 states have (on average 1.2889733840304183) internal successors, (339), 269 states have internal predecessors, (339), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-11 23:43:33,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2022-07-11 23:43:33,750 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2022-07-11 23:43:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,751 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2022-07-11 23:43:33,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:33,751 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2022-07-11 23:43:33,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-11 23:43:33,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:43:33,752 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,752 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2022-07-11 23:43:33,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347270041] [2022-07-11 23:43:33,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347270041] [2022-07-11 23:43:33,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347270041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:33,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532476241] [2022-07-11 23:43:33,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:33,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:33,802 INFO L87 Difference]: Start difference. First operand 324 states and 444 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:33,887 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2022-07-11 23:43:33,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:33,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-11 23:43:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:33,888 INFO L225 Difference]: With dead ends: 345 [2022-07-11 23:43:33,888 INFO L226 Difference]: Without dead ends: 323 [2022-07-11 23:43:33,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:33,889 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 43 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1424 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:33,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:33,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-11 23:43:33,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-07-11 23:43:33,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 262 states have (on average 1.286259541984733) internal successors, (337), 268 states have internal predecessors, (337), 45 states have call successors, (45), 16 states have call predecessors, (45), 15 states have return successors, (60), 39 states have call predecessors, (60), 39 states have call successors, (60) [2022-07-11 23:43:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2022-07-11 23:43:33,925 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2022-07-11 23:43:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:33,926 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2022-07-11 23:43:33,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2022-07-11 23:43:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:43:33,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:33,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:33,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:43:33,927 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:33,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2022-07-11 23:43:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145579417] [2022-07-11 23:43:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-07-11 23:43:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:33,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:33,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:33,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145579417] [2022-07-11 23:43:33,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145579417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:33,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:33,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:33,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806862293] [2022-07-11 23:43:33,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:33,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:33,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:33,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:33,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:33,968 INFO L87 Difference]: Start difference. First operand 323 states and 442 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:34,083 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2022-07-11 23:43:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-07-11 23:43:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:34,084 INFO L225 Difference]: With dead ends: 352 [2022-07-11 23:43:34,084 INFO L226 Difference]: Without dead ends: 322 [2022-07-11 23:43:34,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:34,085 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 79 mSDsluCounter, 823 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:34,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1067 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-11 23:43:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2022-07-11 23:43:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 249 states have (on average 1.2931726907630523) internal successors, (322), 255 states have internal predecessors, (322), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-11 23:43:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2022-07-11 23:43:34,102 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2022-07-11 23:43:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,102 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2022-07-11 23:43:34,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 5 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:34,103 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2022-07-11 23:43:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:43:34,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:34,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:43:34,103 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,104 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2022-07-11 23:43:34,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535354896] [2022-07-11 23:43:34,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:34,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535354896] [2022-07-11 23:43:34,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535354896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-11 23:43:34,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039001714] [2022-07-11 23:43:34,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:34,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:34,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:34,154 INFO L87 Difference]: Start difference. First operand 308 states and 425 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:34,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:34,228 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2022-07-11 23:43:34,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:34,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-11 23:43:34,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:34,230 INFO L225 Difference]: With dead ends: 323 [2022-07-11 23:43:34,230 INFO L226 Difference]: Without dead ends: 319 [2022-07-11 23:43:34,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:34,230 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 46 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:34,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2022-07-11 23:43:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2022-07-11 23:43:34,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 256 states have (on average 1.2890625) internal successors, (330), 262 states have internal predecessors, (330), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-11 23:43:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2022-07-11 23:43:34,247 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2022-07-11 23:43:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,247 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2022-07-11 23:43:34,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2022-07-11 23:43:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-11 23:43:34,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,248 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:34,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:43:34,248 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,249 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2022-07-11 23:43:34,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034237769] [2022-07-11 23:43:34,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:34,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034237769] [2022-07-11 23:43:34,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034237769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:43:34,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368858836] [2022-07-11 23:43:34,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:43:34,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:43:34,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:43:34,277 INFO L87 Difference]: Start difference. First operand 315 states and 433 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:34,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:34,450 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2022-07-11 23:43:34,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:43:34,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-11 23:43:34,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:34,452 INFO L225 Difference]: With dead ends: 431 [2022-07-11 23:43:34,453 INFO L226 Difference]: Without dead ends: 402 [2022-07-11 23:43:34,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:34,453 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 345 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:34,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 501 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:34,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-07-11 23:43:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-07-11 23:43:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.3004291845493563) internal successors, (303), 239 states have internal predecessors, (303), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-11 23:43:34,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2022-07-11 23:43:34,470 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2022-07-11 23:43:34,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,471 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2022-07-11 23:43:34,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2022-07-11 23:43:34,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:43:34,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:34,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:43:34,472 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2022-07-11 23:43:34,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348282189] [2022-07-11 23:43:34,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-11 23:43:34,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-11 23:43:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:34,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348282189] [2022-07-11 23:43:34,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348282189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:34,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324856168] [2022-07-11 23:43:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:34,511 INFO L87 Difference]: Start difference. First operand 292 states and 406 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:34,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:34,640 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2022-07-11 23:43:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 43 [2022-07-11 23:43:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:34,643 INFO L225 Difference]: With dead ends: 544 [2022-07-11 23:43:34,643 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:43:34,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:34,644 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 112 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:34,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:43:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2022-07-11 23:43:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 243 states have (on average 1.3045267489711934) internal successors, (317), 248 states have internal predecessors, (317), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-11 23:43:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2022-07-11 23:43:34,662 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2022-07-11 23:43:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:34,662 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2022-07-11 23:43:34,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2022-07-11 23:43:34,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-11 23:43:34,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:34,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:34,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:43:34,664 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:34,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2022-07-11 23:43:34,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:34,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373153388] [2022-07-11 23:43:34,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:34,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-11 23:43:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:34,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373153388] [2022-07-11 23:43:34,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373153388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:34,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:34,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652931707] [2022-07-11 23:43:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:34,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:34,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:34,785 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,075 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2022-07-11 23:43:35,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:43:35,076 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-07-11 23:43:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,077 INFO L225 Difference]: With dead ends: 333 [2022-07-11 23:43:35,077 INFO L226 Difference]: Without dead ends: 310 [2022-07-11 23:43:35,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-07-11 23:43:35,078 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 77 mSDsluCounter, 1071 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1275 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:35,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-07-11 23:43:35,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2022-07-11 23:43:35,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 247 states have internal predecessors, (315), 44 states have call successors, (44), 15 states have call predecessors, (44), 14 states have return successors, (59), 38 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-11 23:43:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2022-07-11 23:43:35,095 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2022-07-11 23:43:35,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,095 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2022-07-11 23:43:35,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 8 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:35,096 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2022-07-11 23:43:35,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-11 23:43:35,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:35,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:43:35,096 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,097 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2022-07-11 23:43:35,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:35,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108657803] [2022-07-11 23:43:35,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:35,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:43:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:35,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:35,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:35,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108657803] [2022-07-11 23:43:35,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108657803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:35,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:35,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-11 23:43:35,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400816051] [2022-07-11 23:43:35,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:35,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-11 23:43:35,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:35,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-11 23:43:35,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-11 23:43:35,141 INFO L87 Difference]: Start difference. First operand 301 states and 418 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:35,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,318 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2022-07-11 23:43:35,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-11 23:43:35,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2022-07-11 23:43:35,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,320 INFO L225 Difference]: With dead ends: 569 [2022-07-11 23:43:35,320 INFO L226 Difference]: Without dead ends: 326 [2022-07-11 23:43:35,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:35,322 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 61 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1136 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-11 23:43:35,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2022-07-11 23:43:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 252 states have (on average 1.2936507936507937) internal successors, (326), 257 states have internal predecessors, (326), 44 states have call successors, (44), 15 states have call predecessors, (44), 16 states have return successors, (77), 40 states have call predecessors, (77), 38 states have call successors, (77) [2022-07-11 23:43:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2022-07-11 23:43:35,338 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2022-07-11 23:43:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,339 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2022-07-11 23:43:35,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 5 states have internal predecessors, (41), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:35,339 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2022-07-11 23:43:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-11 23:43:35,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:35,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:43:35,340 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2022-07-11 23:43:35,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:35,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702828937] [2022-07-11 23:43:35,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:35,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:35,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-11 23:43:35,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:35,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702828937] [2022-07-11 23:43:35,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702828937] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:35,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:35,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:35,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483994294] [2022-07-11 23:43:35,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:35,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:35,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:35,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:35,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:35,405 INFO L87 Difference]: Start difference. First operand 313 states and 447 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,678 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2022-07-11 23:43:35,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:35,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-07-11 23:43:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,680 INFO L225 Difference]: With dead ends: 315 [2022-07-11 23:43:35,680 INFO L226 Difference]: Without dead ends: 282 [2022-07-11 23:43:35,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:43:35,681 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 66 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-07-11 23:43:35,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-07-11 23:43:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 224 states have (on average 1.3169642857142858) internal successors, (295), 228 states have internal predecessors, (295), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-11 23:43:35,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2022-07-11 23:43:35,700 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2022-07-11 23:43:35,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,700 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2022-07-11 23:43:35,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-11 23:43:35,700 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2022-07-11 23:43:35,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:43:35,700 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:35,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:43:35,701 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2022-07-11 23:43:35,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:35,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682957564] [2022-07-11 23:43:35,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:35,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:35,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-11 23:43:35,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:35,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:35,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:35,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682957564] [2022-07-11 23:43:35,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682957564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:35,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:35,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:35,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234554152] [2022-07-11 23:43:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:35,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:35,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:35,730 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:35,903 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2022-07-11 23:43:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:35,903 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-11 23:43:35,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:35,905 INFO L225 Difference]: With dead ends: 441 [2022-07-11 23:43:35,905 INFO L226 Difference]: Without dead ends: 438 [2022-07-11 23:43:35,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-11 23:43:35,906 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 140 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:35,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 793 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-07-11 23:43:35,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2022-07-11 23:43:35,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 42 states have call successors, (42), 14 states have call predecessors, (42), 15 states have return successors, (76), 39 states have call predecessors, (76), 37 states have call successors, (76) [2022-07-11 23:43:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2022-07-11 23:43:35,924 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2022-07-11 23:43:35,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:35,924 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2022-07-11 23:43:35,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:35,924 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2022-07-11 23:43:35,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-11 23:43:35,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:35,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:35,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:43:35,925 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:35,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:35,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2022-07-11 23:43:35,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:35,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774561881] [2022-07-11 23:43:35,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:35,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:35,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-11 23:43:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:35,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:35,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:35,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774561881] [2022-07-11 23:43:35,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774561881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:35,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:35,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-11 23:43:35,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885147700] [2022-07-11 23:43:35,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:35,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-11 23:43:35,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:35,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-11 23:43:35,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-11 23:43:35,971 INFO L87 Difference]: Start difference. First operand 286 states and 419 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:36,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:36,167 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2022-07-11 23:43:36,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:36,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2022-07-11 23:43:36,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:36,169 INFO L225 Difference]: With dead ends: 658 [2022-07-11 23:43:36,169 INFO L226 Difference]: Without dead ends: 405 [2022-07-11 23:43:36,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:36,171 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:36,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2022-07-11 23:43:36,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2022-07-11 23:43:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 297 states have (on average 1.2996632996632997) internal successors, (386), 302 states have internal predecessors, (386), 53 states have call successors, (53), 18 states have call predecessors, (53), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-11 23:43:36,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2022-07-11 23:43:36,192 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2022-07-11 23:43:36,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,192 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2022-07-11 23:43:36,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 3 states have call successors, (5), 5 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-11 23:43:36,192 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2022-07-11 23:43:36,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-11 23:43:36,193 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:36,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:43:36,193 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,194 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2022-07-11 23:43:36,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261939049] [2022-07-11 23:43:36,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:36,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261939049] [2022-07-11 23:43:36,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261939049] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:36,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353683823] [2022-07-11 23:43:36,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:36,291 INFO L87 Difference]: Start difference. First operand 373 states and 535 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:43:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:36,470 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2022-07-11 23:43:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:43:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-07-11 23:43:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:36,472 INFO L225 Difference]: With dead ends: 691 [2022-07-11 23:43:36,472 INFO L226 Difference]: Without dead ends: 346 [2022-07-11 23:43:36,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:36,473 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:36,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 983 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-11 23:43:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-07-11 23:43:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 271 states have (on average 1.2767527675276753) internal successors, (346), 275 states have internal predecessors, (346), 52 states have call successors, (52), 18 states have call predecessors, (52), 22 states have return successors, (96), 52 states have call predecessors, (96), 49 states have call successors, (96) [2022-07-11 23:43:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2022-07-11 23:43:36,494 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2022-07-11 23:43:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,495 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2022-07-11 23:43:36,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-11 23:43:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2022-07-11 23:43:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-11 23:43:36,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:36,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:43:36,496 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2022-07-11 23:43:36,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907068854] [2022-07-11 23:43:36,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:36,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907068854] [2022-07-11 23:43:36,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907068854] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:36,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973947822] [2022-07-11 23:43:36,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:36,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:36,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:36,580 INFO L87 Difference]: Start difference. First operand 346 states and 494 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:43:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:36,892 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2022-07-11 23:43:36,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:43:36,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-07-11 23:43:36,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:36,895 INFO L225 Difference]: With dead ends: 659 [2022-07-11 23:43:36,895 INFO L226 Difference]: Without dead ends: 341 [2022-07-11 23:43:36,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:43:36,896 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 232 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:36,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 839 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-07-11 23:43:36,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2022-07-11 23:43:36,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 267 states have (on average 1.2659176029962547) internal successors, (338), 271 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-11 23:43:36,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2022-07-11 23:43:36,918 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2022-07-11 23:43:36,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:36,918 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2022-07-11 23:43:36,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-11 23:43:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2022-07-11 23:43:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:43:36,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:36,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:36,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:43:36,919 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:36,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2022-07-11 23:43:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:36,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814877108] [2022-07-11 23:43:36,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:36,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:36,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:36,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:36,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814877108] [2022-07-11 23:43:36,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814877108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:36,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:36,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-11 23:43:36,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632500177] [2022-07-11 23:43:36,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-11 23:43:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:36,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-11 23:43:36,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:36,975 INFO L87 Difference]: Start difference. First operand 341 states and 481 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:43:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:37,125 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2022-07-11 23:43:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-11 23:43:37,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-11 23:43:37,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:37,128 INFO L225 Difference]: With dead ends: 666 [2022-07-11 23:43:37,128 INFO L226 Difference]: Without dead ends: 353 [2022-07-11 23:43:37,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-11 23:43:37,129 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 51 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:37,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 686 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:43:37,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-07-11 23:43:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2022-07-11 23:43:37,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.262962962962963) internal successors, (341), 274 states have internal predecessors, (341), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-11 23:43:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2022-07-11 23:43:37,150 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2022-07-11 23:43:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:37,150 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2022-07-11 23:43:37,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:43:37,151 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2022-07-11 23:43:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-11 23:43:37,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:37,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:37,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:43:37,151 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2022-07-11 23:43:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:37,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643569152] [2022-07-11 23:43:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:37,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:37,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:37,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643569152] [2022-07-11 23:43:37,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643569152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:37,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:37,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-11 23:43:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100556331] [2022-07-11 23:43:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:37,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-11 23:43:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:37,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-11 23:43:37,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-07-11 23:43:37,231 INFO L87 Difference]: Start difference. First operand 344 states and 484 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:43:37,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:37,485 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2022-07-11 23:43:37,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-11 23:43:37,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 57 [2022-07-11 23:43:37,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:37,488 INFO L225 Difference]: With dead ends: 662 [2022-07-11 23:43:37,488 INFO L226 Difference]: Without dead ends: 347 [2022-07-11 23:43:37,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:37,489 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:37,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1287 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:37,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-11 23:43:37,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2022-07-11 23:43:37,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 270 states have (on average 1.2518518518518518) internal successors, (338), 274 states have internal predecessors, (338), 52 states have call successors, (52), 18 states have call predecessors, (52), 21 states have return successors, (91), 51 states have call predecessors, (91), 49 states have call successors, (91) [2022-07-11 23:43:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2022-07-11 23:43:37,510 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2022-07-11 23:43:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:37,510 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2022-07-11 23:43:37,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-11 23:43:37,510 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2022-07-11 23:43:37,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-11 23:43:37,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:37,511 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:37,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:43:37,511 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:37,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:37,512 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2022-07-11 23:43:37,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:37,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884867392] [2022-07-11 23:43:37,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:37,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:37,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:37,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:37,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:37,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884867392] [2022-07-11 23:43:37,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884867392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:37,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:37,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-11 23:43:37,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756605829] [2022-07-11 23:43:37,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:37,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:43:37,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:37,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:43:37,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:43:37,590 INFO L87 Difference]: Start difference. First operand 344 states and 481 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:37,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:37,906 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2022-07-11 23:43:37,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:37,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 68 [2022-07-11 23:43:37,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:37,908 INFO L225 Difference]: With dead ends: 623 [2022-07-11 23:43:37,908 INFO L226 Difference]: Without dead ends: 322 [2022-07-11 23:43:37,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:43:37,909 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:37,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1228 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:37,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2022-07-11 23:43:37,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2022-07-11 23:43:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 246 states have (on average 1.2560975609756098) internal successors, (309), 252 states have internal predecessors, (309), 49 states have call successors, (49), 18 states have call predecessors, (49), 18 states have return successors, (70), 43 states have call predecessors, (70), 46 states have call successors, (70) [2022-07-11 23:43:37,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2022-07-11 23:43:37,929 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2022-07-11 23:43:37,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:37,929 INFO L495 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2022-07-11 23:43:37,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 5 states have internal predecessors, (56), 3 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2022-07-11 23:43:37,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-11 23:43:37,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:37,930 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:37,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-11 23:43:37,930 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:37,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:37,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2022-07-11 23:43:37,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:37,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785629223] [2022-07-11 23:43:37,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:37,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:37,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:38,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:38,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:38,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:38,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785629223] [2022-07-11 23:43:38,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785629223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:38,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:38,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-11 23:43:38,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855364690] [2022-07-11 23:43:38,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:38,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:43:38,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:38,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:43:38,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:43:38,058 INFO L87 Difference]: Start difference. First operand 314 states and 428 transitions. Second operand has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:38,427 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2022-07-11 23:43:38,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:43:38,427 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 73 [2022-07-11 23:43:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:38,429 INFO L225 Difference]: With dead ends: 350 [2022-07-11 23:43:38,429 INFO L226 Difference]: Without dead ends: 329 [2022-07-11 23:43:38,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:43:38,429 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 126 mSDsluCounter, 1927 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:38,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 2125 Invalid, 884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 833 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:38,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-11 23:43:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2022-07-11 23:43:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-11 23:43:38,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-11 23:43:38,448 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2022-07-11 23:43:38,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:38,448 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-11 23:43:38,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-11 23:43:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-11 23:43:38,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:38,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:38,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-11 23:43:38,450 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:38,450 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2022-07-11 23:43:38,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:38,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110512910] [2022-07-11 23:43:38,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:38,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:38,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:38,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-11 23:43:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:38,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:38,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:38,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110512910] [2022-07-11 23:43:38,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110512910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:38,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:38,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-11 23:43:38,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296282631] [2022-07-11 23:43:38,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:38,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:43:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:38,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:43:38,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:43:38,578 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:38,985 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2022-07-11 23:43:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:43:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 74 [2022-07-11 23:43:38,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:38,987 INFO L225 Difference]: With dead ends: 354 [2022-07-11 23:43:38,987 INFO L226 Difference]: Without dead ends: 333 [2022-07-11 23:43:38,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:43:38,988 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2170 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:38,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 2379 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 887 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-07-11 23:43:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2022-07-11 23:43:39,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 248 states have (on average 1.2540322580645162) internal successors, (311), 255 states have internal predecessors, (311), 49 states have call successors, (49), 18 states have call predecessors, (49), 19 states have return successors, (71), 43 states have call predecessors, (71), 46 states have call successors, (71) [2022-07-11 23:43:39,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2022-07-11 23:43:39,010 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2022-07-11 23:43:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:39,011 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2022-07-11 23:43:39,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-11 23:43:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2022-07-11 23:43:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-11 23:43:39,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:39,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:39,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-11 23:43:39,014 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:39,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:39,014 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2022-07-11 23:43:39,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:39,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353196921] [2022-07-11 23:43:39,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:39,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:39,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-11 23:43:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:39,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:39,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353196921] [2022-07-11 23:43:39,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353196921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:39,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:39,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-11 23:43:39,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735554795] [2022-07-11 23:43:39,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:39,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:43:39,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:39,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:43:39,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:43:39,171 INFO L87 Difference]: Start difference. First operand 317 states and 431 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:43:39,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:39,877 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2022-07-11 23:43:39,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:43:39,878 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 82 [2022-07-11 23:43:39,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:39,880 INFO L225 Difference]: With dead ends: 468 [2022-07-11 23:43:39,880 INFO L226 Difference]: Without dead ends: 429 [2022-07-11 23:43:39,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:43:39,881 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 194 mSDsluCounter, 2445 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2688 SdHoareTripleChecker+Invalid, 1574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:39,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 2688 Invalid, 1574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:39,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-07-11 23:43:39,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2022-07-11 23:43:39,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 316 states have (on average 1.2626582278481013) internal successors, (399), 327 states have internal predecessors, (399), 76 states have call successors, (76), 18 states have call predecessors, (76), 20 states have return successors, (110), 67 states have call predecessors, (110), 72 states have call successors, (110) [2022-07-11 23:43:39,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2022-07-11 23:43:39,905 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2022-07-11 23:43:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:39,906 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2022-07-11 23:43:39,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 11 states have internal predecessors, (69), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:43:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2022-07-11 23:43:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:43:39,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:39,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:39,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-11 23:43:39,907 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:39,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:39,907 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2022-07-11 23:43:39,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:39,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093113747] [2022-07-11 23:43:39,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:39,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:39,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093113747] [2022-07-11 23:43:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093113747] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:40,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:40,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:40,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836665744] [2022-07-11 23:43:40,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:40,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:40,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:40,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:40,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:40,003 INFO L87 Difference]: Start difference. First operand 413 states and 585 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-11 23:43:40,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:40,370 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2022-07-11 23:43:40,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-11 23:43:40,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-11 23:43:40,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:40,373 INFO L225 Difference]: With dead ends: 809 [2022-07-11 23:43:40,373 INFO L226 Difference]: Without dead ends: 538 [2022-07-11 23:43:40,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:43:40,375 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:40,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:40,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2022-07-11 23:43:40,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2022-07-11 23:43:40,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.2532299741602067) internal successors, (485), 397 states have internal predecessors, (485), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (114), 73 states have call predecessors, (114), 75 states have call successors, (114) [2022-07-11 23:43:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2022-07-11 23:43:40,421 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2022-07-11 23:43:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:40,421 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2022-07-11 23:43:40,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 6 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-11 23:43:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2022-07-11 23:43:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:43:40,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:40,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:40,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-11 23:43:40,423 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2022-07-11 23:43:40,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:40,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569171058] [2022-07-11 23:43:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:40,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:40,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:40,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:40,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:40,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569171058] [2022-07-11 23:43:40,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569171058] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:40,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:40,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:40,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735950895] [2022-07-11 23:43:40,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:40,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:40,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:40,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:40,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:40,510 INFO L87 Difference]: Start difference. First operand 496 states and 678 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-11 23:43:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:40,922 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2022-07-11 23:43:40,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-11 23:43:40,922 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 84 [2022-07-11 23:43:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:40,925 INFO L225 Difference]: With dead ends: 867 [2022-07-11 23:43:40,925 INFO L226 Difference]: Without dead ends: 496 [2022-07-11 23:43:40,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:43:40,926 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 447 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 190 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 190 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:40,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 714 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [190 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:40,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-07-11 23:43:40,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2022-07-11 23:43:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 387 states have (on average 1.248062015503876) internal successors, (483), 397 states have internal predecessors, (483), 79 states have call successors, (79), 25 states have call predecessors, (79), 29 states have return successors, (106), 73 states have call predecessors, (106), 75 states have call successors, (106) [2022-07-11 23:43:40,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2022-07-11 23:43:40,953 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2022-07-11 23:43:40,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:40,953 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2022-07-11 23:43:40,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 7 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-11 23:43:40,954 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2022-07-11 23:43:40,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-11 23:43:40,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:40,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:40,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-11 23:43:40,954 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:40,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:40,955 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2022-07-11 23:43:40,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:40,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013690370] [2022-07-11 23:43:40,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:40,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:40,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:41,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-11 23:43:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-11 23:43:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:41,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:41,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013690370] [2022-07-11 23:43:41,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013690370] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:41,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:41,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-11 23:43:41,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676199433] [2022-07-11 23:43:41,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:41,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-11 23:43:41,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-11 23:43:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:43:41,103 INFO L87 Difference]: Start difference. First operand 496 states and 668 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:43:41,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:41,820 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2022-07-11 23:43:41,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-11 23:43:41,820 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) Word has length 83 [2022-07-11 23:43:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:41,824 INFO L225 Difference]: With dead ends: 657 [2022-07-11 23:43:41,824 INFO L226 Difference]: Without dead ends: 610 [2022-07-11 23:43:41,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:43:41,826 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:41,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 2335 Invalid, 1607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:41,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-11 23:43:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2022-07-11 23:43:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 385 states have (on average 1.2493506493506494) internal successors, (481), 394 states have internal predecessors, (481), 79 states have call successors, (79), 25 states have call predecessors, (79), 28 states have return successors, (105), 73 states have call predecessors, (105), 75 states have call successors, (105) [2022-07-11 23:43:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2022-07-11 23:43:41,860 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2022-07-11 23:43:41,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:41,861 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2022-07-11 23:43:41,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-11 23:43:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2022-07-11 23:43:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:43:41,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:41,862 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:41,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-11 23:43:41,862 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:41,862 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2022-07-11 23:43:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438840719] [2022-07-11 23:43:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:41,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:41,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:41,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438840719] [2022-07-11 23:43:41,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438840719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:41,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:41,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-11 23:43:41,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511293684] [2022-07-11 23:43:41,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:41,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:43:41,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:43:41,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:41,991 INFO L87 Difference]: Start difference. First operand 493 states and 665 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:43:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:42,613 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2022-07-11 23:43:42,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 23:43:42,613 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-11 23:43:42,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:42,617 INFO L225 Difference]: With dead ends: 957 [2022-07-11 23:43:42,617 INFO L226 Difference]: Without dead ends: 931 [2022-07-11 23:43:42,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=739, Unknown=0, NotChecked=0, Total=870 [2022-07-11 23:43:42,619 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 348 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:42,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 2112 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-11 23:43:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2022-07-11 23:43:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2022-07-11 23:43:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 461 states have (on average 1.2190889370932756) internal successors, (562), 473 states have internal predecessors, (562), 85 states have call successors, (85), 31 states have call predecessors, (85), 38 states have return successors, (115), 80 states have call predecessors, (115), 81 states have call successors, (115) [2022-07-11 23:43:42,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2022-07-11 23:43:42,666 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2022-07-11 23:43:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:42,666 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2022-07-11 23:43:42,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:43:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2022-07-11 23:43:42,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-11 23:43:42,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:42,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:42,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-11 23:43:42,667 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:42,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2022-07-11 23:43:42,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:42,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923305694] [2022-07-11 23:43:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:42,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:42,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-11 23:43:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:42,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:42,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:42,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:42,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923305694] [2022-07-11 23:43:42,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923305694] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:42,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:42,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-11 23:43:42,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967266010] [2022-07-11 23:43:42,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:42,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-11 23:43:42,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:42,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-11 23:43:42,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:42,790 INFO L87 Difference]: Start difference. First operand 585 states and 762 transitions. Second operand has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:43:43,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:43,427 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2022-07-11 23:43:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-11 23:43:43,427 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 84 [2022-07-11 23:43:43,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:43,431 INFO L225 Difference]: With dead ends: 952 [2022-07-11 23:43:43,431 INFO L226 Difference]: Without dead ends: 918 [2022-07-11 23:43:43,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=787, Unknown=0, NotChecked=0, Total=930 [2022-07-11 23:43:43,432 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 273 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 3201 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:43,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 3201 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-11 23:43:43,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2022-07-11 23:43:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2022-07-11 23:43:43,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 366 states have (on average 1.2486338797814207) internal successors, (457), 375 states have internal predecessors, (457), 75 states have call successors, (75), 23 states have call predecessors, (75), 26 states have return successors, (100), 69 states have call predecessors, (100), 71 states have call successors, (100) [2022-07-11 23:43:43,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2022-07-11 23:43:43,467 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2022-07-11 23:43:43,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:43,467 INFO L495 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2022-07-11 23:43:43,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.4375) internal successors, (71), 10 states have internal predecessors, (71), 4 states have call successors, (7), 6 states have call predecessors, (7), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-11 23:43:43,467 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2022-07-11 23:43:43,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-11 23:43:43,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:43,468 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:43,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-11 23:43:43,468 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:43,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:43,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2022-07-11 23:43:43,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:43,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875051667] [2022-07-11 23:43:43,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:43,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:43,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:43,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-11 23:43:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:43,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:43,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875051667] [2022-07-11 23:43:43,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875051667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:43,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:43,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-11 23:43:43,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131135887] [2022-07-11 23:43:43,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:43,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:43:43,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:43,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:43:43,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:43:43,597 INFO L87 Difference]: Start difference. First operand 468 states and 632 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-11 23:43:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:44,432 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2022-07-11 23:43:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-11 23:43:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-11 23:43:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:44,436 INFO L225 Difference]: With dead ends: 932 [2022-07-11 23:43:44,436 INFO L226 Difference]: Without dead ends: 885 [2022-07-11 23:43:44,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-11 23:43:44,437 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 531 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2123 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 1445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:44,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2123 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-11 23:43:44,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-07-11 23:43:44,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2022-07-11 23:43:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 666 states have (on average 1.2147147147147148) internal successors, (809), 684 states have internal predecessors, (809), 142 states have call successors, (142), 43 states have call predecessors, (142), 49 states have return successors, (185), 130 states have call predecessors, (185), 137 states have call successors, (185) [2022-07-11 23:43:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2022-07-11 23:43:44,510 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2022-07-11 23:43:44,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:44,511 INFO L495 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2022-07-11 23:43:44,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-11 23:43:44,512 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2022-07-11 23:43:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-11 23:43:44,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:44,517 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-11 23:43:44,517 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:44,518 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2022-07-11 23:43:44,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:44,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949384993] [2022-07-11 23:43:44,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:44,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-11 23:43:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-11 23:43:44,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:44,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949384993] [2022-07-11 23:43:44,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949384993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:44,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:44,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:44,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647300290] [2022-07-11 23:43:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:44,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:44,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:44,609 INFO L87 Difference]: Start difference. First operand 858 states and 1136 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 23:43:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:44,985 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2022-07-11 23:43:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:44,985 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 95 [2022-07-11 23:43:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:44,989 INFO L225 Difference]: With dead ends: 1692 [2022-07-11 23:43:44,990 INFO L226 Difference]: Without dead ends: 1142 [2022-07-11 23:43:44,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:44,992 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:44,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1354 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2022-07-11 23:43:45,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2022-07-11 23:43:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 650 states have (on average 1.1953846153846155) internal successors, (777), 664 states have internal predecessors, (777), 134 states have call successors, (134), 43 states have call predecessors, (134), 49 states have return successors, (173), 126 states have call predecessors, (173), 129 states have call successors, (173) [2022-07-11 23:43:45,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2022-07-11 23:43:45,067 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2022-07-11 23:43:45,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:45,067 INFO L495 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2022-07-11 23:43:45,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (8), 6 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-07-11 23:43:45,067 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2022-07-11 23:43:45,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-11 23:43:45,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:45,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:45,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-11 23:43:45,069 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:45,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2022-07-11 23:43:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:45,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175496553] [2022-07-11 23:43:45,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:45,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-11 23:43:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-11 23:43:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-11 23:43:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:45,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:43:45,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:45,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175496553] [2022-07-11 23:43:45,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175496553] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:45,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:45,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-11 23:43:45,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409930169] [2022-07-11 23:43:45,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:45,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-11 23:43:45,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:45,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-11 23:43:45,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2022-07-11 23:43:45,200 INFO L87 Difference]: Start difference. First operand 834 states and 1084 transitions. Second operand has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-11 23:43:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:46,188 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2022-07-11 23:43:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-11 23:43:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 93 [2022-07-11 23:43:46,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:46,191 INFO L225 Difference]: With dead ends: 858 [2022-07-11 23:43:46,191 INFO L226 Difference]: Without dead ends: 809 [2022-07-11 23:43:46,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2022-07-11 23:43:46,192 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 3028 SdHoareTripleChecker+Invalid, 2155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:46,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 3028 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-11 23:43:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2022-07-11 23:43:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2022-07-11 23:43:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 242 states have (on average 1.1363636363636365) internal successors, (275), 247 states have internal predecessors, (275), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (48), 37 states have call predecessors, (48), 38 states have call successors, (48) [2022-07-11 23:43:46,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2022-07-11 23:43:46,220 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2022-07-11 23:43:46,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:46,220 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2022-07-11 23:43:46,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.588235294117647) internal successors, (78), 10 states have internal predecessors, (78), 4 states have call successors, (8), 7 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-11 23:43:46,220 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2022-07-11 23:43:46,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-11 23:43:46,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:46,221 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:46,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-11 23:43:46,222 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:46,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:46,222 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2022-07-11 23:43:46,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:46,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97105486] [2022-07-11 23:43:46,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:46,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-11 23:43:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-11 23:43:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-11 23:43:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,305 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-11 23:43:46,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97105486] [2022-07-11 23:43:46,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97105486] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-11 23:43:46,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252846473] [2022-07-11 23:43:46,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:43:46,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:43:46,307 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) [2022-07-11 23:43:46,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-11 23:43:46,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-11 23:43:46,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:43:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-11 23:43:46,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-11 23:43:46,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252846473] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:46,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-11 23:43:46,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2022-07-11 23:43:46,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55643632] [2022-07-11 23:43:46,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:46,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-11 23:43:46,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:46,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-11 23:43:46,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:43:46,572 INFO L87 Difference]: Start difference. First operand 306 states and 364 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-11 23:43:46,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:46,657 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2022-07-11 23:43:46,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-11 23:43:46,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 133 [2022-07-11 23:43:46,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:46,658 INFO L225 Difference]: With dead ends: 513 [2022-07-11 23:43:46,658 INFO L226 Difference]: Without dead ends: 327 [2022-07-11 23:43:46,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:46,659 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:46,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 715 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:43:46,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2022-07-11 23:43:46,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2022-07-11 23:43:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 256 states have (on average 1.12890625) internal successors, (289), 262 states have internal predecessors, (289), 41 states have call successors, (41), 21 states have call predecessors, (41), 24 states have return successors, (55), 38 states have call predecessors, (55), 38 states have call successors, (55) [2022-07-11 23:43:46,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2022-07-11 23:43:46,685 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2022-07-11 23:43:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:46,686 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2022-07-11 23:43:46,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 5 states have internal predecessors, (94), 2 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-11 23:43:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2022-07-11 23:43:46,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-11 23:43:46,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:46,688 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:43:46,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:43:46,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-11 23:43:46,892 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:46,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:46,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2022-07-11 23:43:46,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:46,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625030938] [2022-07-11 23:43:46,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:46,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-11 23:43:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-11 23:43:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-11 23:43:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:46,994 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-07-11 23:43:46,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:46,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625030938] [2022-07-11 23:43:46,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625030938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:46,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:46,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:46,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312844845] [2022-07-11 23:43:46,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:46,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:46,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:46,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:46,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:46,996 INFO L87 Difference]: Start difference. First operand 322 states and 385 transitions. Second operand has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-11 23:43:47,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:47,320 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2022-07-11 23:43:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:47,320 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 134 [2022-07-11 23:43:47,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:47,322 INFO L225 Difference]: With dead ends: 534 [2022-07-11 23:43:47,322 INFO L226 Difference]: Without dead ends: 362 [2022-07-11 23:43:47,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:47,323 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:47,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1066 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-11 23:43:47,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2022-07-11 23:43:47,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 251 states have (on average 1.1155378486055776) internal successors, (280), 256 states have internal predecessors, (280), 39 states have call successors, (39), 21 states have call predecessors, (39), 24 states have return successors, (51), 37 states have call predecessors, (51), 36 states have call successors, (51) [2022-07-11 23:43:47,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2022-07-11 23:43:47,350 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2022-07-11 23:43:47,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:47,351 INFO L495 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2022-07-11 23:43:47,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (10), 6 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-11 23:43:47,351 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2022-07-11 23:43:47,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-11 23:43:47,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:47,353 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:43:47,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-11 23:43:47,353 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:47,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:47,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2022-07-11 23:43:47,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:47,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997922452] [2022-07-11 23:43:47,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:47,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:47,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:47,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-11 23:43:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-11 23:43:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-11 23:43:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-11 23:43:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-11 23:43:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,465 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-11 23:43:47,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:47,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997922452] [2022-07-11 23:43:47,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997922452] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:47,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:47,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:47,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869590792] [2022-07-11 23:43:47,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:47,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:47,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:47,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:47,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:47,467 INFO L87 Difference]: Start difference. First operand 315 states and 370 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-11 23:43:47,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:47,792 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2022-07-11 23:43:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:47,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 170 [2022-07-11 23:43:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:47,795 INFO L225 Difference]: With dead ends: 384 [2022-07-11 23:43:47,795 INFO L226 Difference]: Without dead ends: 317 [2022-07-11 23:43:47,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:47,796 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 98 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:47,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 909 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-11 23:43:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-11 23:43:47,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2022-07-11 23:43:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 176 states have (on average 1.1136363636363635) internal successors, (196), 178 states have internal predecessors, (196), 24 states have call successors, (24), 14 states have call predecessors, (24), 16 states have return successors, (30), 24 states have call predecessors, (30), 22 states have call successors, (30) [2022-07-11 23:43:47,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2022-07-11 23:43:47,844 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2022-07-11 23:43:47,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:47,844 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2022-07-11 23:43:47,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 5 states have internal predecessors, (79), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-11 23:43:47,844 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2022-07-11 23:43:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-11 23:43:47,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:43:47,845 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2022-07-11 23:43:47,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-11 23:43:47,846 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:43:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:43:47,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2022-07-11 23:43:47,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:43:47,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324973221] [2022-07-11 23:43:47,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:43:47,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:43:47,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-11 23:43:47,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-11 23:43:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-11 23:43:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-11 23:43:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-11 23:43:47,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-11 23:43:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-11 23:43:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-11 23:43:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-11 23:43:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-11 23:43:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:43:47,976 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-11 23:43:47,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:43:47,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324973221] [2022-07-11 23:43:47,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324973221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:43:47,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:43:47,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-11 23:43:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790670953] [2022-07-11 23:43:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:43:47,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-11 23:43:47,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:43:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-11 23:43:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-11 23:43:47,977 INFO L87 Difference]: Start difference. First operand 217 states and 250 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-11 23:43:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:43:48,264 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2022-07-11 23:43:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:43:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) Word has length 173 [2022-07-11 23:43:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:43:48,265 INFO L225 Difference]: With dead ends: 223 [2022-07-11 23:43:48,265 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:43:48,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:43:48,266 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 72 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:43:48,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 713 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-11 23:43:48,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:43:48,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:43:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:43:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:43:48,267 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2022-07-11 23:43:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:43:48,267 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:43:48,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 5 states have internal predecessors, (82), 2 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 1 states have call successors, (10) [2022-07-11 23:43:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:43:48,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:43:48,269 INFO L805 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:43:48,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-11 23:43:48,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:44:13,541 WARN L233 SmtUtils]: Spent 10.88s on a formula simplification. DAG size of input: 122 DAG size of output: 120 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-11 23:44:25,185 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-11 23:44:30,977 WARN L233 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-11 23:44:40,223 WARN L233 SmtUtils]: Spent 5.80s on a formula simplification. DAG size of input: 121 DAG size of output: 119 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-11 23:46:03,933 WARN L233 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-07-11 23:47:23,292 WARN L233 SmtUtils]: Spent 1.32m on a formula simplification. DAG size of input: 119 DAG size of output: 115 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)