./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 ae007674 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-dev-ae00767 [2021-12-27 21:54:39,107 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-27 21:54:39,109 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-27 21:54:39,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-27 21:54:39,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-27 21:54:39,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-27 21:54:39,148 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-27 21:54:39,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-27 21:54:39,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-27 21:54:39,162 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-27 21:54:39,164 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-27 21:54:39,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-27 21:54:39,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-27 21:54:39,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-27 21:54:39,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-27 21:54:39,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-27 21:54:39,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-27 21:54:39,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-27 21:54:39,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-27 21:54:39,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-27 21:54:39,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-27 21:54:39,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-27 21:54:39,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-27 21:54:39,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-27 21:54:39,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-27 21:54:39,194 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-27 21:54:39,194 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-27 21:54:39,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-27 21:54:39,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-27 21:54:39,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-27 21:54:39,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-27 21:54:39,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-27 21:54:39,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-27 21:54:39,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-27 21:54:39,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-27 21:54:39,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-27 21:54:39,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-27 21:54:39,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-27 21:54:39,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-27 21:54:39,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-27 21:54:39,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-27 21:54:39,206 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-27 21:54:39,246 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-27 21:54:39,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-27 21:54:39,247 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-27 21:54:39,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-27 21:54:39,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-27 21:54:39,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-27 21:54:39,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-27 21:54:39,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-27 21:54:39,251 INFO L138 SettingsManager]: * Use SBE=true [2021-12-27 21:54:39,251 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-27 21:54:39,252 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-27 21:54:39,252 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-27 21:54:39,252 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-27 21:54:39,252 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-27 21:54:39,253 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-27 21:54:39,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-27 21:54:39,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-27 21:54:39,254 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-27 21:54:39,254 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-27 21:54:39,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:54:39,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-27 21:54:39,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-27 21:54:39,255 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-27 21:54:39,255 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-27 21:54:39,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-27 21:54:39,256 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-27 21:54:39,256 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-27 21:54:39,256 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-27 21:54:39,257 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 [2021-12-27 21:54:39,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-27 21:54:39,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-27 21:54:39,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-27 21:54:39,635 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-27 21:54:39,635 INFO L275 PluginConnector]: CDTParser initialized [2021-12-27 21:54:39,637 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 [2021-12-27 21:54:39,696 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14621a28c/211f008055a24078829aa0379d2b3405/FLAGfbc64a555 [2021-12-27 21:54:40,233 INFO L306 CDTParser]: Found 1 translation units. [2021-12-27 21:54:40,234 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/diskperf_simpl1.cil.c [2021-12-27 21:54:40,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14621a28c/211f008055a24078829aa0379d2b3405/FLAGfbc64a555 [2021-12-27 21:54:40,713 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14621a28c/211f008055a24078829aa0379d2b3405 [2021-12-27 21:54:40,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-27 21:54:40,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-27 21:54:40,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-27 21:54:40,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-27 21:54:40,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-27 21:54:40,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:40" (1/1) ... [2021-12-27 21:54:40,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3c6061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:40, skipping insertion in model container [2021-12-27 21:54:40,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:54:40" (1/1) ... [2021-12-27 21:54:40,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-27 21:54:40,766 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-27 21:54:40,906 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] [2021-12-27 21:54:41,021 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:54:41,029 INFO L203 MainTranslator]: Completed pre-run [2021-12-27 21:54:41,041 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] [2021-12-27 21:54:41,094 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-27 21:54:41,119 INFO L208 MainTranslator]: Completed translation [2021-12-27 21:54:41,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41 WrapperNode [2021-12-27 21:54:41,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-27 21:54:41,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-27 21:54:41,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-27 21:54:41,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-27 21:54:41,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,153 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,201 INFO L137 Inliner]: procedures = 38, calls = 66, calls flagged for inlining = 17, calls inlined = 17, statements flattened = 755 [2021-12-27 21:54:41,201 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-27 21:54:41,202 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-27 21:54:41,202 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-27 21:54:41,202 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-27 21:54:41,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,218 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,282 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-27 21:54:41,292 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-27 21:54:41,292 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-27 21:54:41,292 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-27 21:54:41,293 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (1/1) ... [2021-12-27 21:54:41,299 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-27 21:54:41,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:54:41,325 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) [2021-12-27 21:54:41,347 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 [2021-12-27 21:54:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-27 21:54:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2021-12-27 21:54:41,360 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2021-12-27 21:54:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2021-12-27 21:54:41,361 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2021-12-27 21:54:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2021-12-27 21:54:41,361 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2021-12-27 21:54:41,361 INFO L130 BoogieDeclarations]: Found specification of procedure IoBuildDeviceIoControlRequest [2021-12-27 21:54:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure IoBuildDeviceIoControlRequest [2021-12-27 21:54:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfForwardIrpSynchronous [2021-12-27 21:54:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfForwardIrpSynchronous [2021-12-27 21:54:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2021-12-27 21:54:41,362 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2021-12-27 21:54:41,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-27 21:54:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2021-12-27 21:54:41,363 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2021-12-27 21:54:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIrpCompletion [2021-12-27 21:54:41,363 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIrpCompletion [2021-12-27 21:54:41,363 INFO L130 BoogieDeclarations]: Found specification of procedure DiskPerfIoCompletion [2021-12-27 21:54:41,363 INFO L138 BoogieDeclarations]: Found implementation of procedure DiskPerfIoCompletion [2021-12-27 21:54:41,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-27 21:54:41,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-27 21:54:41,568 INFO L234 CfgBuilder]: Building ICFG [2021-12-27 21:54:41,569 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-27 21:54:41,574 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:41,643 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !false; [2021-12-27 21:54:41,647 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume false; [2021-12-27 21:54:41,649 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:41,678 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##16: assume !false; [2021-12-27 21:54:41,679 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume false; [2021-12-27 21:54:41,727 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:41,733 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:41,751 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:42,115 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume !false; [2021-12-27 21:54:42,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##38: assume false; [2021-12-27 21:54:42,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-12-27 21:54:42,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-12-27 21:54:42,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !false; [2021-12-27 21:54:42,116 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume false; [2021-12-27 21:54:42,118 WARN L813 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-12-27 21:54:42,139 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##15: assume !false; [2021-12-27 21:54:42,140 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##14: assume false; [2021-12-27 21:54:42,199 INFO L275 CfgBuilder]: Performing block encoding [2021-12-27 21:54:42,208 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-27 21:54:42,208 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-27 21:54:42,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:42 BoogieIcfgContainer [2021-12-27 21:54:42,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-27 21:54:42,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-27 21:54:42,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-27 21:54:42,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-27 21:54:42,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:54:40" (1/3) ... [2021-12-27 21:54:42,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ee3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:42, skipping insertion in model container [2021-12-27 21:54:42,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:54:41" (2/3) ... [2021-12-27 21:54:42,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d7ee3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:54:42, skipping insertion in model container [2021-12-27 21:54:42,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:54:42" (3/3) ... [2021-12-27 21:54:42,218 INFO L111 eAbstractionObserver]: Analyzing ICFG diskperf_simpl1.cil.c [2021-12-27 21:54:42,223 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-27 21:54:42,223 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-27 21:54:42,281 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-27 21:54:42,291 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-27 21:54:42,291 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-27 21:54:42,315 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) [2021-12-27 21:54:42,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-27 21:54:42,320 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:42,320 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:42,321 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:42,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:42,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1911400740, now seen corresponding path program 1 times [2021-12-27 21:54:42,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:42,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740856041] [2021-12-27 21:54:42,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:42,334 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:42,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740856041] [2021-12-27 21:54:42,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740856041] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:42,510 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:42,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:42,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375471195] [2021-12-27 21:54:42,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:42,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:42,517 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:42,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:42,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:42,547 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) [2021-12-27 21:54:42,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:42,672 INFO L93 Difference]: Finished difference Result 449 states and 690 transitions. [2021-12-27 21:54:42,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:42,680 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 [2021-12-27 21:54:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:42,696 INFO L225 Difference]: With dead ends: 449 [2021-12-27 21:54:42,696 INFO L226 Difference]: Without dead ends: 236 [2021-12-27 21:54:42,705 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:42,709 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:42,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 635 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2021-12-27 21:54:42,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2021-12-27 21:54:42,784 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) [2021-12-27 21:54:42,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 332 transitions. [2021-12-27 21:54:42,793 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 332 transitions. Word has length 13 [2021-12-27 21:54:42,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:42,794 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 332 transitions. [2021-12-27 21:54:42,794 INFO L471 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) [2021-12-27 21:54:42,795 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 332 transitions. [2021-12-27 21:54:42,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-27 21:54:42,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:42,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:42,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-27 21:54:42,798 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:42,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1078790828, now seen corresponding path program 1 times [2021-12-27 21:54:42,799 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346828635] [2021-12-27 21:54:42,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:42,801 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:42,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:42,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346828635] [2021-12-27 21:54:42,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346828635] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:42,896 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:42,896 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:42,896 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993052879] [2021-12-27 21:54:42,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:42,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:42,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:42,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:42,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:42,904 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) [2021-12-27 21:54:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:43,065 INFO L93 Difference]: Finished difference Result 536 states and 777 transitions. [2021-12-27 21:54:43,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:43,066 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 [2021-12-27 21:54:43,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:43,072 INFO L225 Difference]: With dead ends: 536 [2021-12-27 21:54:43,072 INFO L226 Difference]: Without dead ends: 377 [2021-12-27 21:54:43,077 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:43,079 INFO L933 BasicCegarLoop]: 455 mSDtfsCounter, 250 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2021-12-27 21:54:43,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 680 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:43,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-27 21:54:43,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 357. [2021-12-27 21:54:43,120 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) [2021-12-27 21:54:43,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 518 transitions. [2021-12-27 21:54:43,125 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 518 transitions. Word has length 15 [2021-12-27 21:54:43,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:43,126 INFO L470 AbstractCegarLoop]: Abstraction has 357 states and 518 transitions. [2021-12-27 21:54:43,126 INFO L471 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) [2021-12-27 21:54:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 518 transitions. [2021-12-27 21:54:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-12-27 21:54:43,129 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:43,129 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-27 21:54:43,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-27 21:54:43,130 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:43,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:43,130 INFO L85 PathProgramCache]: Analyzing trace with hash -320586800, now seen corresponding path program 1 times [2021-12-27 21:54:43,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:43,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132788054] [2021-12-27 21:54:43,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:43,131 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:43,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:43,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:43,215 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:43,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132788054] [2021-12-27 21:54:43,215 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132788054] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:43,215 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:43,215 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:43,216 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426512661] [2021-12-27 21:54:43,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:43,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:43,216 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:43,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:43,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:43,217 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) [2021-12-27 21:54:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:43,251 INFO L93 Difference]: Finished difference Result 823 states and 1229 transitions. [2021-12-27 21:54:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:43,252 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 [2021-12-27 21:54:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:43,257 INFO L225 Difference]: With dead ends: 823 [2021-12-27 21:54:43,257 INFO L226 Difference]: Without dead ends: 550 [2021-12-27 21:54:43,274 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:43,275 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:43,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [255 Valid, 578 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:43,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-12-27 21:54:43,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 519. [2021-12-27 21:54:43,300 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) [2021-12-27 21:54:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 772 transitions. [2021-12-27 21:54:43,304 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 772 transitions. Word has length 20 [2021-12-27 21:54:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:43,305 INFO L470 AbstractCegarLoop]: Abstraction has 519 states and 772 transitions. [2021-12-27 21:54:43,305 INFO L471 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) [2021-12-27 21:54:43,305 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 772 transitions. [2021-12-27 21:54:43,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-12-27 21:54:43,307 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:43,307 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:43,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-27 21:54:43,307 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:43,308 INFO L85 PathProgramCache]: Analyzing trace with hash -175921138, now seen corresponding path program 1 times [2021-12-27 21:54:43,308 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:43,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113628807] [2021-12-27 21:54:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:43,309 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:43,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:43,346 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:43,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113628807] [2021-12-27 21:54:43,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113628807] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:43,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:43,347 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:43,347 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870423710] [2021-12-27 21:54:43,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:43,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:43,348 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:43,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:43,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:43,348 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) [2021-12-27 21:54:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:43,415 INFO L93 Difference]: Finished difference Result 534 states and 792 transitions. [2021-12-27 21:54:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:43,416 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 [2021-12-27 21:54:43,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:43,420 INFO L225 Difference]: With dead ends: 534 [2021-12-27 21:54:43,421 INFO L226 Difference]: Without dead ends: 530 [2021-12-27 21:54:43,421 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:43,429 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:43,431 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 557 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:43,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-12-27 21:54:43,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 529. [2021-12-27 21:54:43,466 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) [2021-12-27 21:54:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 785 transitions. [2021-12-27 21:54:43,471 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 785 transitions. Word has length 24 [2021-12-27 21:54:43,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:43,472 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 785 transitions. [2021-12-27 21:54:43,472 INFO L471 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) [2021-12-27 21:54:43,472 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 785 transitions. [2021-12-27 21:54:43,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-27 21:54:43,476 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:43,477 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:43,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-27 21:54:43,477 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:43,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:43,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1035800982, now seen corresponding path program 1 times [2021-12-27 21:54:43,478 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:43,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616468326] [2021-12-27 21:54:43,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:43,481 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:43,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-27 21:54:43,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:43,639 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:43,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616468326] [2021-12-27 21:54:43,641 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616468326] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:43,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:43,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:43,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408330785] [2021-12-27 21:54:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:43,642 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:43,642 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:43,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:43,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:43,643 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) [2021-12-27 21:54:44,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:44,028 INFO L93 Difference]: Finished difference Result 582 states and 861 transitions. [2021-12-27 21:54:44,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:44,029 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 [2021-12-27 21:54:44,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:44,032 INFO L225 Difference]: With dead ends: 582 [2021-12-27 21:54:44,033 INFO L226 Difference]: Without dead ends: 571 [2021-12-27 21:54:44,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:44,034 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:44,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [419 Valid, 798 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-27 21:54:44,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2021-12-27 21:54:44,059 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) [2021-12-27 21:54:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 826 transitions. [2021-12-27 21:54:44,063 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 826 transitions. Word has length 27 [2021-12-27 21:54:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:44,063 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 826 transitions. [2021-12-27 21:54:44,063 INFO L471 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) [2021-12-27 21:54:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 826 transitions. [2021-12-27 21:54:44,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-27 21:54:44,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:44,065 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:44,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-27 21:54:44,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:44,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:44,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1813713707, now seen corresponding path program 1 times [2021-12-27 21:54:44,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:44,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121750450] [2021-12-27 21:54:44,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:44,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-27 21:54:44,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:44,142 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:44,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121750450] [2021-12-27 21:54:44,142 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121750450] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:44,142 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:44,143 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:44,143 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128405234] [2021-12-27 21:54:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:44,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:44,143 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:44,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:44,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:44,144 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) [2021-12-27 21:54:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:44,473 INFO L93 Difference]: Finished difference Result 579 states and 854 transitions. [2021-12-27 21:54:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:44,474 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 [2021-12-27 21:54:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:44,478 INFO L225 Difference]: With dead ends: 579 [2021-12-27 21:54:44,478 INFO L226 Difference]: Without dead ends: 571 [2021-12-27 21:54:44,479 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:44,479 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:44,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [417 Valid, 799 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:44,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2021-12-27 21:54:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 556. [2021-12-27 21:54:44,505 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) [2021-12-27 21:54:44,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 825 transitions. [2021-12-27 21:54:44,509 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 825 transitions. Word has length 28 [2021-12-27 21:54:44,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:44,509 INFO L470 AbstractCegarLoop]: Abstraction has 556 states and 825 transitions. [2021-12-27 21:54:44,510 INFO L471 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) [2021-12-27 21:54:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 825 transitions. [2021-12-27 21:54:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-12-27 21:54:44,514 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:44,514 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:44,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-27 21:54:44,515 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:44,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 123360193, now seen corresponding path program 1 times [2021-12-27 21:54:44,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:44,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959100530] [2021-12-27 21:54:44,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:44,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-27 21:54:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:44,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:44,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959100530] [2021-12-27 21:54:44,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959100530] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:44,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:44,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:44,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22332981] [2021-12-27 21:54:44,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:44,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:44,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:44,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:44,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:44,552 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) [2021-12-27 21:54:44,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:44,791 INFO L93 Difference]: Finished difference Result 1018 states and 1542 transitions. [2021-12-27 21:54:44,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:44,792 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 [2021-12-27 21:54:44,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:44,797 INFO L225 Difference]: With dead ends: 1018 [2021-12-27 21:54:44,798 INFO L226 Difference]: Without dead ends: 989 [2021-12-27 21:54:44,799 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:44,799 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:44,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [423 Valid, 772 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:44,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2021-12-27 21:54:44,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 949. [2021-12-27 21:54:44,851 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) [2021-12-27 21:54:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1446 transitions. [2021-12-27 21:54:44,860 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1446 transitions. Word has length 29 [2021-12-27 21:54:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:44,863 INFO L470 AbstractCegarLoop]: Abstraction has 949 states and 1446 transitions. [2021-12-27 21:54:44,863 INFO L471 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) [2021-12-27 21:54:44,863 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1446 transitions. [2021-12-27 21:54:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-12-27 21:54:44,866 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:44,866 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:44,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-27 21:54:44,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -462412845, now seen corresponding path program 1 times [2021-12-27 21:54:44,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390547856] [2021-12-27 21:54:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:44,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-27 21:54:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:44,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:44,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390547856] [2021-12-27 21:54:44,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390547856] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:44,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:44,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:44,922 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116319975] [2021-12-27 21:54:44,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:44,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:44,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:44,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:44,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:44,924 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) [2021-12-27 21:54:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:45,122 INFO L93 Difference]: Finished difference Result 985 states and 1494 transitions. [2021-12-27 21:54:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:45,122 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 [2021-12-27 21:54:45,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:45,128 INFO L225 Difference]: With dead ends: 985 [2021-12-27 21:54:45,128 INFO L226 Difference]: Without dead ends: 966 [2021-12-27 21:54:45,129 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:45,130 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:45,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [86 Valid, 998 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-12-27 21:54:45,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 945. [2021-12-27 21:54:45,169 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) [2021-12-27 21:54:45,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1440 transitions. [2021-12-27 21:54:45,176 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1440 transitions. Word has length 30 [2021-12-27 21:54:45,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:45,176 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1440 transitions. [2021-12-27 21:54:45,176 INFO L471 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) [2021-12-27 21:54:45,176 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1440 transitions. [2021-12-27 21:54:45,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:54:45,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:45,177 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:45,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-27 21:54:45,178 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:45,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:45,178 INFO L85 PathProgramCache]: Analyzing trace with hash 415913558, now seen corresponding path program 1 times [2021-12-27 21:54:45,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:45,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369248214] [2021-12-27 21:54:45,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:45,179 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:45,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:45,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:45,218 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:45,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369248214] [2021-12-27 21:54:45,218 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369248214] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:45,218 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:45,219 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:45,219 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848588418] [2021-12-27 21:54:45,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:45,219 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:45,219 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:45,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:45,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:45,220 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) [2021-12-27 21:54:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:45,257 INFO L93 Difference]: Finished difference Result 1334 states and 2062 transitions. [2021-12-27 21:54:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:45,258 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 [2021-12-27 21:54:45,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:45,261 INFO L225 Difference]: With dead ends: 1334 [2021-12-27 21:54:45,262 INFO L226 Difference]: Without dead ends: 510 [2021-12-27 21:54:45,266 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:45,267 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:45,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 270 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-12-27 21:54:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-12-27 21:54:45,290 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) [2021-12-27 21:54:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 754 transitions. [2021-12-27 21:54:45,294 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 754 transitions. Word has length 34 [2021-12-27 21:54:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:45,294 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 754 transitions. [2021-12-27 21:54:45,294 INFO L471 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) [2021-12-27 21:54:45,295 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 754 transitions. [2021-12-27 21:54:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:54:45,295 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:45,296 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:45,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-27 21:54:45,296 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:45,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -2105808494, now seen corresponding path program 1 times [2021-12-27 21:54:45,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:45,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016905786] [2021-12-27 21:54:45,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:45,297 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:45,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:45,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:54:45,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:45,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:45,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:45,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016905786] [2021-12-27 21:54:45,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016905786] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:45,340 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:45,340 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:45,340 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796131196] [2021-12-27 21:54:45,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:45,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:45,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:45,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:45,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:45,342 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) [2021-12-27 21:54:45,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:45,575 INFO L93 Difference]: Finished difference Result 553 states and 805 transitions. [2021-12-27 21:54:45,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:45,576 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 [2021-12-27 21:54:45,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:45,592 INFO L225 Difference]: With dead ends: 553 [2021-12-27 21:54:45,593 INFO L226 Difference]: Without dead ends: 519 [2021-12-27 21:54:45,593 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:45,594 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:45,594 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 1167 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:45,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2021-12-27 21:54:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 508. [2021-12-27 21:54:45,634 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) [2021-12-27 21:54:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 749 transitions. [2021-12-27 21:54:45,637 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 749 transitions. Word has length 34 [2021-12-27 21:54:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:45,637 INFO L470 AbstractCegarLoop]: Abstraction has 508 states and 749 transitions. [2021-12-27 21:54:45,637 INFO L471 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) [2021-12-27 21:54:45,638 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 749 transitions. [2021-12-27 21:54:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:54:45,638 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:45,638 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:45,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-27 21:54:45,639 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:45,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754927, now seen corresponding path program 1 times [2021-12-27 21:54:45,646 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:45,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803819490] [2021-12-27 21:54:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:45,646 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:45,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:45,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 21:54:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:45,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:45,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803819490] [2021-12-27 21:54:45,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803819490] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:45,706 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:45,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:45,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836559682] [2021-12-27 21:54:45,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:45,708 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:45,708 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:45,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:45,709 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) [2021-12-27 21:54:46,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:46,015 INFO L93 Difference]: Finished difference Result 720 states and 1102 transitions. [2021-12-27 21:54:46,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-27 21:54:46,016 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 [2021-12-27 21:54:46,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:46,021 INFO L225 Difference]: With dead ends: 720 [2021-12-27 21:54:46,021 INFO L226 Difference]: Without dead ends: 712 [2021-12-27 21:54:46,022 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:46,022 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:46,023 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 668 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:46,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2021-12-27 21:54:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 566. [2021-12-27 21:54:46,058 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) [2021-12-27 21:54:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 841 transitions. [2021-12-27 21:54:46,062 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 841 transitions. Word has length 34 [2021-12-27 21:54:46,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:46,063 INFO L470 AbstractCegarLoop]: Abstraction has 566 states and 841 transitions. [2021-12-27 21:54:46,063 INFO L471 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) [2021-12-27 21:54:46,063 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 841 transitions. [2021-12-27 21:54:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-27 21:54:46,064 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:46,064 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:46,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-27 21:54:46,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:46,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:46,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1608594996, now seen corresponding path program 1 times [2021-12-27 21:54:46,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:46,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765165209] [2021-12-27 21:54:46,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:46,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:46,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:46,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 21:54:46,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:46,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:46,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:46,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765165209] [2021-12-27 21:54:46,135 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765165209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:46,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:46,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:46,136 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611032329] [2021-12-27 21:54:46,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:46,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:46,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:46,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:46,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:46,137 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) [2021-12-27 21:54:46,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:46,492 INFO L93 Difference]: Finished difference Result 583 states and 860 transitions. [2021-12-27 21:54:46,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:46,493 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 [2021-12-27 21:54:46,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:46,496 INFO L225 Difference]: With dead ends: 583 [2021-12-27 21:54:46,497 INFO L226 Difference]: Without dead ends: 579 [2021-12-27 21:54:46,497 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:46,498 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:46,498 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1471 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:46,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2021-12-27 21:54:46,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 574. [2021-12-27 21:54:46,528 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) [2021-12-27 21:54:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 851 transitions. [2021-12-27 21:54:46,532 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 851 transitions. Word has length 35 [2021-12-27 21:54:46,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:46,533 INFO L470 AbstractCegarLoop]: Abstraction has 574 states and 851 transitions. [2021-12-27 21:54:46,533 INFO L471 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) [2021-12-27 21:54:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 851 transitions. [2021-12-27 21:54:46,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-27 21:54:46,534 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:46,534 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:46,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-27 21:54:46,535 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:46,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:46,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1608318166, now seen corresponding path program 1 times [2021-12-27 21:54:46,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:46,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658637500] [2021-12-27 21:54:46,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:46,536 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 21:54:46,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:46,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:46,626 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:46,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658637500] [2021-12-27 21:54:46,626 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658637500] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:46,626 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:46,626 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:46,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671337851] [2021-12-27 21:54:46,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:46,627 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:46,627 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:46,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:46,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:46,628 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) [2021-12-27 21:54:47,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:47,004 INFO L93 Difference]: Finished difference Result 1065 states and 1652 transitions. [2021-12-27 21:54:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:47,004 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 [2021-12-27 21:54:47,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:47,009 INFO L225 Difference]: With dead ends: 1065 [2021-12-27 21:54:47,009 INFO L226 Difference]: Without dead ends: 605 [2021-12-27 21:54:47,012 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:54:47,012 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 75 mSDsluCounter, 1311 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1580 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:47,013 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 1580 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:47,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2021-12-27 21:54:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 586. [2021-12-27 21:54:47,045 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) [2021-12-27 21:54:47,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 887 transitions. [2021-12-27 21:54:47,049 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 887 transitions. Word has length 35 [2021-12-27 21:54:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:47,050 INFO L470 AbstractCegarLoop]: Abstraction has 586 states and 887 transitions. [2021-12-27 21:54:47,050 INFO L471 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) [2021-12-27 21:54:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 887 transitions. [2021-12-27 21:54:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-12-27 21:54:47,051 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:47,051 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:47,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-27 21:54:47,052 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:47,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1299938960, now seen corresponding path program 1 times [2021-12-27 21:54:47,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:47,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113786139] [2021-12-27 21:54:47,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:47,053 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:47,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:47,080 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:47,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113786139] [2021-12-27 21:54:47,080 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113786139] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:47,081 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:47,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:47,081 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845093078] [2021-12-27 21:54:47,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:47,081 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:47,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:47,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:47,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:47,082 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) [2021-12-27 21:54:47,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:47,216 INFO L93 Difference]: Finished difference Result 610 states and 910 transitions. [2021-12-27 21:54:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:54:47,216 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 [2021-12-27 21:54:47,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:47,220 INFO L225 Difference]: With dead ends: 610 [2021-12-27 21:54:47,220 INFO L226 Difference]: Without dead ends: 582 [2021-12-27 21:54:47,220 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:47,221 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:47,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 410 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:47,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2021-12-27 21:54:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 580. [2021-12-27 21:54:47,259 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) [2021-12-27 21:54:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 876 transitions. [2021-12-27 21:54:47,264 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 876 transitions. Word has length 34 [2021-12-27 21:54:47,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:47,264 INFO L470 AbstractCegarLoop]: Abstraction has 580 states and 876 transitions. [2021-12-27 21:54:47,264 INFO L471 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) [2021-12-27 21:54:47,264 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 876 transitions. [2021-12-27 21:54:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 21:54:47,265 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:47,265 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:47,266 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-27 21:54:47,266 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1171529217, now seen corresponding path program 1 times [2021-12-27 21:54:47,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043416531] [2021-12-27 21:54:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:47,267 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:47,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:47,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-27 21:54:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:47,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:47,335 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:47,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043416531] [2021-12-27 21:54:47,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043416531] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:47,336 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:47,336 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:47,336 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280798292] [2021-12-27 21:54:47,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:47,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:47,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:47,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:47,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:47,337 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) [2021-12-27 21:54:47,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:47,836 INFO L93 Difference]: Finished difference Result 738 states and 1149 transitions. [2021-12-27 21:54:47,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:47,837 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 [2021-12-27 21:54:47,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:47,850 INFO L225 Difference]: With dead ends: 738 [2021-12-27 21:54:47,850 INFO L226 Difference]: Without dead ends: 721 [2021-12-27 21:54:47,852 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:47,853 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 662 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:47,854 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [676 Valid, 768 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 21:54:47,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2021-12-27 21:54:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 567. [2021-12-27 21:54:47,891 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) [2021-12-27 21:54:47,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 842 transitions. [2021-12-27 21:54:47,894 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 842 transitions. Word has length 36 [2021-12-27 21:54:47,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:47,895 INFO L470 AbstractCegarLoop]: Abstraction has 567 states and 842 transitions. [2021-12-27 21:54:47,895 INFO L471 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) [2021-12-27 21:54:47,895 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 842 transitions. [2021-12-27 21:54:47,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-12-27 21:54:47,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:47,896 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:47,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-27 21:54:47,896 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:47,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:47,897 INFO L85 PathProgramCache]: Analyzing trace with hash -2056934280, now seen corresponding path program 1 times [2021-12-27 21:54:47,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:47,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177546774] [2021-12-27 21:54:47,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:47,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:47,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:47,941 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:47,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177546774] [2021-12-27 21:54:47,945 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177546774] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:47,945 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:47,945 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:47,945 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513091095] [2021-12-27 21:54:47,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:47,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:47,946 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:47,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:47,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:47,947 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) [2021-12-27 21:54:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:48,162 INFO L93 Difference]: Finished difference Result 630 states and 904 transitions. [2021-12-27 21:54:48,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:48,163 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 [2021-12-27 21:54:48,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:48,165 INFO L225 Difference]: With dead ends: 630 [2021-12-27 21:54:48,165 INFO L226 Difference]: Without dead ends: 377 [2021-12-27 21:54:48,166 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:48,167 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:48,167 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 650 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:48,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-12-27 21:54:48,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 359. [2021-12-27 21:54:48,188 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) [2021-12-27 21:54:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 492 transitions. [2021-12-27 21:54:48,190 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 492 transitions. Word has length 39 [2021-12-27 21:54:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:48,191 INFO L470 AbstractCegarLoop]: Abstraction has 359 states and 492 transitions. [2021-12-27 21:54:48,191 INFO L471 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) [2021-12-27 21:54:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 492 transitions. [2021-12-27 21:54:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-27 21:54:48,192 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:48,192 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:48,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-27 21:54:48,192 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:48,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:48,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1922765712, now seen corresponding path program 1 times [2021-12-27 21:54:48,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:48,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072888231] [2021-12-27 21:54:48,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:48,193 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:48,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:48,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:48,237 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:48,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072888231] [2021-12-27 21:54:48,237 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072888231] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:48,238 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:48,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-27 21:54:48,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437060302] [2021-12-27 21:54:48,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:48,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-27 21:54:48,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:48,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-27 21:54:48,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-27 21:54:48,239 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) [2021-12-27 21:54:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:48,354 INFO L93 Difference]: Finished difference Result 504 states and 710 transitions. [2021-12-27 21:54:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-27 21:54:48,355 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 [2021-12-27 21:54:48,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:48,358 INFO L225 Difference]: With dead ends: 504 [2021-12-27 21:54:48,358 INFO L226 Difference]: Without dead ends: 491 [2021-12-27 21:54:48,359 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:48,360 INFO L933 BasicCegarLoop]: 417 mSDtfsCounter, 161 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:48,360 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 638 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2021-12-27 21:54:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 375. [2021-12-27 21:54:48,387 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) [2021-12-27 21:54:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 509 transitions. [2021-12-27 21:54:48,389 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 509 transitions. Word has length 35 [2021-12-27 21:54:48,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:48,390 INFO L470 AbstractCegarLoop]: Abstraction has 375 states and 509 transitions. [2021-12-27 21:54:48,390 INFO L471 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) [2021-12-27 21:54:48,390 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 509 transitions. [2021-12-27 21:54:48,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-12-27 21:54:48,391 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:48,391 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:48,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-27 21:54:48,391 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:48,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:48,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1798212464, now seen corresponding path program 1 times [2021-12-27 21:54:48,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:48,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927068117] [2021-12-27 21:54:48,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:48,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:48,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:48,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927068117] [2021-12-27 21:54:48,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927068117] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:48,443 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:48,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:48,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353430832] [2021-12-27 21:54:48,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:48,444 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:48,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:48,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:48,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:48,444 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) [2021-12-27 21:54:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:48,569 INFO L93 Difference]: Finished difference Result 387 states and 521 transitions. [2021-12-27 21:54:48,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:54:48,569 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 [2021-12-27 21:54:48,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:48,573 INFO L225 Difference]: With dead ends: 387 [2021-12-27 21:54:48,574 INFO L226 Difference]: Without dead ends: 353 [2021-12-27 21:54:48,574 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:48,575 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:48,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:48,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-27 21:54:48,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2021-12-27 21:54:48,610 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) [2021-12-27 21:54:48,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 476 transitions. [2021-12-27 21:54:48,611 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 476 transitions. Word has length 35 [2021-12-27 21:54:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:48,612 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 476 transitions. [2021-12-27 21:54:48,612 INFO L471 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) [2021-12-27 21:54:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 476 transitions. [2021-12-27 21:54:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-27 21:54:48,613 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:48,613 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:48,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-27 21:54:48,613 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:48,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1722219638, now seen corresponding path program 1 times [2021-12-27 21:54:48,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:48,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247876747] [2021-12-27 21:54:48,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:48,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:48,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:48,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:54:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:48,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:48,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247876747] [2021-12-27 21:54:48,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247876747] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:48,675 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:48,675 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:48,675 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043989717] [2021-12-27 21:54:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:48,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:48,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:48,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:48,678 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) [2021-12-27 21:54:48,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:48,946 INFO L93 Difference]: Finished difference Result 355 states and 479 transitions. [2021-12-27 21:54:48,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:48,947 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 [2021-12-27 21:54:48,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:48,949 INFO L225 Difference]: With dead ends: 355 [2021-12-27 21:54:48,949 INFO L226 Difference]: Without dead ends: 324 [2021-12-27 21:54:48,950 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:48,951 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 60 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-27 21:54:48,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 1424 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2021-12-27 21:54:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2021-12-27 21:54:48,973 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) [2021-12-27 21:54:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 444 transitions. [2021-12-27 21:54:48,975 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 444 transitions. Word has length 37 [2021-12-27 21:54:48,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:48,975 INFO L470 AbstractCegarLoop]: Abstraction has 324 states and 444 transitions. [2021-12-27 21:54:48,975 INFO L471 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) [2021-12-27 21:54:48,975 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 444 transitions. [2021-12-27 21:54:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-12-27 21:54:48,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:48,976 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:48,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-27 21:54:48,976 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:48,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:48,977 INFO L85 PathProgramCache]: Analyzing trace with hash -70447595, now seen corresponding path program 1 times [2021-12-27 21:54:48,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:48,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794725197] [2021-12-27 21:54:48,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:48,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:49,069 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:49,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794725197] [2021-12-27 21:54:49,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794725197] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:49,069 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:49,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:49,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292595541] [2021-12-27 21:54:49,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:49,070 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:49,070 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:49,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:49,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:49,071 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) [2021-12-27 21:54:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:49,162 INFO L93 Difference]: Finished difference Result 345 states and 466 transitions. [2021-12-27 21:54:49,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:49,162 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 [2021-12-27 21:54:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:49,164 INFO L225 Difference]: With dead ends: 345 [2021-12-27 21:54:49,164 INFO L226 Difference]: Without dead ends: 323 [2021-12-27 21:54:49,165 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:49,165 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:49,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 1424 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:49,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-12-27 21:54:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2021-12-27 21:54:49,198 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) [2021-12-27 21:54:49,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 442 transitions. [2021-12-27 21:54:49,199 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 442 transitions. Word has length 36 [2021-12-27 21:54:49,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:49,200 INFO L470 AbstractCegarLoop]: Abstraction has 323 states and 442 transitions. [2021-12-27 21:54:49,200 INFO L471 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) [2021-12-27 21:54:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 442 transitions. [2021-12-27 21:54:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2021-12-27 21:54:49,201 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:49,201 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:49,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-27 21:54:49,201 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:49,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:49,202 INFO L85 PathProgramCache]: Analyzing trace with hash 2018897985, now seen corresponding path program 1 times [2021-12-27 21:54:49,202 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:49,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551810937] [2021-12-27 21:54:49,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:49,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-12-27 21:54:49,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:49,239 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:49,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551810937] [2021-12-27 21:54:49,240 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551810937] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:49,240 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:49,240 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:49,240 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460678611] [2021-12-27 21:54:49,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:49,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:49,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:49,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:49,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:49,242 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) [2021-12-27 21:54:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:49,392 INFO L93 Difference]: Finished difference Result 352 states and 479 transitions. [2021-12-27 21:54:49,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:49,392 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 [2021-12-27 21:54:49,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:49,394 INFO L225 Difference]: With dead ends: 352 [2021-12-27 21:54:49,395 INFO L226 Difference]: Without dead ends: 322 [2021-12-27 21:54:49,395 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:49,396 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:49,396 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 1067 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:49,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-27 21:54:49,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 308. [2021-12-27 21:54:49,417 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) [2021-12-27 21:54:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 425 transitions. [2021-12-27 21:54:49,418 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 425 transitions. Word has length 38 [2021-12-27 21:54:49,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:49,419 INFO L470 AbstractCegarLoop]: Abstraction has 308 states and 425 transitions. [2021-12-27 21:54:49,419 INFO L471 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) [2021-12-27 21:54:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 425 transitions. [2021-12-27 21:54:49,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-27 21:54:49,420 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:49,420 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:49,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-12-27 21:54:49,420 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:49,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:49,421 INFO L85 PathProgramCache]: Analyzing trace with hash 233678808, now seen corresponding path program 1 times [2021-12-27 21:54:49,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:49,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678603112] [2021-12-27 21:54:49,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:49,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:49,472 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:49,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678603112] [2021-12-27 21:54:49,472 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678603112] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:49,472 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:49,472 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-27 21:54:49,473 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774674865] [2021-12-27 21:54:49,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:49,473 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:54:49,473 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:49,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:54:49,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-27 21:54:49,474 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) [2021-12-27 21:54:49,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:49,565 INFO L93 Difference]: Finished difference Result 323 states and 441 transitions. [2021-12-27 21:54:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:49,567 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 [2021-12-27 21:54:49,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:49,569 INFO L225 Difference]: With dead ends: 323 [2021-12-27 21:54:49,569 INFO L226 Difference]: Without dead ends: 319 [2021-12-27 21:54:49,569 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:49,570 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:49,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 1090 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:54:49,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2021-12-27 21:54:49,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 315. [2021-12-27 21:54:49,593 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) [2021-12-27 21:54:49,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 433 transitions. [2021-12-27 21:54:49,594 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 433 transitions. Word has length 37 [2021-12-27 21:54:49,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:49,595 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 433 transitions. [2021-12-27 21:54:49,595 INFO L471 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) [2021-12-27 21:54:49,595 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 433 transitions. [2021-12-27 21:54:49,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-27 21:54:49,595 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:49,596 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:49,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-12-27 21:54:49,596 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:49,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:49,596 INFO L85 PathProgramCache]: Analyzing trace with hash 233401978, now seen corresponding path program 1 times [2021-12-27 21:54:49,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:49,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272109620] [2021-12-27 21:54:49,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:49,602 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:49,640 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:49,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272109620] [2021-12-27 21:54:49,640 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272109620] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:49,641 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:49,641 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-27 21:54:49,641 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117227870] [2021-12-27 21:54:49,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:49,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-27 21:54:49,641 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:49,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-27 21:54:49,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-27 21:54:49,642 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) [2021-12-27 21:54:49,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:49,846 INFO L93 Difference]: Finished difference Result 431 states and 618 transitions. [2021-12-27 21:54:49,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-27 21:54:49,846 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 [2021-12-27 21:54:49,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:49,849 INFO L225 Difference]: With dead ends: 431 [2021-12-27 21:54:49,849 INFO L226 Difference]: Without dead ends: 402 [2021-12-27 21:54:49,849 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:49,850 INFO L933 BasicCegarLoop]: 362 mSDtfsCounter, 344 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:49,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 504 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:49,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2021-12-27 21:54:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2021-12-27 21:54:49,873 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) [2021-12-27 21:54:49,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 406 transitions. [2021-12-27 21:54:49,874 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 406 transitions. Word has length 37 [2021-12-27 21:54:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:49,875 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 406 transitions. [2021-12-27 21:54:49,875 INFO L471 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) [2021-12-27 21:54:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 406 transitions. [2021-12-27 21:54:49,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:54:49,875 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:49,876 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:49,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-12-27 21:54:49,876 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:49,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1150124824, now seen corresponding path program 1 times [2021-12-27 21:54:49,877 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:49,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287500613] [2021-12-27 21:54:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:49,877 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-27 21:54:49,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2021-12-27 21:54:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:49,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:49,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287500613] [2021-12-27 21:54:49,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287500613] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:49,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:49,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:49,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671472095] [2021-12-27 21:54:49,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:49,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:49,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:49,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:49,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:49,916 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) [2021-12-27 21:54:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:50,096 INFO L93 Difference]: Finished difference Result 544 states and 787 transitions. [2021-12-27 21:54:50,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:50,096 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 [2021-12-27 21:54:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:50,099 INFO L225 Difference]: With dead ends: 544 [2021-12-27 21:54:50,099 INFO L226 Difference]: Without dead ends: 310 [2021-12-27 21:54:50,100 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:50,100 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:50,101 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 635 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-27 21:54:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-27 21:54:50,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 302. [2021-12-27 21:54:50,139 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) [2021-12-27 21:54:50,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2021-12-27 21:54:50,142 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 43 [2021-12-27 21:54:50,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:50,143 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2021-12-27 21:54:50,143 INFO L471 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) [2021-12-27 21:54:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2021-12-27 21:54:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-12-27 21:54:50,144 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:50,144 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:50,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-12-27 21:54:50,145 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:50,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1967801604, now seen corresponding path program 1 times [2021-12-27 21:54:50,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:50,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540677847] [2021-12-27 21:54:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:50,146 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-27 21:54:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:50,307 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:50,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540677847] [2021-12-27 21:54:50,308 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540677847] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:50,308 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:50,308 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:50,309 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885701742] [2021-12-27 21:54:50,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:50,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:50,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:50,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:50,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:50,310 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) [2021-12-27 21:54:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:50,682 INFO L93 Difference]: Finished difference Result 333 states and 468 transitions. [2021-12-27 21:54:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-27 21:54:50,683 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 [2021-12-27 21:54:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:50,685 INFO L225 Difference]: With dead ends: 333 [2021-12-27 21:54:50,685 INFO L226 Difference]: Without dead ends: 310 [2021-12-27 21:54:50,686 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:50,686 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:50,687 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 1275 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2021-12-27 21:54:50,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 301. [2021-12-27 21:54:50,715 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) [2021-12-27 21:54:50,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 418 transitions. [2021-12-27 21:54:50,717 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 418 transitions. Word has length 43 [2021-12-27 21:54:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:50,718 INFO L470 AbstractCegarLoop]: Abstraction has 301 states and 418 transitions. [2021-12-27 21:54:50,719 INFO L471 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) [2021-12-27 21:54:50,719 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 418 transitions. [2021-12-27 21:54:50,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-12-27 21:54:50,720 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:50,720 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:50,720 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-12-27 21:54:50,720 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:50,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:50,721 INFO L85 PathProgramCache]: Analyzing trace with hash -896869873, now seen corresponding path program 1 times [2021-12-27 21:54:50,721 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:50,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061477633] [2021-12-27 21:54:50,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:50,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:50,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:50,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:50,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:50,793 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:50,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061477633] [2021-12-27 21:54:50,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061477633] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:50,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:50,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-27 21:54:50,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732776526] [2021-12-27 21:54:50,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:50,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-27 21:54:50,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:50,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-27 21:54:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-27 21:54:50,795 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) [2021-12-27 21:54:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:51,046 INFO L93 Difference]: Finished difference Result 569 states and 825 transitions. [2021-12-27 21:54:51,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-27 21:54:51,047 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 [2021-12-27 21:54:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:51,049 INFO L225 Difference]: With dead ends: 569 [2021-12-27 21:54:51,049 INFO L226 Difference]: Without dead ends: 326 [2021-12-27 21:54:51,050 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:51,051 INFO L933 BasicCegarLoop]: 211 mSDtfsCounter, 61 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:51,051 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 1141 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:51,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-12-27 21:54:51,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 313. [2021-12-27 21:54:51,075 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) [2021-12-27 21:54:51,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 447 transitions. [2021-12-27 21:54:51,077 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 447 transitions. Word has length 48 [2021-12-27 21:54:51,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:51,077 INFO L470 AbstractCegarLoop]: Abstraction has 313 states and 447 transitions. [2021-12-27 21:54:51,077 INFO L471 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) [2021-12-27 21:54:51,077 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 447 transitions. [2021-12-27 21:54:51,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-12-27 21:54:51,078 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,078 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:51,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-12-27 21:54:51,079 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1018197871, now seen corresponding path program 1 times [2021-12-27 21:54:51,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575813761] [2021-12-27 21:54:51,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,080 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-27 21:54:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:51,166 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:51,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575813761] [2021-12-27 21:54:51,166 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575813761] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:51,166 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:51,166 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:51,166 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821383397] [2021-12-27 21:54:51,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:51,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:51,167 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:51,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:51,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:51,168 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) [2021-12-27 21:54:51,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:51,480 INFO L93 Difference]: Finished difference Result 315 states and 448 transitions. [2021-12-27 21:54:51,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:51,480 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 [2021-12-27 21:54:51,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:51,482 INFO L225 Difference]: With dead ends: 315 [2021-12-27 21:54:51,482 INFO L226 Difference]: Without dead ends: 282 [2021-12-27 21:54:51,483 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:51,483 INFO L933 BasicCegarLoop]: 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 [2021-12-27 21:54:51,483 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 1244 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:51,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2021-12-27 21:54:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2021-12-27 21:54:51,506 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) [2021-12-27 21:54:51,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2021-12-27 21:54:51,507 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 44 [2021-12-27 21:54:51,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:51,508 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2021-12-27 21:54:51,508 INFO L471 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) [2021-12-27 21:54:51,508 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2021-12-27 21:54:51,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 21:54:51,513 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,513 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:51,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-12-27 21:54:51,514 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1224484534, now seen corresponding path program 1 times [2021-12-27 21:54:51,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864885016] [2021-12-27 21:54:51,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2021-12-27 21:54:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:51,576 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:51,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864885016] [2021-12-27 21:54:51,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864885016] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:51,576 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:51,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:51,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008990654] [2021-12-27 21:54:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:51,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:51,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:51,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:51,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:51,579 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) [2021-12-27 21:54:51,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:51,794 INFO L93 Difference]: Finished difference Result 441 states and 673 transitions. [2021-12-27 21:54:51,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:54:51,795 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 [2021-12-27 21:54:51,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:51,799 INFO L225 Difference]: With dead ends: 441 [2021-12-27 21:54:51,799 INFO L226 Difference]: Without dead ends: 438 [2021-12-27 21:54:51,799 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:51,800 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:51,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 793 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:51,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-12-27 21:54:51,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 286. [2021-12-27 21:54:51,828 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) [2021-12-27 21:54:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 419 transitions. [2021-12-27 21:54:51,830 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 419 transitions. Word has length 49 [2021-12-27 21:54:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:51,831 INFO L470 AbstractCegarLoop]: Abstraction has 286 states and 419 transitions. [2021-12-27 21:54:51,831 INFO L471 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) [2021-12-27 21:54:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 419 transitions. [2021-12-27 21:54:51,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2021-12-27 21:54:51,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:51,832 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:51,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-12-27 21:54:51,832 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:51,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:51,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2015471348, now seen corresponding path program 1 times [2021-12-27 21:54:51,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:51,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043706044] [2021-12-27 21:54:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:51,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2021-12-27 21:54:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:51,889 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043706044] [2021-12-27 21:54:51,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043706044] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:51,889 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:51,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-27 21:54:51,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937083572] [2021-12-27 21:54:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:51,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-27 21:54:51,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-27 21:54:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-12-27 21:54:51,891 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) [2021-12-27 21:54:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,133 INFO L93 Difference]: Finished difference Result 658 states and 979 transitions. [2021-12-27 21:54:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:52,134 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 [2021-12-27 21:54:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,137 INFO L225 Difference]: With dead ends: 658 [2021-12-27 21:54:52,137 INFO L226 Difference]: Without dead ends: 405 [2021-12-27 21:54:52,138 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:52,139 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 214 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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 [2021-12-27 21:54:52,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 543 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:52,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2021-12-27 21:54:52,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 373. [2021-12-27 21:54:52,187 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) [2021-12-27 21:54:52,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 535 transitions. [2021-12-27 21:54:52,189 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 535 transitions. Word has length 49 [2021-12-27 21:54:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,189 INFO L470 AbstractCegarLoop]: Abstraction has 373 states and 535 transitions. [2021-12-27 21:54:52,189 INFO L471 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) [2021-12-27 21:54:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 535 transitions. [2021-12-27 21:54:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-12-27 21:54:52,190 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,190 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:52,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-12-27 21:54:52,190 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,191 INFO L85 PathProgramCache]: Analyzing trace with hash -726473774, now seen corresponding path program 1 times [2021-12-27 21:54:52,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184892127] [2021-12-27 21:54:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,191 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184892127] [2021-12-27 21:54:52,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184892127] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,346 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:52,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082979615] [2021-12-27 21:54:52,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:52,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:52,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:52,347 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) [2021-12-27 21:54:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:52,632 INFO L93 Difference]: Finished difference Result 691 states and 1016 transitions. [2021-12-27 21:54:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-27 21:54:52,633 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 [2021-12-27 21:54:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:52,635 INFO L225 Difference]: With dead ends: 691 [2021-12-27 21:54:52,635 INFO L226 Difference]: Without dead ends: 346 [2021-12-27 21:54:52,637 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:52,638 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 88 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:52,638 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 983 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:52,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2021-12-27 21:54:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2021-12-27 21:54:52,669 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) [2021-12-27 21:54:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 494 transitions. [2021-12-27 21:54:52,671 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 494 transitions. Word has length 50 [2021-12-27 21:54:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:52,671 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 494 transitions. [2021-12-27 21:54:52,671 INFO L471 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) [2021-12-27 21:54:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 494 transitions. [2021-12-27 21:54:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2021-12-27 21:54:52,672 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:52,672 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:52,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-12-27 21:54:52,673 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:52,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:52,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1339562411, now seen corresponding path program 1 times [2021-12-27 21:54:52,673 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:52,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440872321] [2021-12-27 21:54:52,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:52,674 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:52,772 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:52,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440872321] [2021-12-27 21:54:52,772 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440872321] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:52,772 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:52,773 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:52,773 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239233507] [2021-12-27 21:54:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:52,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:52,773 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:52,774 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) [2021-12-27 21:54:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,166 INFO L93 Difference]: Finished difference Result 659 states and 959 transitions. [2021-12-27 21:54:53,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:53,167 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 [2021-12-27 21:54:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,169 INFO L225 Difference]: With dead ends: 659 [2021-12-27 21:54:53,169 INFO L226 Difference]: Without dead ends: 341 [2021-12-27 21:54:53,171 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:53,171 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 839 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2021-12-27 21:54:53,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2021-12-27 21:54:53,200 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) [2021-12-27 21:54:53,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 481 transitions. [2021-12-27 21:54:53,201 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 481 transitions. Word has length 54 [2021-12-27 21:54:53,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,202 INFO L470 AbstractCegarLoop]: Abstraction has 341 states and 481 transitions. [2021-12-27 21:54:53,202 INFO L471 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) [2021-12-27 21:54:53,202 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 481 transitions. [2021-12-27 21:54:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-27 21:54:53,203 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,203 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:53,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-12-27 21:54:53,203 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,204 INFO L85 PathProgramCache]: Analyzing trace with hash 330640549, now seen corresponding path program 1 times [2021-12-27 21:54:53,204 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769877116] [2021-12-27 21:54:53,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,204 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:53,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769877116] [2021-12-27 21:54:53,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769877116] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,278 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-27 21:54:53,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513207516] [2021-12-27 21:54:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-27 21:54:53,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-27 21:54:53,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-12-27 21:54:53,280 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) [2021-12-27 21:54:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,493 INFO L93 Difference]: Finished difference Result 666 states and 963 transitions. [2021-12-27 21:54:53,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-27 21:54:53,494 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 [2021-12-27 21:54:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,496 INFO L225 Difference]: With dead ends: 666 [2021-12-27 21:54:53,497 INFO L226 Difference]: Without dead ends: 353 [2021-12-27 21:54:53,498 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:53,499 INFO L933 BasicCegarLoop]: 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.2s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 686 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-27 21:54:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-12-27 21:54:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 344. [2021-12-27 21:54:53,534 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) [2021-12-27 21:54:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 484 transitions. [2021-12-27 21:54:53,535 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 484 transitions. Word has length 57 [2021-12-27 21:54:53,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:53,536 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 484 transitions. [2021-12-27 21:54:53,536 INFO L471 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) [2021-12-27 21:54:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 484 transitions. [2021-12-27 21:54:53,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-12-27 21:54:53,537 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:53,537 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:53,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-12-27 21:54:53,537 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:53,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:53,538 INFO L85 PathProgramCache]: Analyzing trace with hash 942519397, now seen corresponding path program 1 times [2021-12-27 21:54:53,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:53,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214053128] [2021-12-27 21:54:53,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:53,538 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:53,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:53,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:53,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:53,646 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:53,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214053128] [2021-12-27 21:54:53,646 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214053128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:53,646 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:53,646 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-27 21:54:53,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248037356] [2021-12-27 21:54:53,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:53,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-27 21:54:53,647 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:53,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-27 21:54:53,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-12-27 21:54:53,648 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) [2021-12-27 21:54:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:53,989 INFO L93 Difference]: Finished difference Result 662 states and 947 transitions. [2021-12-27 21:54:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-27 21:54:53,990 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 [2021-12-27 21:54:53,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:53,993 INFO L225 Difference]: With dead ends: 662 [2021-12-27 21:54:53,993 INFO L226 Difference]: Without dead ends: 347 [2021-12-27 21:54:53,994 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:54:53,995 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 46 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:53,995 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 1292 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2021-12-27 21:54:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2021-12-27 21:54:54,025 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) [2021-12-27 21:54:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 481 transitions. [2021-12-27 21:54:54,027 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 481 transitions. Word has length 57 [2021-12-27 21:54:54,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,027 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 481 transitions. [2021-12-27 21:54:54,027 INFO L471 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) [2021-12-27 21:54:54,027 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 481 transitions. [2021-12-27 21:54:54,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-12-27 21:54:54,028 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,028 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:54,029 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-12-27 21:54:54,029 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,029 INFO L85 PathProgramCache]: Analyzing trace with hash -146309345, now seen corresponding path program 1 times [2021-12-27 21:54:54,029 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519508749] [2021-12-27 21:54:54,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,030 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:54,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:54:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519508749] [2021-12-27 21:54:54,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519508749] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-27 21:54:54,134 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718388431] [2021-12-27 21:54:54,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-27 21:54:54,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-27 21:54:54,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-12-27 21:54:54,135 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) [2021-12-27 21:54:54,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:54,577 INFO L93 Difference]: Finished difference Result 623 states and 870 transitions. [2021-12-27 21:54:54,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:54:54,578 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 [2021-12-27 21:54:54,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:54,580 INFO L225 Difference]: With dead ends: 623 [2021-12-27 21:54:54,580 INFO L226 Difference]: Without dead ends: 322 [2021-12-27 21:54:54,581 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:54,582 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 165 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:54,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 1228 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-12-27 21:54:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 314. [2021-12-27 21:54:54,607 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) [2021-12-27 21:54:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 428 transitions. [2021-12-27 21:54:54,609 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 428 transitions. Word has length 68 [2021-12-27 21:54:54,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:54,609 INFO L470 AbstractCegarLoop]: Abstraction has 314 states and 428 transitions. [2021-12-27 21:54:54,609 INFO L471 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) [2021-12-27 21:54:54,609 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 428 transitions. [2021-12-27 21:54:54,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-12-27 21:54:54,610 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:54,610 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:54,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2021-12-27 21:54:54,611 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:54,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:54,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1989043251, now seen corresponding path program 1 times [2021-12-27 21:54:54,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:54,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227707592] [2021-12-27 21:54:54,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:54,612 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:54,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:54,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:54:54,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:54,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:54,800 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:54,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227707592] [2021-12-27 21:54:54,800 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227707592] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:54,800 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:54,800 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-27 21:54:54,800 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795825933] [2021-12-27 21:54:54,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:54,801 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:54:54,801 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:54:54,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:54:54,802 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) [2021-12-27 21:54:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:55,318 INFO L93 Difference]: Finished difference Result 350 states and 477 transitions. [2021-12-27 21:54:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-27 21:54:55,319 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 [2021-12-27 21:54:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:55,323 INFO L225 Difference]: With dead ends: 350 [2021-12-27 21:54:55,323 INFO L226 Difference]: Without dead ends: 329 [2021-12-27 21:54:55,324 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-12-27 21:54:55,325 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 126 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:55,325 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 2072 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 21:54:55,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2021-12-27 21:54:55,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 317. [2021-12-27 21:54:55,352 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) [2021-12-27 21:54:55,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2021-12-27 21:54:55,355 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 73 [2021-12-27 21:54:55,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:55,355 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2021-12-27 21:54:55,355 INFO L471 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) [2021-12-27 21:54:55,355 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2021-12-27 21:54:55,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-12-27 21:54:55,356 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:55,357 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:55,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-12-27 21:54:55,357 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:55,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:55,357 INFO L85 PathProgramCache]: Analyzing trace with hash -182846632, now seen corresponding path program 1 times [2021-12-27 21:54:55,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:55,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945373779] [2021-12-27 21:54:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:55,358 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:55,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:55,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-27 21:54:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:55,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:55,544 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:55,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945373779] [2021-12-27 21:54:55,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945373779] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:55,544 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:55,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-27 21:54:55,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997735238] [2021-12-27 21:54:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:55,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:54:55,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:55,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:54:55,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:54:55,547 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) [2021-12-27 21:54:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:56,097 INFO L93 Difference]: Finished difference Result 354 states and 481 transitions. [2021-12-27 21:54:56,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-27 21:54:56,097 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 [2021-12-27 21:54:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:56,099 INFO L225 Difference]: With dead ends: 354 [2021-12-27 21:54:56,099 INFO L226 Difference]: Without dead ends: 333 [2021-12-27 21:54:56,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2021-12-27 21:54:56,099 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 126 mSDsluCounter, 2177 mSDsCounter, 0 mSdLazyCounter, 880 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 2386 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 880 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:56,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 2386 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 880 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 21:54:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2021-12-27 21:54:56,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 317. [2021-12-27 21:54:56,128 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) [2021-12-27 21:54:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 431 transitions. [2021-12-27 21:54:56,129 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 431 transitions. Word has length 74 [2021-12-27 21:54:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:56,129 INFO L470 AbstractCegarLoop]: Abstraction has 317 states and 431 transitions. [2021-12-27 21:54:56,129 INFO L471 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) [2021-12-27 21:54:56,130 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 431 transitions. [2021-12-27 21:54:56,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-12-27 21:54:56,131 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:56,131 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:56,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2021-12-27 21:54:56,132 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:56,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -673237615, now seen corresponding path program 1 times [2021-12-27 21:54:56,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959030945] [2021-12-27 21:54:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:56,133 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:54:56,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:56,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:54:56,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2021-12-27 21:54:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:56,355 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:56,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959030945] [2021-12-27 21:54:56,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959030945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:56,355 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:56,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-27 21:54:56,356 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172649352] [2021-12-27 21:54:56,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:56,357 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-27 21:54:56,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:56,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-27 21:54:56,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-27 21:54:56,359 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) [2021-12-27 21:54:57,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:57,269 INFO L93 Difference]: Finished difference Result 468 states and 698 transitions. [2021-12-27 21:54:57,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 21:54:57,270 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 [2021-12-27 21:54:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:57,273 INFO L225 Difference]: With dead ends: 468 [2021-12-27 21:54:57,273 INFO L226 Difference]: Without dead ends: 429 [2021-12-27 21:54:57,274 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:57,274 INFO L933 BasicCegarLoop]: 244 mSDtfsCounter, 194 mSDsluCounter, 2462 mSDsCounter, 0 mSdLazyCounter, 1524 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:57,275 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 2706 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1524 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-27 21:54:57,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2021-12-27 21:54:57,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 413. [2021-12-27 21:54:57,315 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) [2021-12-27 21:54:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 585 transitions. [2021-12-27 21:54:57,317 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 585 transitions. Word has length 82 [2021-12-27 21:54:57,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:57,318 INFO L470 AbstractCegarLoop]: Abstraction has 413 states and 585 transitions. [2021-12-27 21:54:57,318 INFO L471 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) [2021-12-27 21:54:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 585 transitions. [2021-12-27 21:54:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:54:57,319 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:57,319 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:57,320 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2021-12-27 21:54:57,320 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:57,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -166689667, now seen corresponding path program 1 times [2021-12-27 21:54:57,320 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:57,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804602550] [2021-12-27 21:54:57,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:57,321 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:57,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:54:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:54:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:57,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:57,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804602550] [2021-12-27 21:54:57,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804602550] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:57,438 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:57,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:54:57,439 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681287344] [2021-12-27 21:54:57,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:57,441 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:54:57,441 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:57,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:54:57,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:54:57,442 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) [2021-12-27 21:54:57,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:57,909 INFO L93 Difference]: Finished difference Result 809 states and 1103 transitions. [2021-12-27 21:54:57,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-27 21:54:57,910 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 [2021-12-27 21:54:57,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:57,915 INFO L225 Difference]: With dead ends: 809 [2021-12-27 21:54:57,915 INFO L226 Difference]: Without dead ends: 538 [2021-12-27 21:54:57,917 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:57,918 INFO L933 BasicCegarLoop]: 240 mSDtfsCounter, 377 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2021-12-27 21:54:57,918 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [379 Valid, 1031 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:57,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2021-12-27 21:54:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 496. [2021-12-27 21:54:57,966 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) [2021-12-27 21:54:57,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 678 transitions. [2021-12-27 21:54:57,968 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 678 transitions. Word has length 84 [2021-12-27 21:54:57,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:57,969 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 678 transitions. [2021-12-27 21:54:57,969 INFO L471 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) [2021-12-27 21:54:57,969 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 678 transitions. [2021-12-27 21:54:57,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:54:57,970 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:57,970 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:57,970 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2021-12-27 21:54:57,971 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:57,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1602435204, now seen corresponding path program 1 times [2021-12-27 21:54:57,971 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:57,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489040209] [2021-12-27 21:54:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:57,972 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:54:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:54:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:58,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:58,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489040209] [2021-12-27 21:54:58,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489040209] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:58,102 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:58,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:54:58,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017614243] [2021-12-27 21:54:58,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:58,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:54:58,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:58,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:54:58,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:54:58,104 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) [2021-12-27 21:54:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:58,628 INFO L93 Difference]: Finished difference Result 867 states and 1198 transitions. [2021-12-27 21:54:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-27 21:54:58,628 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 [2021-12-27 21:54:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:58,632 INFO L225 Difference]: With dead ends: 867 [2021-12-27 21:54:58,633 INFO L226 Difference]: Without dead ends: 496 [2021-12-27 21:54:58,634 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2021-12-27 21:54:58,635 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 447 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:58,635 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [459 Valid, 712 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:54:58,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2021-12-27 21:54:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2021-12-27 21:54:58,683 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) [2021-12-27 21:54:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 668 transitions. [2021-12-27 21:54:58,686 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 668 transitions. Word has length 84 [2021-12-27 21:54:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:58,687 INFO L470 AbstractCegarLoop]: Abstraction has 496 states and 668 transitions. [2021-12-27 21:54:58,687 INFO L471 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) [2021-12-27 21:54:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 668 transitions. [2021-12-27 21:54:58,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-27 21:54:58,692 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:58,693 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:58,693 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2021-12-27 21:54:58,693 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:58,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 716383564, now seen corresponding path program 1 times [2021-12-27 21:54:58,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:58,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425488313] [2021-12-27 21:54:58,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:58,694 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:54:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:54:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:54:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:54:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-27 21:54:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-27 21:54:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:54:58,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:54:58,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425488313] [2021-12-27 21:54:58,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425488313] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:54:58,964 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:54:58,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2021-12-27 21:54:58,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590789553] [2021-12-27 21:54:58,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:54:58,965 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-27 21:54:58,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:54:58,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-27 21:54:58,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2021-12-27 21:54:58,966 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) [2021-12-27 21:54:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:54:59,836 INFO L93 Difference]: Finished difference Result 657 states and 955 transitions. [2021-12-27 21:54:59,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-12-27 21:54:59,837 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 [2021-12-27 21:54:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:54:59,841 INFO L225 Difference]: With dead ends: 657 [2021-12-27 21:54:59,841 INFO L226 Difference]: Without dead ends: 610 [2021-12-27 21:54:59,842 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:54:59,842 INFO L933 BasicCegarLoop]: 241 mSDtfsCounter, 249 mSDsluCounter, 2095 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 2336 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-27 21:54:59,842 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 2336 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-27 21:54:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2021-12-27 21:54:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 493. [2021-12-27 21:54:59,890 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) [2021-12-27 21:54:59,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 665 transitions. [2021-12-27 21:54:59,892 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 665 transitions. Word has length 83 [2021-12-27 21:54:59,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:54:59,892 INFO L470 AbstractCegarLoop]: Abstraction has 493 states and 665 transitions. [2021-12-27 21:54:59,892 INFO L471 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) [2021-12-27 21:54:59,892 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 665 transitions. [2021-12-27 21:54:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:54:59,893 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:54:59,894 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:54:59,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2021-12-27 21:54:59,894 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:54:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:54:59,894 INFO L85 PathProgramCache]: Analyzing trace with hash 971177342, now seen corresponding path program 1 times [2021-12-27 21:54:59,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:54:59,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766750228] [2021-12-27 21:54:59,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:54:59,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:54:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:54:59,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:54:59,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:55:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:00,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:00,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766750228] [2021-12-27 21:55:00,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766750228] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:00,073 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:00,073 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-27 21:55:00,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559568353] [2021-12-27 21:55:00,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:00,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 21:55:00,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:00,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 21:55:00,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:55:00,077 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) [2021-12-27 21:55:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:00,889 INFO L93 Difference]: Finished difference Result 957 states and 1298 transitions. [2021-12-27 21:55:00,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-27 21:55:00,889 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 [2021-12-27 21:55:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:00,896 INFO L225 Difference]: With dead ends: 957 [2021-12-27 21:55:00,897 INFO L226 Difference]: Without dead ends: 931 [2021-12-27 21:55:00,898 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:00,898 INFO L933 BasicCegarLoop]: 220 mSDtfsCounter, 348 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:00,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [357 Valid, 2112 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-27 21:55:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2021-12-27 21:55:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 585. [2021-12-27 21:55:00,973 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) [2021-12-27 21:55:00,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 762 transitions. [2021-12-27 21:55:00,975 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 762 transitions. Word has length 84 [2021-12-27 21:55:00,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:00,975 INFO L470 AbstractCegarLoop]: Abstraction has 585 states and 762 transitions. [2021-12-27 21:55:00,975 INFO L471 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) [2021-12-27 21:55:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 762 transitions. [2021-12-27 21:55:00,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-12-27 21:55:00,976 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:00,977 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:00,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2021-12-27 21:55:00,977 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:00,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:00,977 INFO L85 PathProgramCache]: Analyzing trace with hash -171325124, now seen corresponding path program 1 times [2021-12-27 21:55:00,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:00,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547469623] [2021-12-27 21:55:00,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:00,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2021-12-27 21:55:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:01,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:55:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:01,171 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:01,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547469623] [2021-12-27 21:55:01,171 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547469623] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:01,171 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:01,171 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-12-27 21:55:01,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897417284] [2021-12-27 21:55:01,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:01,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-27 21:55:01,172 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:01,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-27 21:55:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-12-27 21:55:01,173 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) [2021-12-27 21:55:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:01,998 INFO L93 Difference]: Finished difference Result 952 states and 1287 transitions. [2021-12-27 21:55:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-12-27 21:55:01,998 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 [2021-12-27 21:55:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:02,003 INFO L225 Difference]: With dead ends: 952 [2021-12-27 21:55:02,003 INFO L226 Difference]: Without dead ends: 918 [2021-12-27 21:55:02,004 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:02,005 INFO L933 BasicCegarLoop]: 347 mSDtfsCounter, 273 mSDsluCounter, 2854 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:02,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [282 Valid, 3201 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2021-12-27 21:55:02,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2021-12-27 21:55:02,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 468. [2021-12-27 21:55:02,055 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) [2021-12-27 21:55:02,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 632 transitions. [2021-12-27 21:55:02,057 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 632 transitions. Word has length 84 [2021-12-27 21:55:02,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:02,057 INFO L470 AbstractCegarLoop]: Abstraction has 468 states and 632 transitions. [2021-12-27 21:55:02,057 INFO L471 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) [2021-12-27 21:55:02,058 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 632 transitions. [2021-12-27 21:55:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-27 21:55:02,059 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:02,059 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:02,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2021-12-27 21:55:02,059 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:02,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:02,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1715684878, now seen corresponding path program 1 times [2021-12-27 21:55:02,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:02,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141574698] [2021-12-27 21:55:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:02,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:02,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:55:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:02,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-27 21:55:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:02,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:02,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141574698] [2021-12-27 21:55:02,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141574698] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:02,247 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:02,248 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-27 21:55:02,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856660792] [2021-12-27 21:55:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:02,248 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:55:02,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:55:02,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:55:02,249 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) [2021-12-27 21:55:03,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:03,270 INFO L93 Difference]: Finished difference Result 932 states and 1258 transitions. [2021-12-27 21:55:03,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-27 21:55:03,271 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 [2021-12-27 21:55:03,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:03,278 INFO L225 Difference]: With dead ends: 932 [2021-12-27 21:55:03,278 INFO L226 Difference]: Without dead ends: 885 [2021-12-27 21:55:03,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2021-12-27 21:55:03,288 INFO L933 BasicCegarLoop]: 251 mSDtfsCounter, 531 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1445 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:03,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [546 Valid, 2123 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 1445 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-27 21:55:03,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2021-12-27 21:55:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 858. [2021-12-27 21:55:03,389 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) [2021-12-27 21:55:03,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1136 transitions. [2021-12-27 21:55:03,399 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1136 transitions. Word has length 93 [2021-12-27 21:55:03,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:03,399 INFO L470 AbstractCegarLoop]: Abstraction has 858 states and 1136 transitions. [2021-12-27 21:55:03,400 INFO L471 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) [2021-12-27 21:55:03,400 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1136 transitions. [2021-12-27 21:55:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-27 21:55:03,403 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:03,404 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:03,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2021-12-27 21:55:03,404 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 327002288, now seen corresponding path program 1 times [2021-12-27 21:55:03,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029380571] [2021-12-27 21:55:03,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:03,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:55:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-27 21:55:03,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:03,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2021-12-27 21:55:03,538 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:03,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029380571] [2021-12-27 21:55:03,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029380571] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:03,538 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:03,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:55:03,538 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421679528] [2021-12-27 21:55:03,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:03,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:55:03,539 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:03,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:55:03,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:03,540 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) [2021-12-27 21:55:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:04,038 INFO L93 Difference]: Finished difference Result 1692 states and 2335 transitions. [2021-12-27 21:55:04,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:55:04,038 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 [2021-12-27 21:55:04,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:04,045 INFO L225 Difference]: With dead ends: 1692 [2021-12-27 21:55:04,045 INFO L226 Difference]: Without dead ends: 1142 [2021-12-27 21:55:04,049 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:04,049 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 158 mSDsluCounter, 1116 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2021-12-27 21:55:04,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 1354 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:55:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2021-12-27 21:55:04,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 834. [2021-12-27 21:55:04,145 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) [2021-12-27 21:55:04,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1084 transitions. [2021-12-27 21:55:04,148 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1084 transitions. Word has length 95 [2021-12-27 21:55:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:04,148 INFO L470 AbstractCegarLoop]: Abstraction has 834 states and 1084 transitions. [2021-12-27 21:55:04,149 INFO L471 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) [2021-12-27 21:55:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1084 transitions. [2021-12-27 21:55:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2021-12-27 21:55:04,150 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:04,150 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:04,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2021-12-27 21:55:04,151 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:04,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1808548852, now seen corresponding path program 1 times [2021-12-27 21:55:04,151 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:04,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634236818] [2021-12-27 21:55:04,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:04,152 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2021-12-27 21:55:04,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2021-12-27 21:55:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2021-12-27 21:55:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:04,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-27 21:55:04,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634236818] [2021-12-27 21:55:04,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634236818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:04,326 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:04,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-12-27 21:55:04,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699499168] [2021-12-27 21:55:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:04,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-27 21:55:04,326 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:04,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-27 21:55:04,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2021-12-27 21:55:04,327 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) [2021-12-27 21:55:05,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:05,434 INFO L93 Difference]: Finished difference Result 858 states and 1116 transitions. [2021-12-27 21:55:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-12-27 21:55:05,434 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 [2021-12-27 21:55:05,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:05,438 INFO L225 Difference]: With dead ends: 858 [2021-12-27 21:55:05,438 INFO L226 Difference]: Without dead ends: 809 [2021-12-27 21:55:05,440 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2021-12-27 21:55:05,440 INFO L933 BasicCegarLoop]: 356 mSDtfsCounter, 363 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:05,441 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [378 Valid, 3028 Invalid, 2155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2021-12-27 21:55:05,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2021-12-27 21:55:05,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 306. [2021-12-27 21:55:05,482 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) [2021-12-27 21:55:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 364 transitions. [2021-12-27 21:55:05,483 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 364 transitions. Word has length 93 [2021-12-27 21:55:05,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:05,483 INFO L470 AbstractCegarLoop]: Abstraction has 306 states and 364 transitions. [2021-12-27 21:55:05,484 INFO L471 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) [2021-12-27 21:55:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 364 transitions. [2021-12-27 21:55:05,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-27 21:55:05,485 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:05,485 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:05,486 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2021-12-27 21:55:05,486 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:05,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:05,486 INFO L85 PathProgramCache]: Analyzing trace with hash 46403579, now seen corresponding path program 1 times [2021-12-27 21:55:05,486 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:05,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943651775] [2021-12-27 21:55:05,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:05,487 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:05,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:55:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-27 21:55:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2021-12-27 21:55:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2021-12-27 21:55:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,617 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-27 21:55:05,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943651775] [2021-12-27 21:55:05,617 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943651775] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-27 21:55:05,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977896128] [2021-12-27 21:55:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:05,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-27 21:55:05,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-27 21:55:05,623 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) [2021-12-27 21:55:05,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-27 21:55:05,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:05,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 867 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-27 21:55:05,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-27 21:55:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2021-12-27 21:55:06,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-27 21:55:06,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977896128] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:06,163 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2021-12-27 21:55:06,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2021-12-27 21:55:06,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592285551] [2021-12-27 21:55:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:06,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-27 21:55:06,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:06,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-27 21:55:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2021-12-27 21:55:06,165 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) [2021-12-27 21:55:06,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:06,248 INFO L93 Difference]: Finished difference Result 513 states and 620 transitions. [2021-12-27 21:55:06,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-27 21:55:06,248 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 [2021-12-27 21:55:06,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:06,250 INFO L225 Difference]: With dead ends: 513 [2021-12-27 21:55:06,250 INFO L226 Difference]: Without dead ends: 327 [2021-12-27 21:55:06,251 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:06,251 INFO L933 BasicCegarLoop]: 150 mSDtfsCounter, 12 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:06,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 720 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-27 21:55:06,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-12-27 21:55:06,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2021-12-27 21:55:06,290 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) [2021-12-27 21:55:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 385 transitions. [2021-12-27 21:55:06,291 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 385 transitions. Word has length 133 [2021-12-27 21:55:06,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:06,291 INFO L470 AbstractCegarLoop]: Abstraction has 322 states and 385 transitions. [2021-12-27 21:55:06,291 INFO L471 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) [2021-12-27 21:55:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 385 transitions. [2021-12-27 21:55:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2021-12-27 21:55:06,293 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:06,293 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:06,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-27 21:55:06,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-12-27 21:55:06,507 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:06,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:06,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1067504510, now seen corresponding path program 1 times [2021-12-27 21:55:06,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:06,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201466419] [2021-12-27 21:55:06,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:06,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:06,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:06,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:55:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-27 21:55:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:06,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-27 21:55:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-27 21:55:06,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2021-12-27 21:55:06,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:06,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201466419] [2021-12-27 21:55:06,658 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201466419] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:06,658 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:06,658 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:55:06,658 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324885319] [2021-12-27 21:55:06,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:06,658 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:55:06,658 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:06,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:55:06,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:06,659 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) [2021-12-27 21:55:07,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:07,129 INFO L93 Difference]: Finished difference Result 534 states and 639 transitions. [2021-12-27 21:55:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:55:07,129 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 [2021-12-27 21:55:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:07,131 INFO L225 Difference]: With dead ends: 534 [2021-12-27 21:55:07,132 INFO L226 Difference]: Without dead ends: 362 [2021-12-27 21:55:07,132 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:07,133 INFO L933 BasicCegarLoop]: 192 mSDtfsCounter, 118 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:07,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 1066 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-27 21:55:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2021-12-27 21:55:07,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2021-12-27 21:55:07,173 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) [2021-12-27 21:55:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 370 transitions. [2021-12-27 21:55:07,175 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 370 transitions. Word has length 134 [2021-12-27 21:55:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:07,175 INFO L470 AbstractCegarLoop]: Abstraction has 315 states and 370 transitions. [2021-12-27 21:55:07,175 INFO L471 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) [2021-12-27 21:55:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 370 transitions. [2021-12-27 21:55:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2021-12-27 21:55:07,177 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:07,177 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:07,177 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-12-27 21:55:07,177 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:07,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1031777441, now seen corresponding path program 1 times [2021-12-27 21:55:07,177 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:07,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550919638] [2021-12-27 21:55:07,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:07,178 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:55:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-27 21:55:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-27 21:55:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-27 21:55:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-27 21:55:07,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-27 21:55:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-27 21:55:07,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:07,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550919638] [2021-12-27 21:55:07,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550919638] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:07,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:07,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:55:07,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202849987] [2021-12-27 21:55:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:07,341 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:55:07,341 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:07,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:55:07,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:07,342 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) [2021-12-27 21:55:07,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:07,753 INFO L93 Difference]: Finished difference Result 384 states and 451 transitions. [2021-12-27 21:55:07,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:55:07,753 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 [2021-12-27 21:55:07,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:07,755 INFO L225 Difference]: With dead ends: 384 [2021-12-27 21:55:07,755 INFO L226 Difference]: Without dead ends: 317 [2021-12-27 21:55:07,756 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:07,756 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 98 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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 [2021-12-27 21:55:07,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 909 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:55:07,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2021-12-27 21:55:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 217. [2021-12-27 21:55:07,794 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) [2021-12-27 21:55:07,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 250 transitions. [2021-12-27 21:55:07,794 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 250 transitions. Word has length 170 [2021-12-27 21:55:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:07,795 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 250 transitions. [2021-12-27 21:55:07,795 INFO L471 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) [2021-12-27 21:55:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 250 transitions. [2021-12-27 21:55:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2021-12-27 21:55:07,796 INFO L506 BasicCegarLoop]: Found error trace [2021-12-27 21:55:07,796 INFO L514 BasicCegarLoop]: 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] [2021-12-27 21:55:07,796 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-12-27 21:55:07,796 INFO L402 AbstractCegarLoop]: === Iteration 49 === Targeting errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-27 21:55:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-27 21:55:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1337713774, now seen corresponding path program 1 times [2021-12-27 21:55:07,797 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-27 21:55:07,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388836541] [2021-12-27 21:55:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-27 21:55:07,797 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-27 21:55:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-27 21:55:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-27 21:55:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2021-12-27 21:55:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2021-12-27 21:55:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2021-12-27 21:55:07,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-27 21:55:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2021-12-27 21:55:07,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-27 21:55:07,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-27 21:55:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-27 21:55:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-27 21:55:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2021-12-27 21:55:07,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-27 21:55:07,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388836541] [2021-12-27 21:55:07,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388836541] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-27 21:55:07,988 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-27 21:55:07,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-27 21:55:07,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840967434] [2021-12-27 21:55:07,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-27 21:55:07,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-27 21:55:07,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-27 21:55:07,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-27 21:55:07,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2021-12-27 21:55:07,989 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) [2021-12-27 21:55:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-27 21:55:08,353 INFO L93 Difference]: Finished difference Result 223 states and 259 transitions. [2021-12-27 21:55:08,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-27 21:55:08,353 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 [2021-12-27 21:55:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-27 21:55:08,354 INFO L225 Difference]: With dead ends: 223 [2021-12-27 21:55:08,354 INFO L226 Difference]: Without dead ends: 0 [2021-12-27 21:55:08,355 INFO L932 BasicCegarLoop]: 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 [2021-12-27 21:55:08,355 INFO L933 BasicCegarLoop]: 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.3s IncrementalHoareTripleChecker+Time [2021-12-27 21:55:08,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 713 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-27 21:55:08,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-27 21:55:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-27 21:55:08,355 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) [2021-12-27 21:55:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-27 21:55:08,356 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 173 [2021-12-27 21:55:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-27 21:55:08,356 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-27 21:55:08,356 INFO L471 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) [2021-12-27 21:55:08,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-27 21:55:08,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-27 21:55:08,358 INFO L764 garLoopResultBuilder]: Registering result SAFE for location errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-27 21:55:08,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2021-12-27 21:55:08,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-27 21:55:34,705 WARN L228 SmtUtils]: Spent 10.90s 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)