./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 5f838d06e3abc608d43ea4f047c9d1e0ab0cacfc .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 21:02:47,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 21:02:47,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 21:02:47,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 21:02:47,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 21:02:47,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 21:02:47,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 21:02:47,192 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 21:02:47,194 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 21:02:47,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 21:02:47,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 21:02:47,198 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 21:02:47,199 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 21:02:47,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 21:02:47,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 21:02:47,204 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 21:02:47,206 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 21:02:47,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 21:02:47,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 21:02:47,212 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 21:02:47,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 21:02:47,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 21:02:47,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 21:02:47,219 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 21:02:47,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 21:02:47,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 21:02:47,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 21:02:47,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 21:02:47,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 21:02:47,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 21:02:47,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 21:02:47,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 21:02:47,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 21:02:47,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 21:02:47,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 21:02:47,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 21:02:47,248 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 21:02:47,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 21:02:47,249 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 21:02:47,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 21:02:47,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 21:02:47,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 21:02:47,310 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 21:02:47,311 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 21:02:47,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 21:02:47,312 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 21:02:47,314 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 21:02:47,314 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 21:02:47,314 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 21:02:47,315 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 21:02:47,315 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 21:02:47,315 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 21:02:47,315 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 21:02:47,315 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 21:02:47,315 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 21:02:47,316 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 21:02:47,316 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 21:02:47,319 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 21:02:47,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 21:02:47,319 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 21:02:47,320 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 21:02:47,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 21:02:47,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 21:02:47,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 21:02:47,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:02:47,320 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 21:02:47,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 21:02:47,321 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 21:02:47,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 21:02:47,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 21:02:47,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 21:02:47,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 21:02:47,328 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-2/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-2/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 -> 5f838d06e3abc608d43ea4f047c9d1e0ab0cacfc [2021-10-05 21:02:47,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 21:02:47,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 21:02:47,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 21:02:47,824 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 21:02:47,824 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 21:02:47,826 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c [2021-10-05 21:02:47,930 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4a9c7c77c/fcacb3d63d2144ab9682177320b10392/FLAGd3d79abe2 [2021-10-05 21:02:48,559 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 21:02:48,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c [2021-10-05 21:02:48,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4a9c7c77c/fcacb3d63d2144ab9682177320b10392/FLAGd3d79abe2 [2021-10-05 21:02:48,925 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/4a9c7c77c/fcacb3d63d2144ab9682177320b10392 [2021-10-05 21:02:48,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 21:02:48,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 21:02:48,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 21:02:48,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 21:02:48,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 21:02:48,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:02:48" (1/1) ... [2021-10-05 21:02:48,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576bd6a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:48, skipping insertion in model container [2021-10-05 21:02:48,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:02:48" (1/1) ... [2021-10-05 21:02:48,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 21:02:48,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 21:02:49,188 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c[2628,2641] [2021-10-05 21:02:49,196 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:02:49,207 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 21:02:49,240 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/min-max-1.wvr.c[2628,2641] [2021-10-05 21:02:49,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:02:49,261 INFO L208 MainTranslator]: Completed translation [2021-10-05 21:02:49,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49 WrapperNode [2021-10-05 21:02:49,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 21:02:49,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 21:02:49,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 21:02:49,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 21:02:49,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,283 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,333 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 21:02:49,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 21:02:49,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 21:02:49,336 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 21:02:49,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,366 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 21:02:49,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 21:02:49,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 21:02:49,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 21:02:49,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (1/1) ... [2021-10-05 21:02:49,434 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:02:49,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 21:02:49,469 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 21:02:49,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 21:02:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 21:02:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 21:02:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 21:02:49,541 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 21:02:49,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-05 21:02:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 21:02:49,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 21:02:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 21:02:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 21:02:49,545 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 21:02:50,105 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 21:02:50,107 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2021-10-05 21:02:50,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:50 BoogieIcfgContainer [2021-10-05 21:02:50,110 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 21:02:50,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 21:02:50,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 21:02:50,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 21:02:50,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 09:02:48" (1/3) ... [2021-10-05 21:02:50,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:02:50, skipping insertion in model container [2021-10-05 21:02:50,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:02:49" (2/3) ... [2021-10-05 21:02:50,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aef272a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:02:50, skipping insertion in model container [2021-10-05 21:02:50,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:50" (3/3) ... [2021-10-05 21:02:50,125 INFO L111 eAbstractionObserver]: Analyzing ICFG min-max-1.wvr.c [2021-10-05 21:02:50,134 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 21:02:50,134 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 21:02:50,135 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 21:02:50,135 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 21:02:50,220 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,221 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,221 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,221 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,222 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,222 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,222 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,223 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,223 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,224 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,225 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,225 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,226 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,226 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,228 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,229 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,230 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,231 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,232 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,233 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,233 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,234 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,235 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,235 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,235 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,236 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,237 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,238 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,239 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,240 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,243 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,244 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,245 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,246 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,247 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,248 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,249 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,249 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,250 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,251 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,258 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,259 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,265 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,267 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,267 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,267 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,268 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,268 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,272 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,273 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,274 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,274 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:02:50,301 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 21:02:50,375 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 21:02:50,387 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, mConcurrency=FINITE_AUTOMATA, 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-10-05 21:02:50,388 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 21:02:50,442 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 21:02:50,460 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 171 places, 174 transitions, 372 flow [2021-10-05 21:02:50,465 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 171 places, 174 transitions, 372 flow [2021-10-05 21:02:50,471 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 171 places, 174 transitions, 372 flow [2021-10-05 21:02:50,566 INFO L129 PetriNetUnfolder]: 13/171 cut-off events. [2021-10-05 21:02:50,566 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 21:02:50,573 INFO L84 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 171 events. 13/171 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 164 event pairs, 0 based on Foata normal form. 0/157 useless extension candidates. Maximal degree in co-relation 145. Up to 2 conditions per place. [2021-10-05 21:02:50,579 INFO L116 LiptonReduction]: Number of co-enabled transitions 2174 [2021-10-05 21:02:59,294 INFO L131 LiptonReduction]: Checked pairs total: 5570 [2021-10-05 21:02:59,294 INFO L133 LiptonReduction]: Total number of compositions: 161 [2021-10-05 21:02:59,304 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 38 transitions, 100 flow [2021-10-05 21:02:59,349 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 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-10-05 21:02:59,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 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-10-05 21:02:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:02:59,375 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:02:59,376 INFO L512 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] [2021-10-05 21:02:59,377 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:02:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:02:59,382 INFO L82 PathProgramCache]: Analyzing trace with hash 47776134, now seen corresponding path program 1 times [2021-10-05 21:02:59,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:02:59,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797165553] [2021-10-05 21:02:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:02:59,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:02:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:02:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:02:59,970 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:02:59,971 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797165553] [2021-10-05 21:02:59,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797165553] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:02:59,972 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:02:59,972 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:02:59,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106584836] [2021-10-05 21:02:59,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:02:59,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:02:59,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:02:59,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:00,000 INFO L87 Difference]: Start difference. First operand has 441 states, 440 states have (on average 3.131818181818182) internal successors, (1378), 440 states have internal predecessors, (1378), 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) Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:01,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:01,351 INFO L93 Difference]: Finished difference Result 2270 states and 6886 transitions. [2021-10-05 21:03:01,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:03:01,353 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:01,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:01,388 INFO L225 Difference]: With dead ends: 2270 [2021-10-05 21:03:01,388 INFO L226 Difference]: Without dead ends: 1670 [2021-10-05 21:03:01,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 543.2ms TimeCoverageRelationStatistics Valid=401, Invalid=1081, Unknown=0, NotChecked=0, Total=1482 [2021-10-05 21:03:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2021-10-05 21:03:01,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 635. [2021-10-05 21:03:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 3.1009463722397475) internal successors, (1966), 634 states have internal predecessors, (1966), 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-10-05 21:03:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1966 transitions. [2021-10-05 21:03:01,509 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1966 transitions. Word has length 23 [2021-10-05 21:03:01,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:01,510 INFO L470 AbstractCegarLoop]: Abstraction has 635 states and 1966 transitions. [2021-10-05 21:03:01,510 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:01,511 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1966 transitions. [2021-10-05 21:03:01,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:01,516 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:01,516 INFO L512 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] [2021-10-05 21:03:01,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 21:03:01,517 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:01,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:01,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1590489032, now seen corresponding path program 2 times [2021-10-05 21:03:01,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:01,518 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334341678] [2021-10-05 21:03:01,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:01,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:01,773 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:01,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334341678] [2021-10-05 21:03:01,774 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334341678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:01,775 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:01,775 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-05 21:03:01,775 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659157087] [2021-10-05 21:03:01,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:03:01,778 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:03:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:03:01,786 INFO L87 Difference]: Start difference. First operand 635 states and 1966 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-10-05 21:03:02,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:02,064 INFO L93 Difference]: Finished difference Result 886 states and 2682 transitions. [2021-10-05 21:03:02,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:03:02,065 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:02,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:02,072 INFO L225 Difference]: With dead ends: 886 [2021-10-05 21:03:02,072 INFO L226 Difference]: Without dead ends: 747 [2021-10-05 21:03:02,073 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 98.6ms TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:03:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2021-10-05 21:03:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2021-10-05 21:03:02,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.046916890080429) internal successors, (2273), 746 states have internal predecessors, (2273), 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-10-05 21:03:02,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2273 transitions. [2021-10-05 21:03:02,114 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2273 transitions. Word has length 23 [2021-10-05 21:03:02,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:02,115 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 2273 transitions. [2021-10-05 21:03:02,115 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 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-10-05 21:03:02,115 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2273 transitions. [2021-10-05 21:03:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:02,119 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:02,119 INFO L512 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] [2021-10-05 21:03:02,119 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 21:03:02,120 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1743554128, now seen corresponding path program 3 times [2021-10-05 21:03:02,121 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:02,121 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981081137] [2021-10-05 21:03:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:02,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:02,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:02,450 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981081137] [2021-10-05 21:03:02,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981081137] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:02,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:02,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:02,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607724611] [2021-10-05 21:03:02,451 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:02,451 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:02,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:02,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:02,457 INFO L87 Difference]: Start difference. First operand 747 states and 2273 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:03,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:03,218 INFO L93 Difference]: Finished difference Result 1942 states and 5934 transitions. [2021-10-05 21:03:03,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2021-10-05 21:03:03,219 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:03,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:03,237 INFO L225 Difference]: With dead ends: 1942 [2021-10-05 21:03:03,237 INFO L226 Difference]: Without dead ends: 1714 [2021-10-05 21:03:03,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 424.1ms TimeCoverageRelationStatistics Valid=266, Invalid=604, Unknown=0, NotChecked=0, Total=870 [2021-10-05 21:03:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2021-10-05 21:03:03,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 770. [2021-10-05 21:03:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 3.037711313394018) internal successors, (2336), 769 states have internal predecessors, (2336), 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-10-05 21:03:03,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2336 transitions. [2021-10-05 21:03:03,286 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2336 transitions. Word has length 23 [2021-10-05 21:03:03,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:03,287 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 2336 transitions. [2021-10-05 21:03:03,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:03,287 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2336 transitions. [2021-10-05 21:03:03,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:03,291 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:03,291 INFO L512 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] [2021-10-05 21:03:03,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 21:03:03,292 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:03,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:03,292 INFO L82 PathProgramCache]: Analyzing trace with hash -599620558, now seen corresponding path program 4 times [2021-10-05 21:03:03,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:03,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631971288] [2021-10-05 21:03:03,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:03,293 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:03,524 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:03,524 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631971288] [2021-10-05 21:03:03,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631971288] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:03,524 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:03,525 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:03,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4249069] [2021-10-05 21:03:03,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:03,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:03,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:03,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:03,527 INFO L87 Difference]: Start difference. First operand 770 states and 2336 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:04,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:04,541 INFO L93 Difference]: Finished difference Result 2490 states and 7572 transitions. [2021-10-05 21:03:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2021-10-05 21:03:04,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:04,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:04,560 INFO L225 Difference]: With dead ends: 2490 [2021-10-05 21:03:04,561 INFO L226 Difference]: Without dead ends: 2118 [2021-10-05 21:03:04,562 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 518.3ms TimeCoverageRelationStatistics Valid=457, Invalid=1705, Unknown=0, NotChecked=0, Total=2162 [2021-10-05 21:03:04,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2021-10-05 21:03:04,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 784. [2021-10-05 21:03:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 3.0319284802043422) internal successors, (2374), 783 states have internal predecessors, (2374), 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-10-05 21:03:04,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 2374 transitions. [2021-10-05 21:03:04,633 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 2374 transitions. Word has length 23 [2021-10-05 21:03:04,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:04,633 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 2374 transitions. [2021-10-05 21:03:04,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:04,634 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 2374 transitions. [2021-10-05 21:03:04,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:04,637 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:04,637 INFO L512 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] [2021-10-05 21:03:04,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 21:03:04,637 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:04,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1988332682, now seen corresponding path program 5 times [2021-10-05 21:03:04,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:04,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541554129] [2021-10-05 21:03:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:04,640 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:04,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:04,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541554129] [2021-10-05 21:03:04,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541554129] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:04,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:04,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:04,941 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391784727] [2021-10-05 21:03:04,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:04,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:04,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:04,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:04,942 INFO L87 Difference]: Start difference. First operand 784 states and 2374 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:05,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:05,977 INFO L93 Difference]: Finished difference Result 2612 states and 7972 transitions. [2021-10-05 21:03:05,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-10-05 21:03:05,978 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:05,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:05,996 INFO L225 Difference]: With dead ends: 2612 [2021-10-05 21:03:05,997 INFO L226 Difference]: Without dead ends: 2240 [2021-10-05 21:03:05,998 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 574.1ms TimeCoverageRelationStatistics Valid=531, Invalid=2019, Unknown=0, NotChecked=0, Total=2550 [2021-10-05 21:03:06,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2021-10-05 21:03:06,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 804. [2021-10-05 21:03:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 803 states have (on average 3.0423412204234124) internal successors, (2443), 803 states have internal predecessors, (2443), 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-10-05 21:03:06,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 2443 transitions. [2021-10-05 21:03:06,046 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 2443 transitions. Word has length 23 [2021-10-05 21:03:06,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:06,047 INFO L470 AbstractCegarLoop]: Abstraction has 804 states and 2443 transitions. [2021-10-05 21:03:06,047 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 2443 transitions. [2021-10-05 21:03:06,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:06,051 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:06,051 INFO L512 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] [2021-10-05 21:03:06,051 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 21:03:06,051 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:06,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:06,052 INFO L82 PathProgramCache]: Analyzing trace with hash -973371580, now seen corresponding path program 6 times [2021-10-05 21:03:06,053 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:06,053 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128956150] [2021-10-05 21:03:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:06,053 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:06,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:06,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:06,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:06,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128956150] [2021-10-05 21:03:06,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128956150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:06,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:06,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 21:03:06,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305886076] [2021-10-05 21:03:06,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:03:06,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:06,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:03:06,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:03:06,187 INFO L87 Difference]: Start difference. First operand 804 states and 2443 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-05 21:03:06,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:06,422 INFO L93 Difference]: Finished difference Result 996 states and 3001 transitions. [2021-10-05 21:03:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:03:06,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:06,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:06,430 INFO L225 Difference]: With dead ends: 996 [2021-10-05 21:03:06,430 INFO L226 Difference]: Without dead ends: 869 [2021-10-05 21:03:06,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 105.6ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-10-05 21:03:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2021-10-05 21:03:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2021-10-05 21:03:06,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 3.0299539170506913) internal successors, (2630), 868 states have internal predecessors, (2630), 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-10-05 21:03:06,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2630 transitions. [2021-10-05 21:03:06,461 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2630 transitions. Word has length 23 [2021-10-05 21:03:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:06,461 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2630 transitions. [2021-10-05 21:03:06,461 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-10-05 21:03:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2630 transitions. [2021-10-05 21:03:06,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:06,465 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:06,465 INFO L512 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] [2021-10-05 21:03:06,465 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 21:03:06,466 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:06,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1683954164, now seen corresponding path program 7 times [2021-10-05 21:03:06,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:06,467 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646922939] [2021-10-05 21:03:06,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:06,467 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:06,644 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:06,644 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646922939] [2021-10-05 21:03:06,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646922939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:06,644 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:06,645 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:06,645 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204037483] [2021-10-05 21:03:06,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:06,646 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:06,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:06,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:06,647 INFO L87 Difference]: Start difference. First operand 869 states and 2630 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:07,485 INFO L93 Difference]: Finished difference Result 2558 states and 7752 transitions. [2021-10-05 21:03:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-10-05 21:03:07,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:07,507 INFO L225 Difference]: With dead ends: 2558 [2021-10-05 21:03:07,508 INFO L226 Difference]: Without dead ends: 2393 [2021-10-05 21:03:07,509 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 417.4ms TimeCoverageRelationStatistics Valid=296, Invalid=964, Unknown=0, NotChecked=0, Total=1260 [2021-10-05 21:03:07,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2393 states. [2021-10-05 21:03:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2393 to 875. [2021-10-05 21:03:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 3.0274599542334095) internal successors, (2646), 874 states have internal predecessors, (2646), 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-10-05 21:03:07,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 2646 transitions. [2021-10-05 21:03:07,564 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 2646 transitions. Word has length 23 [2021-10-05 21:03:07,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:07,564 INFO L470 AbstractCegarLoop]: Abstraction has 875 states and 2646 transitions. [2021-10-05 21:03:07,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:07,565 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 2646 transitions. [2021-10-05 21:03:07,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:07,568 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:07,568 INFO L512 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] [2021-10-05 21:03:07,568 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 21:03:07,569 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:07,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:07,569 INFO L82 PathProgramCache]: Analyzing trace with hash -76451148, now seen corresponding path program 8 times [2021-10-05 21:03:07,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:07,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231547582] [2021-10-05 21:03:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:07,570 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:07,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:07,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231547582] [2021-10-05 21:03:07,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231547582] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:07,749 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:07,749 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:07,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814356542] [2021-10-05 21:03:07,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:07,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:07,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:07,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:07,753 INFO L87 Difference]: Start difference. First operand 875 states and 2646 transitions. Second operand has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:08,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:08,500 INFO L93 Difference]: Finished difference Result 2432 states and 7399 transitions. [2021-10-05 21:03:08,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-10-05 21:03:08,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:08,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:08,521 INFO L225 Difference]: With dead ends: 2432 [2021-10-05 21:03:08,521 INFO L226 Difference]: Without dead ends: 2267 [2021-10-05 21:03:08,522 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 411.4ms TimeCoverageRelationStatistics Valid=318, Invalid=1014, Unknown=0, NotChecked=0, Total=1332 [2021-10-05 21:03:08,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2267 states. [2021-10-05 21:03:08,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2267 to 869. [2021-10-05 21:03:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 3.0299539170506913) internal successors, (2630), 868 states have internal predecessors, (2630), 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-10-05 21:03:08,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 2630 transitions. [2021-10-05 21:03:08,577 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 2630 transitions. Word has length 23 [2021-10-05 21:03:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:08,577 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 2630 transitions. [2021-10-05 21:03:08,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 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-10-05 21:03:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 2630 transitions. [2021-10-05 21:03:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:08,581 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:08,581 INFO L512 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] [2021-10-05 21:03:08,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 21:03:08,582 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:08,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1374913638, now seen corresponding path program 9 times [2021-10-05 21:03:08,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:08,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640678872] [2021-10-05 21:03:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:08,583 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:08,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:08,728 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:08,729 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640678872] [2021-10-05 21:03:08,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640678872] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:08,729 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:08,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:08,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114867361] [2021-10-05 21:03:08,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:08,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:08,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:08,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:08,731 INFO L87 Difference]: Start difference. First operand 869 states and 2630 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:09,035 INFO L93 Difference]: Finished difference Result 1016 states and 3047 transitions. [2021-10-05 21:03:09,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:03:09,036 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:09,043 INFO L225 Difference]: With dead ends: 1016 [2021-10-05 21:03:09,043 INFO L226 Difference]: Without dead ends: 889 [2021-10-05 21:03:09,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 151.2ms TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2021-10-05 21:03:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2021-10-05 21:03:09,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 829. [2021-10-05 21:03:09,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 828 states have (on average 3.0277777777777777) internal successors, (2507), 828 states have internal predecessors, (2507), 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-10-05 21:03:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 2507 transitions. [2021-10-05 21:03:09,099 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 2507 transitions. Word has length 23 [2021-10-05 21:03:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:09,099 INFO L470 AbstractCegarLoop]: Abstraction has 829 states and 2507 transitions. [2021-10-05 21:03:09,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 2507 transitions. [2021-10-05 21:03:09,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:09,103 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:09,103 INFO L512 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] [2021-10-05 21:03:09,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 21:03:09,104 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:09,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:09,105 INFO L82 PathProgramCache]: Analyzing trace with hash 410192184, now seen corresponding path program 10 times [2021-10-05 21:03:09,105 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:09,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645691481] [2021-10-05 21:03:09,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:09,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:09,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:09,272 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:09,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645691481] [2021-10-05 21:03:09,273 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645691481] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:09,273 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:09,273 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:09,273 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744384785] [2021-10-05 21:03:09,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:09,274 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:09,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:09,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:09,275 INFO L87 Difference]: Start difference. First operand 829 states and 2507 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:09,632 INFO L93 Difference]: Finished difference Result 1656 states and 5041 transitions. [2021-10-05 21:03:09,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 21:03:09,633 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:09,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:09,643 INFO L225 Difference]: With dead ends: 1656 [2021-10-05 21:03:09,644 INFO L226 Difference]: Without dead ends: 1517 [2021-10-05 21:03:09,644 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 184.6ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:03:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2021-10-05 21:03:09,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 816. [2021-10-05 21:03:09,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 816 states, 815 states have (on average 3.0343558282208587) internal successors, (2473), 815 states have internal predecessors, (2473), 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-10-05 21:03:09,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 816 states to 816 states and 2473 transitions. [2021-10-05 21:03:09,684 INFO L78 Accepts]: Start accepts. Automaton has 816 states and 2473 transitions. Word has length 23 [2021-10-05 21:03:09,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:09,684 INFO L470 AbstractCegarLoop]: Abstraction has 816 states and 2473 transitions. [2021-10-05 21:03:09,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:09,685 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states and 2473 transitions. [2021-10-05 21:03:09,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:09,688 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:09,688 INFO L512 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] [2021-10-05 21:03:09,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 21:03:09,689 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:09,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:09,689 INFO L82 PathProgramCache]: Analyzing trace with hash -956215452, now seen corresponding path program 11 times [2021-10-05 21:03:09,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:09,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833736916] [2021-10-05 21:03:09,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:09,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:09,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:09,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:09,796 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833736916] [2021-10-05 21:03:09,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833736916] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:09,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:09,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:09,797 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288363747] [2021-10-05 21:03:09,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:03:09,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:09,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:03:09,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:03:09,800 INFO L87 Difference]: Start difference. First operand 816 states and 2473 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:10,228 INFO L93 Difference]: Finished difference Result 1603 states and 4824 transitions. [2021-10-05 21:03:10,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:03:10,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:10,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:10,237 INFO L225 Difference]: With dead ends: 1603 [2021-10-05 21:03:10,238 INFO L226 Difference]: Without dead ends: 1411 [2021-10-05 21:03:10,238 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 158.2ms TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:03:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2021-10-05 21:03:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 826. [2021-10-05 21:03:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 825 states have (on average 3.0303030303030303) internal successors, (2500), 825 states have internal predecessors, (2500), 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-10-05 21:03:10,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 2500 transitions. [2021-10-05 21:03:10,281 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 2500 transitions. Word has length 23 [2021-10-05 21:03:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:10,281 INFO L470 AbstractCegarLoop]: Abstraction has 826 states and 2500 transitions. [2021-10-05 21:03:10,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 2500 transitions. [2021-10-05 21:03:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:10,285 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:10,285 INFO L512 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] [2021-10-05 21:03:10,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 21:03:10,286 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1631737788, now seen corresponding path program 12 times [2021-10-05 21:03:10,286 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:10,286 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004926076] [2021-10-05 21:03:10,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:10,287 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:10,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:10,402 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:10,402 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004926076] [2021-10-05 21:03:10,402 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004926076] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:10,402 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:10,402 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:10,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407379347] [2021-10-05 21:03:10,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:03:10,403 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:10,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:03:10,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:03:10,404 INFO L87 Difference]: Start difference. First operand 826 states and 2500 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:10,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:10,842 INFO L93 Difference]: Finished difference Result 1425 states and 4301 transitions. [2021-10-05 21:03:10,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:03:10,843 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:10,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:10,848 INFO L225 Difference]: With dead ends: 1425 [2021-10-05 21:03:10,848 INFO L226 Difference]: Without dead ends: 1233 [2021-10-05 21:03:10,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 155.2ms TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2021-10-05 21:03:10,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2021-10-05 21:03:10,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 818. [2021-10-05 21:03:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.033047735618115) internal successors, (2478), 817 states have internal predecessors, (2478), 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-10-05 21:03:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2478 transitions. [2021-10-05 21:03:10,909 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2478 transitions. Word has length 23 [2021-10-05 21:03:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:10,909 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2478 transitions. [2021-10-05 21:03:10,910 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:10,910 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2478 transitions. [2021-10-05 21:03:10,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:10,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:10,913 INFO L512 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] [2021-10-05 21:03:10,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 21:03:10,914 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:10,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:10,914 INFO L82 PathProgramCache]: Analyzing trace with hash 2117753478, now seen corresponding path program 13 times [2021-10-05 21:03:10,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:10,915 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754372337] [2021-10-05 21:03:10,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:10,915 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:11,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:11,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754372337] [2021-10-05 21:03:11,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754372337] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:11,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:11,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:11,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171152349] [2021-10-05 21:03:11,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:03:11,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:11,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:03:11,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:03:11,030 INFO L87 Difference]: Start difference. First operand 818 states and 2478 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:11,566 INFO L93 Difference]: Finished difference Result 1827 states and 5588 transitions. [2021-10-05 21:03:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-10-05 21:03:11,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:11,574 INFO L225 Difference]: With dead ends: 1827 [2021-10-05 21:03:11,574 INFO L226 Difference]: Without dead ends: 1518 [2021-10-05 21:03:11,575 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 180.7ms TimeCoverageRelationStatistics Valid=164, Invalid=436, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:03:11,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2021-10-05 21:03:11,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 833. [2021-10-05 21:03:11,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 832 states have (on average 3.030048076923077) internal successors, (2521), 832 states have internal predecessors, (2521), 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-10-05 21:03:11,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 2521 transitions. [2021-10-05 21:03:11,617 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 2521 transitions. Word has length 23 [2021-10-05 21:03:11,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:11,618 INFO L470 AbstractCegarLoop]: Abstraction has 833 states and 2521 transitions. [2021-10-05 21:03:11,618 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:11,619 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 2521 transitions. [2021-10-05 21:03:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:11,622 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:11,623 INFO L512 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] [2021-10-05 21:03:11,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 21:03:11,623 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:11,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:11,624 INFO L82 PathProgramCache]: Analyzing trace with hash 160130856, now seen corresponding path program 14 times [2021-10-05 21:03:11,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:11,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818783871] [2021-10-05 21:03:11,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:11,625 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:11,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:11,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:11,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:11,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818783871] [2021-10-05 21:03:11,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818783871] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:11,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:11,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:11,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002729376] [2021-10-05 21:03:11,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:11,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:11,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:11,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:11,752 INFO L87 Difference]: Start difference. First operand 833 states and 2521 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:12,344 INFO L93 Difference]: Finished difference Result 1469 states and 4481 transitions. [2021-10-05 21:03:12,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:03:12,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:12,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:12,350 INFO L225 Difference]: With dead ends: 1469 [2021-10-05 21:03:12,350 INFO L226 Difference]: Without dead ends: 1253 [2021-10-05 21:03:12,351 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 297.0ms TimeCoverageRelationStatistics Valid=236, Invalid=520, Unknown=0, NotChecked=0, Total=756 [2021-10-05 21:03:12,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2021-10-05 21:03:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 818. [2021-10-05 21:03:12,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 817 states have (on average 3.033047735618115) internal successors, (2478), 817 states have internal predecessors, (2478), 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-10-05 21:03:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 2478 transitions. [2021-10-05 21:03:12,386 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 2478 transitions. Word has length 23 [2021-10-05 21:03:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:12,386 INFO L470 AbstractCegarLoop]: Abstraction has 818 states and 2478 transitions. [2021-10-05 21:03:12,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 2478 transitions. [2021-10-05 21:03:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:12,389 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:12,389 INFO L512 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] [2021-10-05 21:03:12,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 21:03:12,390 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:12,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:12,390 INFO L82 PathProgramCache]: Analyzing trace with hash 876590054, now seen corresponding path program 15 times [2021-10-05 21:03:12,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:12,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917094516] [2021-10-05 21:03:12,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:12,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:12,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:12,500 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917094516] [2021-10-05 21:03:12,500 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917094516] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:12,500 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:12,500 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:12,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837544459] [2021-10-05 21:03:12,501 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:12,501 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:12,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:12,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:12,502 INFO L87 Difference]: Start difference. First operand 818 states and 2478 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:12,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:12,964 INFO L93 Difference]: Finished difference Result 1440 states and 4346 transitions. [2021-10-05 21:03:12,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:03:12,964 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:12,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:12,970 INFO L225 Difference]: With dead ends: 1440 [2021-10-05 21:03:12,970 INFO L226 Difference]: Without dead ends: 1275 [2021-10-05 21:03:12,971 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 224.2ms TimeCoverageRelationStatistics Valid=173, Invalid=379, Unknown=0, NotChecked=0, Total=552 [2021-10-05 21:03:12,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2021-10-05 21:03:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 821. [2021-10-05 21:03:13,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 820 states have (on average 3.0317073170731708) internal successors, (2486), 820 states have internal predecessors, (2486), 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-10-05 21:03:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 2486 transitions. [2021-10-05 21:03:13,016 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 2486 transitions. Word has length 23 [2021-10-05 21:03:13,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:13,020 INFO L470 AbstractCegarLoop]: Abstraction has 821 states and 2486 transitions. [2021-10-05 21:03:13,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 2486 transitions. [2021-10-05 21:03:13,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:13,024 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:13,024 INFO L512 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] [2021-10-05 21:03:13,025 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 21:03:13,025 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:13,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2108198132, now seen corresponding path program 16 times [2021-10-05 21:03:13,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:13,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151706044] [2021-10-05 21:03:13,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:13,026 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:13,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:13,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:13,263 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:13,263 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151706044] [2021-10-05 21:03:13,264 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151706044] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:13,264 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:13,264 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:03:13,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576565981] [2021-10-05 21:03:13,264 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:03:13,264 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:03:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:03:13,269 INFO L87 Difference]: Start difference. First operand 821 states and 2486 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-10-05 21:03:13,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:13,697 INFO L93 Difference]: Finished difference Result 1554 states and 4711 transitions. [2021-10-05 21:03:13,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:03:13,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:13,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:13,704 INFO L225 Difference]: With dead ends: 1554 [2021-10-05 21:03:13,705 INFO L226 Difference]: Without dead ends: 1415 [2021-10-05 21:03:13,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 215.1ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:03:13,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2021-10-05 21:03:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 807. [2021-10-05 21:03:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 3.0186104218362284) internal successors, (2433), 806 states have internal predecessors, (2433), 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-10-05 21:03:13,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2433 transitions. [2021-10-05 21:03:13,739 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2433 transitions. Word has length 23 [2021-10-05 21:03:13,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:13,739 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2433 transitions. [2021-10-05 21:03:13,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-10-05 21:03:13,740 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2433 transitions. [2021-10-05 21:03:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-05 21:03:13,742 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:13,743 INFO L512 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] [2021-10-05 21:03:13,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 21:03:13,743 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1810874226, now seen corresponding path program 17 times [2021-10-05 21:03:13,744 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:13,744 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136178431] [2021-10-05 21:03:13,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:13,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:13,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:13,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136178431] [2021-10-05 21:03:13,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136178431] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:13,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:13,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:13,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085496404] [2021-10-05 21:03:13,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:13,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:13,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:13,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:13,893 INFO L87 Difference]: Start difference. First operand 807 states and 2433 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:14,384 INFO L93 Difference]: Finished difference Result 1282 states and 3869 transitions. [2021-10-05 21:03:14,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:03:14,385 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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) Word has length 23 [2021-10-05 21:03:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:14,389 INFO L225 Difference]: With dead ends: 1282 [2021-10-05 21:03:14,389 INFO L226 Difference]: Without dead ends: 1117 [2021-10-05 21:03:14,390 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 236.5ms TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2021-10-05 21:03:14,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2021-10-05 21:03:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 795. [2021-10-05 21:03:14,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 795 states, 794 states have (on average 3.0239294710327456) internal successors, (2401), 794 states have internal predecessors, (2401), 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-10-05 21:03:14,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 2401 transitions. [2021-10-05 21:03:14,421 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 2401 transitions. Word has length 23 [2021-10-05 21:03:14,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:14,422 INFO L470 AbstractCegarLoop]: Abstraction has 795 states and 2401 transitions. [2021-10-05 21:03:14,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 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-10-05 21:03:14,422 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 2401 transitions. [2021-10-05 21:03:14,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:14,425 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:14,425 INFO L512 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-10-05 21:03:14,425 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 21:03:14,426 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:14,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:14,426 INFO L82 PathProgramCache]: Analyzing trace with hash -77296354, now seen corresponding path program 1 times [2021-10-05 21:03:14,426 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:14,426 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066066080] [2021-10-05 21:03:14,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:14,427 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:14,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:14,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:14,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066066080] [2021-10-05 21:03:14,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066066080] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:14,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:14,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:14,600 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433700928] [2021-10-05 21:03:14,601 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:14,601 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:14,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:14,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:14,602 INFO L87 Difference]: Start difference. First operand 795 states and 2401 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:15,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:15,382 INFO L93 Difference]: Finished difference Result 2327 states and 7029 transitions. [2021-10-05 21:03:15,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-10-05 21:03:15,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:15,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:15,390 INFO L225 Difference]: With dead ends: 2327 [2021-10-05 21:03:15,391 INFO L226 Difference]: Without dead ends: 2008 [2021-10-05 21:03:15,391 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 355.1ms TimeCoverageRelationStatistics Valid=322, Invalid=800, Unknown=0, NotChecked=0, Total=1122 [2021-10-05 21:03:15,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2021-10-05 21:03:15,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 824. [2021-10-05 21:03:15,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 3.0303766707168895) internal successors, (2494), 823 states have internal predecessors, (2494), 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-10-05 21:03:15,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2494 transitions. [2021-10-05 21:03:15,458 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2494 transitions. Word has length 24 [2021-10-05 21:03:15,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:15,459 INFO L470 AbstractCegarLoop]: Abstraction has 824 states and 2494 transitions. [2021-10-05 21:03:15,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:15,460 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2494 transitions. [2021-10-05 21:03:15,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:15,462 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:15,462 INFO L512 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-10-05 21:03:15,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 21:03:15,463 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:15,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:15,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1868626616, now seen corresponding path program 2 times [2021-10-05 21:03:15,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:15,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196856400] [2021-10-05 21:03:15,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:15,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:15,609 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:15,609 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196856400] [2021-10-05 21:03:15,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196856400] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:15,610 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:15,610 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:03:15,610 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199667479] [2021-10-05 21:03:15,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:03:15,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:15,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:03:15,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:03:15,612 INFO L87 Difference]: Start difference. First operand 824 states and 2494 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-10-05 21:03:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:16,205 INFO L93 Difference]: Finished difference Result 1719 states and 5217 transitions. [2021-10-05 21:03:16,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-10-05 21:03:16,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:16,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:16,213 INFO L225 Difference]: With dead ends: 1719 [2021-10-05 21:03:16,214 INFO L226 Difference]: Without dead ends: 1491 [2021-10-05 21:03:16,215 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 321.7ms TimeCoverageRelationStatistics Valid=253, Invalid=559, Unknown=0, NotChecked=0, Total=812 [2021-10-05 21:03:16,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2021-10-05 21:03:16,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 783. [2021-10-05 21:03:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 782 states have (on average 3.0485933503836318) internal successors, (2384), 782 states have internal predecessors, (2384), 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-10-05 21:03:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 2384 transitions. [2021-10-05 21:03:16,250 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 2384 transitions. Word has length 24 [2021-10-05 21:03:16,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:16,250 INFO L470 AbstractCegarLoop]: Abstraction has 783 states and 2384 transitions. [2021-10-05 21:03:16,251 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-10-05 21:03:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 2384 transitions. [2021-10-05 21:03:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:16,254 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:16,254 INFO L512 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-10-05 21:03:16,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 21:03:16,255 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:16,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash -724693046, now seen corresponding path program 3 times [2021-10-05 21:03:16,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:16,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638007581] [2021-10-05 21:03:16,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:16,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:16,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:16,397 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:16,397 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638007581] [2021-10-05 21:03:16,397 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638007581] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:16,397 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:16,398 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:16,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808264314] [2021-10-05 21:03:16,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:16,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:16,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:16,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:16,399 INFO L87 Difference]: Start difference. First operand 783 states and 2384 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:16,940 INFO L93 Difference]: Finished difference Result 1621 states and 4882 transitions. [2021-10-05 21:03:16,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-10-05 21:03:16,940 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:16,946 INFO L225 Difference]: With dead ends: 1621 [2021-10-05 21:03:16,947 INFO L226 Difference]: Without dead ends: 1455 [2021-10-05 21:03:16,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 242.7ms TimeCoverageRelationStatistics Valid=220, Invalid=592, Unknown=0, NotChecked=0, Total=812 [2021-10-05 21:03:16,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2021-10-05 21:03:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 780. [2021-10-05 21:03:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 3.0462130937098846) internal successors, (2373), 779 states have internal predecessors, (2373), 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-10-05 21:03:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2373 transitions. [2021-10-05 21:03:16,984 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2373 transitions. Word has length 24 [2021-10-05 21:03:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:16,984 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 2373 transitions. [2021-10-05 21:03:16,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2373 transitions. [2021-10-05 21:03:16,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:16,988 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:16,988 INFO L512 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-10-05 21:03:16,988 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 21:03:16,989 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1863260194, now seen corresponding path program 4 times [2021-10-05 21:03:16,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:16,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534258716] [2021-10-05 21:03:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:16,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:17,124 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:17,125 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534258716] [2021-10-05 21:03:17,125 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534258716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:17,125 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:17,125 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:17,125 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248594482] [2021-10-05 21:03:17,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:17,126 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:17,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:17,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:17,127 INFO L87 Difference]: Start difference. First operand 780 states and 2373 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:17,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:17,712 INFO L93 Difference]: Finished difference Result 1452 states and 4401 transitions. [2021-10-05 21:03:17,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-10-05 21:03:17,713 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:17,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:17,744 INFO L225 Difference]: With dead ends: 1452 [2021-10-05 21:03:17,745 INFO L226 Difference]: Without dead ends: 1286 [2021-10-05 21:03:17,746 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 278.5ms TimeCoverageRelationStatistics Valid=249, Invalid=681, Unknown=0, NotChecked=0, Total=930 [2021-10-05 21:03:17,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1286 states. [2021-10-05 21:03:17,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1286 to 770. [2021-10-05 21:03:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 770 states, 769 states have (on average 3.046814044213264) internal successors, (2343), 769 states have internal predecessors, (2343), 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-10-05 21:03:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 2343 transitions. [2021-10-05 21:03:17,780 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 2343 transitions. Word has length 24 [2021-10-05 21:03:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:17,781 INFO L470 AbstractCegarLoop]: Abstraction has 770 states and 2343 transitions. [2021-10-05 21:03:17,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 2343 transitions. [2021-10-05 21:03:17,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:17,785 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:17,785 INFO L512 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-10-05 21:03:17,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 21:03:17,786 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:17,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1809026652, now seen corresponding path program 5 times [2021-10-05 21:03:17,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:17,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269007563] [2021-10-05 21:03:17,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:17,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:17,932 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:17,932 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269007563] [2021-10-05 21:03:17,932 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269007563] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:17,932 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:17,933 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:17,933 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581928611] [2021-10-05 21:03:17,933 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:17,934 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:17,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:17,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:17,935 INFO L87 Difference]: Start difference. First operand 770 states and 2343 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:18,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:18,526 INFO L93 Difference]: Finished difference Result 1396 states and 4220 transitions. [2021-10-05 21:03:18,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-10-05 21:03:18,526 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:18,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:18,532 INFO L225 Difference]: With dead ends: 1396 [2021-10-05 21:03:18,532 INFO L226 Difference]: Without dead ends: 1231 [2021-10-05 21:03:18,532 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 284.1ms TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2021-10-05 21:03:18,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2021-10-05 21:03:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 747. [2021-10-05 21:03:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 746 states have (on average 3.0536193029490617) internal successors, (2278), 746 states have internal predecessors, (2278), 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-10-05 21:03:18,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 2278 transitions. [2021-10-05 21:03:18,559 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 2278 transitions. Word has length 24 [2021-10-05 21:03:18,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:18,559 INFO L470 AbstractCegarLoop]: Abstraction has 747 states and 2278 transitions. [2021-10-05 21:03:18,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:18,559 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 2278 transitions. [2021-10-05 21:03:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:18,562 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:18,562 INFO L512 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-10-05 21:03:18,562 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 21:03:18,562 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:18,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:18,563 INFO L82 PathProgramCache]: Analyzing trace with hash -201523636, now seen corresponding path program 6 times [2021-10-05 21:03:18,563 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:18,563 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409896965] [2021-10-05 21:03:18,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:18,563 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:18,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:18,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409896965] [2021-10-05 21:03:18,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409896965] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:18,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:18,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-05 21:03:18,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852866947] [2021-10-05 21:03:18,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-10-05 21:03:18,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:18,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-10-05 21:03:18,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:03:18,712 INFO L87 Difference]: Start difference. First operand 747 states and 2278 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:19,290 INFO L93 Difference]: Finished difference Result 1196 states and 3639 transitions. [2021-10-05 21:03:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 21:03:19,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:19,295 INFO L225 Difference]: With dead ends: 1196 [2021-10-05 21:03:19,295 INFO L226 Difference]: Without dead ends: 1031 [2021-10-05 21:03:19,296 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 294.1ms TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2021-10-05 21:03:19,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-10-05 21:03:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 714. [2021-10-05 21:03:19,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 713 states have (on average 3.065918653576438) internal successors, (2186), 713 states have internal predecessors, (2186), 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-10-05 21:03:19,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 2186 transitions. [2021-10-05 21:03:19,324 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 2186 transitions. Word has length 24 [2021-10-05 21:03:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:19,324 INFO L470 AbstractCegarLoop]: Abstraction has 714 states and 2186 transitions. [2021-10-05 21:03:19,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 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-10-05 21:03:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 2186 transitions. [2021-10-05 21:03:19,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:19,328 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:19,328 INFO L512 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-10-05 21:03:19,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 21:03:19,329 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:19,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:19,329 INFO L82 PathProgramCache]: Analyzing trace with hash 285119696, now seen corresponding path program 7 times [2021-10-05 21:03:19,330 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:19,330 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337626413] [2021-10-05 21:03:19,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:19,330 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:19,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:19,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337626413] [2021-10-05 21:03:19,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337626413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:19,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:19,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:03:19,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195954537] [2021-10-05 21:03:19,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 21:03:19,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:19,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 21:03:19,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:03:19,465 INFO L87 Difference]: Start difference. First operand 714 states and 2186 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-10-05 21:03:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:19,736 INFO L93 Difference]: Finished difference Result 945 states and 2833 transitions. [2021-10-05 21:03:19,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 21:03:19,736 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:19,741 INFO L225 Difference]: With dead ends: 945 [2021-10-05 21:03:19,741 INFO L226 Difference]: Without dead ends: 806 [2021-10-05 21:03:19,741 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 135.8ms TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:03:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2021-10-05 21:03:19,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 693. [2021-10-05 21:03:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 3.0736994219653178) internal successors, (2127), 692 states have internal predecessors, (2127), 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-10-05 21:03:19,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 2127 transitions. [2021-10-05 21:03:19,768 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 2127 transitions. Word has length 24 [2021-10-05 21:03:19,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:19,769 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 2127 transitions. [2021-10-05 21:03:19,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 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-10-05 21:03:19,769 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 2127 transitions. [2021-10-05 21:03:19,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-05 21:03:19,772 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:19,772 INFO L512 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-10-05 21:03:19,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 21:03:19,773 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:19,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1983125644, now seen corresponding path program 8 times [2021-10-05 21:03:19,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:19,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246330122] [2021-10-05 21:03:19,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:19,775 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:19,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-05 21:03:19,914 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:19,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246330122] [2021-10-05 21:03:19,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246330122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:19,915 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:19,915 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 21:03:19,915 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669458805] [2021-10-05 21:03:19,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-10-05 21:03:19,916 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:19,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-10-05 21:03:19,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-10-05 21:03:19,917 INFO L87 Difference]: Start difference. First operand 693 states and 2127 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-10-05 21:03:20,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:20,237 INFO L93 Difference]: Finished difference Result 826 states and 2479 transitions. [2021-10-05 21:03:20,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-05 21:03:20,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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) Word has length 24 [2021-10-05 21:03:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:20,240 INFO L225 Difference]: With dead ends: 826 [2021-10-05 21:03:20,240 INFO L226 Difference]: Without dead ends: 687 [2021-10-05 21:03:20,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 151.6ms TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2021-10-05 21:03:20,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-10-05 21:03:20,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 629. [2021-10-05 21:03:20,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 3.071656050955414) internal successors, (1929), 628 states have internal predecessors, (1929), 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-10-05 21:03:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1929 transitions. [2021-10-05 21:03:20,260 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1929 transitions. Word has length 24 [2021-10-05 21:03:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:20,261 INFO L470 AbstractCegarLoop]: Abstraction has 629 states and 1929 transitions. [2021-10-05 21:03:20,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 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-10-05 21:03:20,261 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1929 transitions. [2021-10-05 21:03:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-05 21:03:20,264 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:20,264 INFO L512 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] [2021-10-05 21:03:20,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 21:03:20,264 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:20,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:20,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1647607852, now seen corresponding path program 1 times [2021-10-05 21:03:20,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:20,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362090898] [2021-10-05 21:03:20,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:20,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:20,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:20,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:20,285 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362090898] [2021-10-05 21:03:20,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362090898] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:20,286 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:20,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-05 21:03:20,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075636408] [2021-10-05 21:03:20,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 21:03:20,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:20,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 21:03:20,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 21:03:20,288 INFO L87 Difference]: Start difference. First operand 629 states and 1929 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-05 21:03:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:20,297 INFO L93 Difference]: Finished difference Result 337 states and 926 transitions. [2021-10-05 21:03:20,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 21:03:20,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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) Word has length 25 [2021-10-05 21:03:20,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:20,299 INFO L225 Difference]: With dead ends: 337 [2021-10-05 21:03:20,300 INFO L226 Difference]: Without dead ends: 321 [2021-10-05 21:03:20,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 21:03:20,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2021-10-05 21:03:20,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2021-10-05 21:03:20,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 2.76875) internal successors, (886), 320 states have internal predecessors, (886), 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-10-05 21:03:20,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 886 transitions. [2021-10-05 21:03:20,309 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 886 transitions. Word has length 25 [2021-10-05 21:03:20,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:20,310 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 886 transitions. [2021-10-05 21:03:20,310 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-10-05 21:03:20,310 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 886 transitions. [2021-10-05 21:03:20,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-05 21:03:20,316 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:03:20,316 INFO L512 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] [2021-10-05 21:03:20,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 21:03:20,316 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 21:03:20,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:03:20,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1143689406, now seen corresponding path program 1 times [2021-10-05 21:03:20,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:03:20,318 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161086238] [2021-10-05 21:03:20,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:03:20,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:03:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:03:20,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:03:20,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:03:20,339 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161086238] [2021-10-05 21:03:20,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161086238] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:03:20,339 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:03:20,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-05 21:03:20,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386810337] [2021-10-05 21:03:20,340 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-05 21:03:20,340 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:03:20,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-05 21:03:20,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 21:03:20,341 INFO L87 Difference]: Start difference. First operand 321 states and 886 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10-05 21:03:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:03:20,348 INFO L93 Difference]: Finished difference Result 101 states and 220 transitions. [2021-10-05 21:03:20,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-05 21:03:20,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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) Word has length 26 [2021-10-05 21:03:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:03:20,349 INFO L225 Difference]: With dead ends: 101 [2021-10-05 21:03:20,349 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 21:03:20,349 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-05 21:03:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 21:03:20,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 21:03:20,350 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-10-05 21:03:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 21:03:20,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2021-10-05 21:03:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:03:20,350 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 21:03:20,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-10-05 21:03:20,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 21:03:20,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 21:03:20,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 21:03:20,356 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 21:03:20,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 21:03:20,359 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 21:03:20,359 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 21:03:20,364 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 21:03:20,365 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 21:03:20,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 09:03:20 BasicIcfg [2021-10-05 21:03:20,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 21:03:20,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 21:03:20,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 21:03:20,370 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 21:03:20,371 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:02:50" (3/4) ... [2021-10-05 21:03:20,375 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 21:03:20,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 21:03:20,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 21:03:20,384 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 21:03:20,393 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2021-10-05 21:03:20,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 21:03:20,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:03:20,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 21:03:20,462 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 21:03:20,462 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 21:03:20,465 INFO L168 Benchmark]: Toolchain (without parser) took 31531.88 ms. Allocated memory was 46.1 MB in the beginning and 211.8 MB in the end (delta: 165.7 MB). Free memory was 31.7 MB in the beginning and 177.2 MB in the end (delta: -145.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,466 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 37.7 MB. Free memory was 23.7 MB in the beginning and 23.6 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:03:20,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 322.12 ms. Allocated memory is still 46.1 MB. Free memory was 31.4 MB in the beginning and 30.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,468 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.48 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 28.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,468 INFO L168 Benchmark]: Boogie Preprocessor took 75.71 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 26.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,468 INFO L168 Benchmark]: RCFGBuilder took 697.67 ms. Allocated memory is still 46.1 MB. Free memory was 26.7 MB in the beginning and 21.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,469 INFO L168 Benchmark]: TraceAbstraction took 30255.04 ms. Allocated memory was 46.1 MB in the beginning and 211.8 MB in the end (delta: 165.7 MB). Free memory was 20.6 MB in the beginning and 180.3 MB in the end (delta: -159.7 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,469 INFO L168 Benchmark]: Witness Printer took 92.67 ms. Allocated memory is still 211.8 MB. Free memory was 180.3 MB in the beginning and 177.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:03:20,473 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 37.7 MB. Free memory was 23.7 MB in the beginning and 23.6 MB in the end (delta: 56.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 322.12 ms. Allocated memory is still 46.1 MB. Free memory was 31.4 MB in the beginning and 30.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 11.2 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 70.48 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 28.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.71 ms. Allocated memory is still 46.1 MB. Free memory was 28.2 MB in the beginning and 26.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 697.67 ms. Allocated memory is still 46.1 MB. Free memory was 26.7 MB in the beginning and 21.1 MB in the end (delta: 5.6 MB). Peak memory consumption was 7.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 30255.04 ms. Allocated memory was 46.1 MB in the beginning and 211.8 MB in the end (delta: 165.7 MB). Free memory was 20.6 MB in the beginning and 180.3 MB in the end (delta: -159.7 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Witness Printer took 92.67 ms. Allocated memory is still 211.8 MB. Free memory was 180.3 MB in the beginning and 177.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8829.7ms, 171 PlacesBefore, 43 PlacesAfterwards, 174 TransitionsBefore, 38 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 8 FixpointIterations, 100 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 12 TrivialYvCompositions, 9 ConcurrentYvCompositions, 8 ChoiceCompositions, 161 TotalNumberOfCompositions, 5570 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3604, positive: 3397, positive conditional: 0, positive unconditional: 3397, negative: 207, negative conditional: 0, negative unconditional: 207, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1571, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1571, positive: 1518, positive conditional: 0, positive unconditional: 1518, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 53, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 53, negative conditional: 0, negative unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 141, positive: 0, positive conditional: 0, positive unconditional: 0, negative: 141, negative conditional: 0, negative unconditional: 141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3604, positive: 1879, positive conditional: 0, positive unconditional: 1879, negative: 154, negative conditional: 0, negative unconditional: 154, unknown: 1571, unknown conditional: 0, unknown unconditional: 1571] , Statistics on independence cache: Total cache size (in pairs): 248, Positive cache size: 227, Positive conditional cache size: 0, Positive unconditional cache size: 227, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 97]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 205 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 29991.1ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 113.3ms, AutomataDifference: 14972.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8961.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1536 SDtfs, 6009 SDslu, 6039 SDs, 0 SdLazy, 8740 SolverSat, 606 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6327.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 657 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3963 ImplicationChecksByTransitivity, 6963.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=875occurred in iteration=7, InterpolantAutomatonStates: 544, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1089.7ms AutomataMinimizationTime, 27 MinimizatonAttempts, 15985 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 82.9ms SsaConstructionTime, 924.8ms SatisfiabilityAnalysisTime, 3445.7ms InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 607 ConstructedInterpolants, 0 QuantifiedInterpolants, 5783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 21:03:20,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...