./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/lamport.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/lamport.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 1cd4aca3a270639cd11d82d8339f6f913db7e3cc ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-04 18:44:22,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-04 18:44:22,117 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-04 18:44:22,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-04 18:44:22,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-04 18:44:22,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-04 18:44:22,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-04 18:44:22,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-04 18:44:22,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-04 18:44:22,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-04 18:44:22,171 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-04 18:44:22,172 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-04 18:44:22,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-04 18:44:22,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-04 18:44:22,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-04 18:44:22,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-04 18:44:22,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-04 18:44:22,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-04 18:44:22,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-04 18:44:22,185 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-04 18:44:22,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-04 18:44:22,189 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-04 18:44:22,190 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-04 18:44:22,191 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-04 18:44:22,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-04 18:44:22,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-04 18:44:22,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-04 18:44:22,197 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-04 18:44:22,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-04 18:44:22,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-04 18:44:22,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-04 18:44:22,200 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-04 18:44:22,201 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-04 18:44:22,202 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-04 18:44:22,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-04 18:44:22,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-04 18:44:22,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-04 18:44:22,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-04 18:44:22,206 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-04 18:44:22,207 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-04 18:44:22,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-04 18:44:22,209 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-04 18:44:22,260 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-04 18:44:22,263 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-04 18:44:22,264 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-04 18:44:22,265 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-04 18:44:22,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-04 18:44:22,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-04 18:44:22,269 INFO L138 SettingsManager]: * Use SBE=true [2021-10-04 18:44:22,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-04 18:44:22,269 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-04 18:44:22,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-04 18:44:22,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-04 18:44:22,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-04 18:44:22,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-04 18:44:22,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-04 18:44:22,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-04 18:44:22,272 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-04 18:44:22,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-04 18:44:22,273 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-04 18:44:22,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-04 18:44:22,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-04 18:44:22,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-04 18:44:22,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-04 18:44:22,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:44:22,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-04 18:44:22,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-04 18:44:22,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-04 18:44:22,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-04 18:44:22,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-04 18:44:22,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-04 18:44:22,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-04 18:44:22,276 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 -> 1cd4aca3a270639cd11d82d8339f6f913db7e3cc [2021-10-04 18:44:22,724 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-04 18:44:22,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-04 18:44:22,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-04 18:44:22,760 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-04 18:44:22,761 INFO L275 PluginConnector]: CDTParser initialized [2021-10-04 18:44:22,762 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-04 18:44:22,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9072509c/ef954cc8fea440c2a41f7dabf0094ddc/FLAGb3aec27e1 [2021-10-04 18:44:23,468 INFO L306 CDTParser]: Found 1 translation units. [2021-10-04 18:44:23,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-04 18:44:23,469 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:44:23,469 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2021-10-04 18:44:23,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9072509c/ef954cc8fea440c2a41f7dabf0094ddc/FLAGb3aec27e1 [2021-10-04 18:44:23,788 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/b9072509c/ef954cc8fea440c2a41f7dabf0094ddc [2021-10-04 18:44:23,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-04 18:44:23,799 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-04 18:44:23,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-04 18:44:23,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-04 18:44:23,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-04 18:44:23,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:44:23" (1/1) ... [2021-10-04 18:44:23,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36f4af65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:23, skipping insertion in model container [2021-10-04 18:44:23,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.10 06:44:23" (1/1) ... [2021-10-04 18:44:23,817 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-04 18:44:23,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-04 18:44:23,994 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:44:24,043 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/lamport.wvr.c[1729,1742] [2021-10-04 18:44:24,055 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:44:24,065 INFO L203 MainTranslator]: Completed pre-run [2021-10-04 18:44:24,077 WARN L612 FunctionHandler]: implicit declaration of function assert [2021-10-04 18:44:24,092 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/lamport.wvr.c[1729,1742] [2021-10-04 18:44:24,095 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-04 18:44:24,115 INFO L208 MainTranslator]: Completed translation [2021-10-04 18:44:24,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24 WrapperNode [2021-10-04 18:44:24,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-04 18:44:24,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-04 18:44:24,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-04 18:44:24,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-04 18:44:24,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,169 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-04 18:44:24,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-04 18:44:24,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-04 18:44:24,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-04 18:44:24,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,185 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,185 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,201 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-04 18:44:24,220 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-04 18:44:24,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-04 18:44:24,220 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-04 18:44:24,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (1/1) ... [2021-10-04 18:44:24,229 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-04 18:44:24,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-04 18:44:24,257 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-04 18:44:24,277 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-04 18:44:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-04 18:44:24,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-04 18:44:24,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-04 18:44:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-04 18:44:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-04 18:44:24,319 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-04 18:44:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-04 18:44:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-04 18:44:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-04 18:44:24,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-04 18:44:24,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-04 18:44:24,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-04 18:44:24,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-04 18:44:24,322 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-04 18:44:24,816 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-04 18:44:24,820 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-10-04 18:44:24,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:44:24 BoogieIcfgContainer [2021-10-04 18:44:24,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-04 18:44:24,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-04 18:44:24,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-04 18:44:24,833 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-04 18:44:24,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.10 06:44:23" (1/3) ... [2021-10-04 18:44:24,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced5bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:44:24, skipping insertion in model container [2021-10-04 18:44:24,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.10 06:44:24" (2/3) ... [2021-10-04 18:44:24,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ced5bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 06:44:24, skipping insertion in model container [2021-10-04 18:44:24,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:44:24" (3/3) ... [2021-10-04 18:44:24,836 INFO L111 eAbstractionObserver]: Analyzing ICFG lamport.wvr.c [2021-10-04 18:44:24,841 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-04 18:44:24,842 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-04 18:44:24,842 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-04 18:44:24,842 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-04 18:44:24,884 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,884 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,885 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,885 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,885 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,885 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,886 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,886 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,886 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,886 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,887 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,887 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,887 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,888 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,888 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,888 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,888 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,889 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,889 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,890 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,890 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,890 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,891 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,891 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,891 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,891 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,891 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,892 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,892 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,892 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,892 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,892 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,893 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,894 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,894 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,894 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,894 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,894 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,895 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,895 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,895 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,895 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,895 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,898 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,899 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,899 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,900 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,900 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,900 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,900 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,901 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,902 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,904 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,904 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,905 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,905 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,905 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,905 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,906 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,907 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,907 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,907 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,907 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,909 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,910 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,910 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,910 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,911 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,911 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,912 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,913 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,915 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,915 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,916 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,916 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,917 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,918 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,920 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,921 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,921 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,921 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,922 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,923 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,923 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,923 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,923 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,924 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,924 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,925 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,926 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,926 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,926 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,927 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,928 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,934 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~mem1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,935 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,940 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,941 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,941 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,944 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,944 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,945 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,945 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,945 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,945 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-04 18:44:24,969 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-04 18:44:25,044 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-04 18:44:25,057 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-04 18:44:25,057 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-04 18:44:25,108 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-04 18:44:25,122 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 200 transitions, 424 flow [2021-10-04 18:44:25,125 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 200 transitions, 424 flow [2021-10-04 18:44:25,127 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 197 places, 200 transitions, 424 flow [2021-10-04 18:44:25,272 INFO L129 PetriNetUnfolder]: 13/197 cut-off events. [2021-10-04 18:44:25,272 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-04 18:44:25,281 INFO L84 FinitePrefix]: Finished finitePrefix Result has 210 conditions, 197 events. 13/197 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 203 event pairs, 0 based on Foata normal form. 0/183 useless extension candidates. Maximal degree in co-relation 160. Up to 2 conditions per place. [2021-10-04 18:44:25,290 INFO L116 LiptonReduction]: Number of co-enabled transitions 5124 [2021-10-04 18:44:31,378 INFO L131 LiptonReduction]: Checked pairs total: 18150 [2021-10-04 18:44:31,379 INFO L133 LiptonReduction]: Total number of compositions: 210 [2021-10-04 18:44:31,390 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2021-10-04 18:44:31,474 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 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-04 18:44:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 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-04 18:44:31,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-04 18:44:31,518 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:31,519 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:31,519 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-04 18:44:31,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:31,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1531429469, now seen corresponding path program 1 times [2021-10-04 18:44:31,536 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:31,536 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684809178] [2021-10-04 18:44:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:31,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:31,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:31,765 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-04 18:44:31,766 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:31,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684809178] [2021-10-04 18:44:31,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684809178] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:31,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:31,768 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-04 18:44:31,769 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614965558] [2021-10-04 18:44:31,775 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-04 18:44:31,775 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:31,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-04 18:44:31,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-04 18:44:31,798 INFO L87 Difference]: Start difference. First operand has 945 states, 944 states have (on average 3.093220338983051) internal successors, (2920), 944 states have internal predecessors, (2920), 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 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-04 18:44:31,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:31,839 INFO L93 Difference]: Finished difference Result 945 states and 2622 transitions. [2021-10-04 18:44:31,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-04 18:44:31,840 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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 19 [2021-10-04 18:44:31,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:31,881 INFO L225 Difference]: With dead ends: 945 [2021-10-04 18:44:31,881 INFO L226 Difference]: Without dead ends: 945 [2021-10-04 18:44:31,882 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-04 18:44:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-10-04 18:44:32,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-10-04 18:44:32,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.777542372881356) internal successors, (2622), 944 states have internal predecessors, (2622), 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-04 18:44:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2622 transitions. [2021-10-04 18:44:32,034 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2622 transitions. Word has length 19 [2021-10-04 18:44:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:32,035 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2622 transitions. [2021-10-04 18:44:32,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 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-04 18:44:32,037 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2622 transitions. [2021-10-04 18:44:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:32,043 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:32,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:32,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-04 18:44:32,044 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-04 18:44:32,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash 647006068, now seen corresponding path program 1 times [2021-10-04 18:44:32,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:32,046 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280392746] [2021-10-04 18:44:32,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:32,046 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:32,535 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-04 18:44:32,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:32,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280392746] [2021-10-04 18:44:32,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280392746] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:32,537 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:32,537 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:32,537 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225812343] [2021-10-04 18:44:32,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:32,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:32,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:32,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:32,549 INFO L87 Difference]: Start difference. First operand 945 states and 2622 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:33,144 INFO L93 Difference]: Finished difference Result 1378 states and 3726 transitions. [2021-10-04 18:44:33,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:33,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:33,155 INFO L225 Difference]: With dead ends: 1378 [2021-10-04 18:44:33,156 INFO L226 Difference]: Without dead ends: 1279 [2021-10-04 18:44:33,157 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 213.3ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:33,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states. [2021-10-04 18:44:33,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1075. [2021-10-04 18:44:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1075 states, 1074 states have (on average 2.7476722532588456) internal successors, (2951), 1074 states have internal predecessors, (2951), 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-04 18:44:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2951 transitions. [2021-10-04 18:44:33,204 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2951 transitions. Word has length 37 [2021-10-04 18:44:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:33,205 INFO L470 AbstractCegarLoop]: Abstraction has 1075 states and 2951 transitions. [2021-10-04 18:44:33,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2951 transitions. [2021-10-04 18:44:33,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:33,210 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:33,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:33,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-04 18:44:33,211 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-04 18:44:33,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2075511054, now seen corresponding path program 2 times [2021-10-04 18:44:33,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:33,212 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898339407] [2021-10-04 18:44:33,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:33,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:33,507 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-04 18:44:33,507 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:33,508 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898339407] [2021-10-04 18:44:33,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898339407] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:33,508 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:33,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:33,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603351844] [2021-10-04 18:44:33,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:33,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:33,510 INFO L87 Difference]: Start difference. First operand 1075 states and 2951 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:33,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:33,992 INFO L93 Difference]: Finished difference Result 1334 states and 3631 transitions. [2021-10-04 18:44:33,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:44:33,994 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:33,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:34,005 INFO L225 Difference]: With dead ends: 1334 [2021-10-04 18:44:34,005 INFO L226 Difference]: Without dead ends: 1263 [2021-10-04 18:44:34,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 226.3ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:44:34,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2021-10-04 18:44:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1103. [2021-10-04 18:44:34,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 1102 states have (on average 2.7395644283121596) internal successors, (3019), 1102 states have internal predecessors, (3019), 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-04 18:44:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 3019 transitions. [2021-10-04 18:44:34,048 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 3019 transitions. Word has length 37 [2021-10-04 18:44:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:34,049 INFO L470 AbstractCegarLoop]: Abstraction has 1103 states and 3019 transitions. [2021-10-04 18:44:34,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 3019 transitions. [2021-10-04 18:44:34,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:34,054 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:34,054 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:34,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-04 18:44:34,054 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-04 18:44:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash -339122262, now seen corresponding path program 3 times [2021-10-04 18:44:34,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:34,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971344678] [2021-10-04 18:44:34,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:34,056 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:34,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-04 18:44:34,340 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:34,340 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971344678] [2021-10-04 18:44:34,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971344678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:34,341 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:34,341 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:34,341 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930041457] [2021-10-04 18:44:34,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:34,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:34,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:34,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:34,343 INFO L87 Difference]: Start difference. First operand 1103 states and 3019 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:34,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:34,782 INFO L93 Difference]: Finished difference Result 1298 states and 3521 transitions. [2021-10-04 18:44:34,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:34,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:34,792 INFO L225 Difference]: With dead ends: 1298 [2021-10-04 18:44:34,792 INFO L226 Difference]: Without dead ends: 1249 [2021-10-04 18:44:34,793 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 205.7ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2021-10-04 18:44:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1089. [2021-10-04 18:44:34,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1089 states, 1088 states have (on average 2.7371323529411766) internal successors, (2978), 1088 states have internal predecessors, (2978), 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-04 18:44:34,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 2978 transitions. [2021-10-04 18:44:34,836 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 2978 transitions. Word has length 37 [2021-10-04 18:44:34,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:34,841 INFO L470 AbstractCegarLoop]: Abstraction has 1089 states and 2978 transitions. [2021-10-04 18:44:34,841 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 2978 transitions. [2021-10-04 18:44:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:34,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:34,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:34,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-04 18:44:34,847 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-04 18:44:34,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:34,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1600942060, now seen corresponding path program 4 times [2021-10-04 18:44:34,849 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:34,849 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293775057] [2021-10-04 18:44:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:34,849 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:35,131 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-04 18:44:35,131 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:35,132 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293775057] [2021-10-04 18:44:35,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293775057] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:35,132 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:35,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:35,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841766358] [2021-10-04 18:44:35,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:35,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:35,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:35,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:35,134 INFO L87 Difference]: Start difference. First operand 1089 states and 2978 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:35,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:35,539 INFO L93 Difference]: Finished difference Result 1292 states and 3497 transitions. [2021-10-04 18:44:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:35,540 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:35,548 INFO L225 Difference]: With dead ends: 1292 [2021-10-04 18:44:35,548 INFO L226 Difference]: Without dead ends: 1134 [2021-10-04 18:44:35,549 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 194.1ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:35,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2021-10-04 18:44:35,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 974. [2021-10-04 18:44:35,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 973 states have (on average 2.760534429599178) internal successors, (2686), 973 states have internal predecessors, (2686), 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-04 18:44:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 2686 transitions. [2021-10-04 18:44:35,595 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 2686 transitions. Word has length 37 [2021-10-04 18:44:35,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:35,596 INFO L470 AbstractCegarLoop]: Abstraction has 974 states and 2686 transitions. [2021-10-04 18:44:35,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:35,597 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 2686 transitions. [2021-10-04 18:44:35,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:35,600 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:35,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:35,600 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-04 18:44:35,600 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-04 18:44:35,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:35,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2079251778, now seen corresponding path program 5 times [2021-10-04 18:44:35,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:35,601 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975499741] [2021-10-04 18:44:35,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:35,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:35,809 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-04 18:44:35,809 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:35,810 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975499741] [2021-10-04 18:44:35,810 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975499741] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:35,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:35,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:44:35,811 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571691596] [2021-10-04 18:44:35,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:44:35,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:35,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:44:35,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:44:35,813 INFO L87 Difference]: Start difference. First operand 974 states and 2686 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:36,261 INFO L93 Difference]: Finished difference Result 1229 states and 3268 transitions. [2021-10-04 18:44:36,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:36,271 INFO L225 Difference]: With dead ends: 1229 [2021-10-04 18:44:36,272 INFO L226 Difference]: Without dead ends: 1130 [2021-10-04 18:44:36,272 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 191.3ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:44:36,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-10-04 18:44:36,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 988. [2021-10-04 18:44:36,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 987 states have (on average 2.7426545086119556) internal successors, (2707), 987 states have internal predecessors, (2707), 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-04 18:44:36,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 2707 transitions. [2021-10-04 18:44:36,315 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 2707 transitions. Word has length 37 [2021-10-04 18:44:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:36,316 INFO L470 AbstractCegarLoop]: Abstraction has 988 states and 2707 transitions. [2021-10-04 18:44:36,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 2707 transitions. [2021-10-04 18:44:36,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:36,321 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:36,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:36,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-04 18:44:36,322 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-04 18:44:36,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:36,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1143406056, now seen corresponding path program 6 times [2021-10-04 18:44:36,323 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:36,323 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785268322] [2021-10-04 18:44:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:36,324 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:36,415 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-04 18:44:36,416 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:36,416 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785268322] [2021-10-04 18:44:36,416 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785268322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:36,416 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:36,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:36,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527236831] [2021-10-04 18:44:36,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:36,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:36,419 INFO L87 Difference]: Start difference. First operand 988 states and 2707 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:36,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:36,570 INFO L93 Difference]: Finished difference Result 1742 states and 4682 transitions. [2021-10-04 18:44:36,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:44:36,571 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:36,583 INFO L225 Difference]: With dead ends: 1742 [2021-10-04 18:44:36,584 INFO L226 Difference]: Without dead ends: 1641 [2021-10-04 18:44:36,584 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 88.8ms TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:44:36,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2021-10-04 18:44:36,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1107. [2021-10-04 18:44:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1107 states, 1106 states have (on average 2.7034358047016274) internal successors, (2990), 1106 states have internal predecessors, (2990), 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-04 18:44:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1107 states to 1107 states and 2990 transitions. [2021-10-04 18:44:36,630 INFO L78 Accepts]: Start accepts. Automaton has 1107 states and 2990 transitions. Word has length 37 [2021-10-04 18:44:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:36,631 INFO L470 AbstractCegarLoop]: Abstraction has 1107 states and 2990 transitions. [2021-10-04 18:44:36,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand 1107 states and 2990 transitions. [2021-10-04 18:44:36,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:36,636 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:36,636 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:36,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-04 18:44:36,637 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-04 18:44:36,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:36,638 INFO L82 PathProgramCache]: Analyzing trace with hash -187082926, now seen corresponding path program 7 times [2021-10-04 18:44:36,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:36,638 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117283673] [2021-10-04 18:44:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:36,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:36,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:36,775 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-04 18:44:36,775 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:36,776 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117283673] [2021-10-04 18:44:36,776 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117283673] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:36,776 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:36,776 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:36,777 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302192446] [2021-10-04 18:44:36,777 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:36,777 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:36,779 INFO L87 Difference]: Start difference. First operand 1107 states and 2990 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:37,066 INFO L93 Difference]: Finished difference Result 1516 states and 3878 transitions. [2021-10-04 18:44:37,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:37,066 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:37,077 INFO L225 Difference]: With dead ends: 1516 [2021-10-04 18:44:37,077 INFO L226 Difference]: Without dead ends: 1352 [2021-10-04 18:44:37,078 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 108.0ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2021-10-04 18:44:37,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1092. [2021-10-04 18:44:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 2.692942254812099) internal successors, (2938), 1091 states have internal predecessors, (2938), 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-04 18:44:37,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 2938 transitions. [2021-10-04 18:44:37,123 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 2938 transitions. Word has length 37 [2021-10-04 18:44:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:37,123 INFO L470 AbstractCegarLoop]: Abstraction has 1092 states and 2938 transitions. [2021-10-04 18:44:37,124 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 2938 transitions. [2021-10-04 18:44:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:37,129 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:37,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:37,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-04 18:44:37,130 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-04 18:44:37,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:37,131 INFO L82 PathProgramCache]: Analyzing trace with hash -2046962072, now seen corresponding path program 8 times [2021-10-04 18:44:37,133 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:37,135 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522083377] [2021-10-04 18:44:37,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:37,136 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:37,286 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-04 18:44:37,287 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:37,287 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522083377] [2021-10-04 18:44:37,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522083377] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:37,287 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:37,288 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:37,288 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111095863] [2021-10-04 18:44:37,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:37,289 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:37,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:37,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:37,290 INFO L87 Difference]: Start difference. First operand 1092 states and 2938 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:37,597 INFO L93 Difference]: Finished difference Result 1291 states and 3325 transitions. [2021-10-04 18:44:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:44:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:37,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:37,606 INFO L225 Difference]: With dead ends: 1291 [2021-10-04 18:44:37,606 INFO L226 Difference]: Without dead ends: 1004 [2021-10-04 18:44:37,607 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.8ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:44:37,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1004 states. [2021-10-04 18:44:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1004 to 892. [2021-10-04 18:44:37,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.695847362514029) internal successors, (2402), 891 states have internal predecessors, (2402), 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-04 18:44:37,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2402 transitions. [2021-10-04 18:44:37,642 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2402 transitions. Word has length 37 [2021-10-04 18:44:37,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:37,642 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2402 transitions. [2021-10-04 18:44:37,642 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2402 transitions. [2021-10-04 18:44:37,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:37,646 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:37,646 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:37,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-04 18:44:37,647 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-04 18:44:37,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:37,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1728740606, now seen corresponding path program 9 times [2021-10-04 18:44:37,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:37,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519901004] [2021-10-04 18:44:37,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:37,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:37,859 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-04 18:44:37,863 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:37,864 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519901004] [2021-10-04 18:44:37,864 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519901004] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:37,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:37,865 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:37,865 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606637142] [2021-10-04 18:44:37,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:37,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:37,868 INFO L87 Difference]: Start difference. First operand 892 states and 2402 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:38,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:38,338 INFO L93 Difference]: Finished difference Result 1123 states and 2918 transitions. [2021-10-04 18:44:38,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:38,339 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:38,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:38,347 INFO L225 Difference]: With dead ends: 1123 [2021-10-04 18:44:38,347 INFO L226 Difference]: Without dead ends: 1048 [2021-10-04 18:44:38,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 224.8ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-10-04 18:44:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 892. [2021-10-04 18:44:38,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 891 states have (on average 2.6374859708193044) internal successors, (2350), 891 states have internal predecessors, (2350), 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-04 18:44:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 2350 transitions. [2021-10-04 18:44:38,381 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 2350 transitions. Word has length 37 [2021-10-04 18:44:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:38,382 INFO L470 AbstractCegarLoop]: Abstraction has 892 states and 2350 transitions. [2021-10-04 18:44:38,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 2350 transitions. [2021-10-04 18:44:38,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:38,385 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:38,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:38,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-04 18:44:38,386 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-04 18:44:38,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:38,387 INFO L82 PathProgramCache]: Analyzing trace with hash -156290432, now seen corresponding path program 10 times [2021-10-04 18:44:38,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:38,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187997068] [2021-10-04 18:44:38,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:38,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:38,648 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-04 18:44:38,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:38,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187997068] [2021-10-04 18:44:38,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187997068] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:38,649 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:38,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:38,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981388297] [2021-10-04 18:44:38,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:38,650 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:38,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:38,653 INFO L87 Difference]: Start difference. First operand 892 states and 2350 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:39,122 INFO L93 Difference]: Finished difference Result 1051 states and 2739 transitions. [2021-10-04 18:44:39,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:44:39,123 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:39,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:39,130 INFO L225 Difference]: With dead ends: 1051 [2021-10-04 18:44:39,130 INFO L226 Difference]: Without dead ends: 1016 [2021-10-04 18:44:39,131 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 244.3ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-04 18:44:39,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1016 states. [2021-10-04 18:44:39,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1016 to 904. [2021-10-04 18:44:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 2.629014396456257) internal successors, (2374), 903 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-04 18:44:39,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 2374 transitions. [2021-10-04 18:44:39,169 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 2374 transitions. Word has length 37 [2021-10-04 18:44:39,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:39,169 INFO L470 AbstractCegarLoop]: Abstraction has 904 states and 2374 transitions. [2021-10-04 18:44:39,169 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 2374 transitions. [2021-10-04 18:44:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:39,173 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:39,174 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:39,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-04 18:44:39,174 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-04 18:44:39,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:39,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1580098360, now seen corresponding path program 11 times [2021-10-04 18:44:39,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:39,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026249125] [2021-10-04 18:44:39,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:39,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:39,450 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-04 18:44:39,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:39,451 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026249125] [2021-10-04 18:44:39,451 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026249125] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:39,451 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:39,451 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:39,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459530361] [2021-10-04 18:44:39,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:39,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:39,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:39,453 INFO L87 Difference]: Start difference. First operand 904 states and 2374 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:39,884 INFO L93 Difference]: Finished difference Result 1035 states and 2697 transitions. [2021-10-04 18:44:39,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:39,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:39,892 INFO L225 Difference]: With dead ends: 1035 [2021-10-04 18:44:39,892 INFO L226 Difference]: Without dead ends: 1010 [2021-10-04 18:44:39,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 222.8ms TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2021-10-04 18:44:39,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 898. [2021-10-04 18:44:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 2.629877369007804) internal successors, (2359), 897 states have internal predecessors, (2359), 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-04 18:44:39,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2359 transitions. [2021-10-04 18:44:39,922 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 2359 transitions. Word has length 37 [2021-10-04 18:44:39,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:39,923 INFO L470 AbstractCegarLoop]: Abstraction has 898 states and 2359 transitions. [2021-10-04 18:44:39,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:39,923 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 2359 transitions. [2021-10-04 18:44:39,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:39,927 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:39,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:39,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-04 18:44:39,927 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-04 18:44:39,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:39,928 INFO L82 PathProgramCache]: Analyzing trace with hash 318278562, now seen corresponding path program 12 times [2021-10-04 18:44:39,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:39,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186227637] [2021-10-04 18:44:39,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:39,929 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:39,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:40,140 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-04 18:44:40,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:40,141 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186227637] [2021-10-04 18:44:40,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186227637] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:40,141 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:40,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:40,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676305709] [2021-10-04 18:44:40,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:40,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:40,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:40,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:40,143 INFO L87 Difference]: Start difference. First operand 898 states and 2359 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:40,529 INFO L93 Difference]: Finished difference Result 1033 states and 2689 transitions. [2021-10-04 18:44:40,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:40,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:40,537 INFO L225 Difference]: With dead ends: 1033 [2021-10-04 18:44:40,538 INFO L226 Difference]: Without dead ends: 908 [2021-10-04 18:44:40,538 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 234.8ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-04 18:44:40,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2021-10-04 18:44:40,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 796. [2021-10-04 18:44:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 795 states have (on average 2.657861635220126) internal successors, (2113), 795 states have internal predecessors, (2113), 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-04 18:44:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 2113 transitions. [2021-10-04 18:44:40,569 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 2113 transitions. Word has length 37 [2021-10-04 18:44:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:40,570 INFO L470 AbstractCegarLoop]: Abstraction has 796 states and 2113 transitions. [2021-10-04 18:44:40,579 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:40,580 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 2113 transitions. [2021-10-04 18:44:40,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:40,590 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:40,590 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:40,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-04 18:44:40,590 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-04 18:44:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1149400592, now seen corresponding path program 13 times [2021-10-04 18:44:40,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:40,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209013210] [2021-10-04 18:44:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:40,593 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:40,814 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-04 18:44:40,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:40,814 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209013210] [2021-10-04 18:44:40,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209013210] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:40,814 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:40,815 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:44:40,815 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782154897] [2021-10-04 18:44:40,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:44:40,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:44:40,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:44:40,817 INFO L87 Difference]: Start difference. First operand 796 states and 2113 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:41,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:41,279 INFO L93 Difference]: Finished difference Result 951 states and 2449 transitions. [2021-10-04 18:44:41,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-04 18:44:41,279 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:41,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:41,285 INFO L225 Difference]: With dead ends: 951 [2021-10-04 18:44:41,285 INFO L226 Difference]: Without dead ends: 833 [2021-10-04 18:44:41,287 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 258.3ms TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2021-10-04 18:44:41,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-04 18:44:41,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 701. [2021-10-04 18:44:41,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.7457142857142856) internal successors, (1922), 700 states have internal predecessors, (1922), 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-04 18:44:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1922 transitions. [2021-10-04 18:44:41,313 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1922 transitions. Word has length 37 [2021-10-04 18:44:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:41,313 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1922 transitions. [2021-10-04 18:44:41,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:41,313 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1922 transitions. [2021-10-04 18:44:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:41,316 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:41,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-04 18:44:41,317 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-04 18:44:41,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash -983753494, now seen corresponding path program 14 times [2021-10-04 18:44:41,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:41,317 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407560174] [2021-10-04 18:44:41,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:41,318 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:41,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:41,418 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-04 18:44:41,418 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:41,418 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407560174] [2021-10-04 18:44:41,418 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407560174] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:41,418 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:41,419 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:41,419 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643735784] [2021-10-04 18:44:41,419 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:41,419 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:41,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:41,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:41,420 INFO L87 Difference]: Start difference. First operand 701 states and 1922 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:41,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:41,576 INFO L93 Difference]: Finished difference Result 1679 states and 4612 transitions. [2021-10-04 18:44:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:41,599 INFO L225 Difference]: With dead ends: 1679 [2021-10-04 18:44:41,604 INFO L226 Difference]: Without dead ends: 1535 [2021-10-04 18:44:41,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 95.9ms TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2021-10-04 18:44:41,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2021-10-04 18:44:41,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 725. [2021-10-04 18:44:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 2.729281767955801) internal successors, (1976), 724 states have internal predecessors, (1976), 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-04 18:44:41,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1976 transitions. [2021-10-04 18:44:41,643 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1976 transitions. Word has length 37 [2021-10-04 18:44:41,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:41,644 INFO L470 AbstractCegarLoop]: Abstraction has 725 states and 1976 transitions. [2021-10-04 18:44:41,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:41,644 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1976 transitions. [2021-10-04 18:44:41,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:41,647 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:41,647 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:41,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-04 18:44:41,647 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-04 18:44:41,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:41,648 INFO L82 PathProgramCache]: Analyzing trace with hash 751046400, now seen corresponding path program 15 times [2021-10-04 18:44:41,648 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:41,648 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273639978] [2021-10-04 18:44:41,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:41,649 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:41,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:41,690 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-04 18:44:41,690 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:41,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273639978] [2021-10-04 18:44:41,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273639978] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:41,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:41,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-04 18:44:41,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872928835] [2021-10-04 18:44:41,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-04 18:44:41,695 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:41,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-04 18:44:41,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-04 18:44:41,695 INFO L87 Difference]: Start difference. First operand 725 states and 1976 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04 18:44:41,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:41,719 INFO L93 Difference]: Finished difference Result 773 states and 2060 transitions. [2021-10-04 18:44:41,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-04 18:44:41,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:41,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:41,722 INFO L225 Difference]: With dead ends: 773 [2021-10-04 18:44:41,722 INFO L226 Difference]: Without dead ends: 707 [2021-10-04 18:44:41,722 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-04 18:44:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2021-10-04 18:44:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 707. [2021-10-04 18:44:41,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 2.7138810198300285) internal successors, (1916), 706 states have internal predecessors, (1916), 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-04 18:44:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1916 transitions. [2021-10-04 18:44:41,743 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1916 transitions. Word has length 37 [2021-10-04 18:44:41,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:41,743 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 1916 transitions. [2021-10-04 18:44:41,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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-04 18:44:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1916 transitions. [2021-10-04 18:44:41,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:41,746 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:41,746 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:41,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-04 18:44:41,747 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-04 18:44:41,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:41,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1297468664, now seen corresponding path program 16 times [2021-10-04 18:44:41,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:41,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431722674] [2021-10-04 18:44:41,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:41,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:41,859 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-04 18:44:41,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:41,859 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431722674] [2021-10-04 18:44:41,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431722674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:41,859 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:41,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:41,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909007970] [2021-10-04 18:44:41,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:41,861 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:41,862 INFO L87 Difference]: Start difference. First operand 707 states and 1916 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:41,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:41,957 INFO L93 Difference]: Finished difference Result 887 states and 2384 transitions. [2021-10-04 18:44:41,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:44:41,959 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:41,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:41,961 INFO L225 Difference]: With dead ends: 887 [2021-10-04 18:44:41,961 INFO L226 Difference]: Without dead ends: 699 [2021-10-04 18:44:41,962 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 66.6ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:44:41,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-04 18:44:41,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 687. [2021-10-04 18:44:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 2.717201166180758) internal successors, (1864), 686 states have internal predecessors, (1864), 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-04 18:44:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1864 transitions. [2021-10-04 18:44:41,983 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1864 transitions. Word has length 37 [2021-10-04 18:44:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:41,984 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1864 transitions. [2021-10-04 18:44:41,984 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:41,984 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1864 transitions. [2021-10-04 18:44:41,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:41,986 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:41,987 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:41,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-04 18:44:41,987 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-04 18:44:41,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:41,988 INFO L82 PathProgramCache]: Analyzing trace with hash 2104381174, now seen corresponding path program 17 times [2021-10-04 18:44:41,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:41,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936222583] [2021-10-04 18:44:41,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:41,988 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:42,065 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-04 18:44:42,066 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:42,066 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936222583] [2021-10-04 18:44:42,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936222583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:42,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:42,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:42,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306812332] [2021-10-04 18:44:42,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:42,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:42,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:42,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:42,071 INFO L87 Difference]: Start difference. First operand 687 states and 1864 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:42,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:42,192 INFO L93 Difference]: Finished difference Result 855 states and 2308 transitions. [2021-10-04 18:44:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-04 18:44:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:42,196 INFO L225 Difference]: With dead ends: 855 [2021-10-04 18:44:42,196 INFO L226 Difference]: Without dead ends: 855 [2021-10-04 18:44:42,196 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 76.1ms TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:44:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2021-10-04 18:44:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2021-10-04 18:44:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 854 states have (on average 2.702576112412178) internal successors, (2308), 854 states have internal predecessors, (2308), 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-04 18:44:42,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 2308 transitions. [2021-10-04 18:44:42,225 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 2308 transitions. Word has length 37 [2021-10-04 18:44:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:42,226 INFO L470 AbstractCegarLoop]: Abstraction has 855 states and 2308 transitions. [2021-10-04 18:44:42,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 2308 transitions. [2021-10-04 18:44:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:42,230 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:42,230 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:42,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-04 18:44:42,231 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-04 18:44:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:42,232 INFO L82 PathProgramCache]: Analyzing trace with hash -669127736, now seen corresponding path program 18 times [2021-10-04 18:44:42,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:42,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232549509] [2021-10-04 18:44:42,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:42,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:42,326 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-04 18:44:42,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:42,327 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232549509] [2021-10-04 18:44:42,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232549509] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:42,328 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:42,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-10-04 18:44:42,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994561619] [2021-10-04 18:44:42,329 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:42,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:42,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:42,330 INFO L87 Difference]: Start difference. First operand 855 states and 2308 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:42,449 INFO L93 Difference]: Finished difference Result 861 states and 2314 transitions. [2021-10-04 18:44:42,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:44:42,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:42,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:42,453 INFO L225 Difference]: With dead ends: 861 [2021-10-04 18:44:42,453 INFO L226 Difference]: Without dead ends: 807 [2021-10-04 18:44:42,454 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 86.2ms TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:42,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-04 18:44:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-10-04 18:44:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 806 states have (on average 2.684863523573201) internal successors, (2164), 806 states have internal predecessors, (2164), 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-04 18:44:42,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2164 transitions. [2021-10-04 18:44:42,477 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2164 transitions. Word has length 37 [2021-10-04 18:44:42,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:42,478 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2164 transitions. [2021-10-04 18:44:42,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:42,478 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2164 transitions. [2021-10-04 18:44:42,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:42,481 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:42,481 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:42,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-04 18:44:42,482 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-04 18:44:42,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:42,483 INFO L82 PathProgramCache]: Analyzing trace with hash -401888728, now seen corresponding path program 19 times [2021-10-04 18:44:42,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:42,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188928288] [2021-10-04 18:44:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:42,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:42,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:42,589 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-04 18:44:42,590 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:42,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188928288] [2021-10-04 18:44:42,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188928288] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:42,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:42,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:42,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144865220] [2021-10-04 18:44:42,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:42,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:42,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:42,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:42,593 INFO L87 Difference]: Start difference. First operand 807 states and 2164 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:42,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:42,920 INFO L93 Difference]: Finished difference Result 1024 states and 2603 transitions. [2021-10-04 18:44:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-04 18:44:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:42,924 INFO L225 Difference]: With dead ends: 1024 [2021-10-04 18:44:42,924 INFO L226 Difference]: Without dead ends: 863 [2021-10-04 18:44:42,925 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 143.2ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-04 18:44:42,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-10-04 18:44:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 771. [2021-10-04 18:44:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 771 states, 770 states have (on average 2.6363636363636362) internal successors, (2030), 770 states have internal predecessors, (2030), 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-04 18:44:42,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2030 transitions. [2021-10-04 18:44:42,949 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2030 transitions. Word has length 37 [2021-10-04 18:44:42,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:42,950 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 2030 transitions. [2021-10-04 18:44:42,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:42,950 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2030 transitions. [2021-10-04 18:44:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:42,952 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:42,953 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:42,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-04 18:44:42,953 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-04 18:44:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -3847976, now seen corresponding path program 20 times [2021-10-04 18:44:42,954 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:42,954 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971984013] [2021-10-04 18:44:42,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:42,954 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:43,034 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-04 18:44:43,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:43,034 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971984013] [2021-10-04 18:44:43,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971984013] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:43,034 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:43,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:43,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208520244] [2021-10-04 18:44:43,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:43,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:43,036 INFO L87 Difference]: Start difference. First operand 771 states and 2030 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:43,161 INFO L93 Difference]: Finished difference Result 977 states and 2490 transitions. [2021-10-04 18:44:43,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-04 18:44:43,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:43,164 INFO L225 Difference]: With dead ends: 977 [2021-10-04 18:44:43,165 INFO L226 Difference]: Without dead ends: 833 [2021-10-04 18:44:43,165 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 78.3ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-04 18:44:43,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-10-04 18:44:43,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 759. [2021-10-04 18:44:43,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 759 states, 758 states have (on average 2.6306068601583115) internal successors, (1994), 758 states have internal predecessors, (1994), 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-04 18:44:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1994 transitions. [2021-10-04 18:44:43,188 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1994 transitions. Word has length 37 [2021-10-04 18:44:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:43,189 INFO L470 AbstractCegarLoop]: Abstraction has 759 states and 1994 transitions. [2021-10-04 18:44:43,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1994 transitions. [2021-10-04 18:44:43,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:43,192 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:43,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:43,192 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-04 18:44:43,192 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-04 18:44:43,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -317563146, now seen corresponding path program 21 times [2021-10-04 18:44:43,193 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:43,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972111396] [2021-10-04 18:44:43,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:43,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:43,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:43,273 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-04 18:44:43,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:43,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972111396] [2021-10-04 18:44:43,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972111396] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:43,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:43,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:43,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726232248] [2021-10-04 18:44:43,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-04 18:44:43,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-04 18:44:43,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-04 18:44:43,277 INFO L87 Difference]: Start difference. First operand 759 states and 1994 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:43,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:43,363 INFO L93 Difference]: Finished difference Result 539 states and 1348 transitions. [2021-10-04 18:44:43,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-04 18:44:43,364 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:43,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:43,366 INFO L225 Difference]: With dead ends: 539 [2021-10-04 18:44:43,366 INFO L226 Difference]: Without dead ends: 353 [2021-10-04 18:44:43,366 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:44:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-04 18:44:43,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2021-10-04 18:44:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.4431818181818183) internal successors, (860), 352 states have internal predecessors, (860), 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-04 18:44:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 860 transitions. [2021-10-04 18:44:43,384 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 860 transitions. Word has length 37 [2021-10-04 18:44:43,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:43,384 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 860 transitions. [2021-10-04 18:44:43,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 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-04 18:44:43,384 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 860 transitions. [2021-10-04 18:44:43,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:43,386 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:43,386 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:43,386 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-04 18:44:43,386 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-04 18:44:43,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:43,387 INFO L82 PathProgramCache]: Analyzing trace with hash 230980286, now seen corresponding path program 22 times [2021-10-04 18:44:43,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:43,388 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326876742] [2021-10-04 18:44:43,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:43,388 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:43,480 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-04 18:44:43,481 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:43,481 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326876742] [2021-10-04 18:44:43,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326876742] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:43,481 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:43,481 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:43,482 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245548301] [2021-10-04 18:44:43,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:43,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:43,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:43,483 INFO L87 Difference]: Start difference. First operand 353 states and 860 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:43,689 INFO L93 Difference]: Finished difference Result 491 states and 1195 transitions. [2021-10-04 18:44:43,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:43,691 INFO L225 Difference]: With dead ends: 491 [2021-10-04 18:44:43,691 INFO L226 Difference]: Without dead ends: 438 [2021-10-04 18:44:43,691 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 88.8ms TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:43,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-04 18:44:43,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 428. [2021-10-04 18:44:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.440281030444965) internal successors, (1042), 427 states have internal predecessors, (1042), 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-04 18:44:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1042 transitions. [2021-10-04 18:44:43,703 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1042 transitions. Word has length 37 [2021-10-04 18:44:43,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:43,703 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1042 transitions. [2021-10-04 18:44:43,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:43,704 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1042 transitions. [2021-10-04 18:44:43,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:43,705 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:43,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:43,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-04 18:44:43,706 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-04 18:44:43,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:43,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1648917944, now seen corresponding path program 23 times [2021-10-04 18:44:43,707 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:43,707 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374347739] [2021-10-04 18:44:43,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:43,708 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:43,818 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-04 18:44:43,819 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:43,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374347739] [2021-10-04 18:44:43,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374347739] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:43,819 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:43,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:43,820 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285277784] [2021-10-04 18:44:43,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:43,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:43,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:43,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:43,821 INFO L87 Difference]: Start difference. First operand 428 states and 1042 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:44,062 INFO L93 Difference]: Finished difference Result 460 states and 1097 transitions. [2021-10-04 18:44:44,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:44,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:44,064 INFO L225 Difference]: With dead ends: 460 [2021-10-04 18:44:44,064 INFO L226 Difference]: Without dead ends: 447 [2021-10-04 18:44:44,064 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 115.2ms TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2021-10-04 18:44:44,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 434. [2021-10-04 18:44:44,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.4341801385681294) internal successors, (1054), 433 states have internal predecessors, (1054), 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-04 18:44:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1054 transitions. [2021-10-04 18:44:44,074 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1054 transitions. Word has length 37 [2021-10-04 18:44:44,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:44,075 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1054 transitions. [2021-10-04 18:44:44,075 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,075 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1054 transitions. [2021-10-04 18:44:44,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:44,076 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:44,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:44,077 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-04 18:44:44,077 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-04 18:44:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:44,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1262017724, now seen corresponding path program 24 times [2021-10-04 18:44:44,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:44,078 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30783413] [2021-10-04 18:44:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:44,078 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:44,194 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-04 18:44:44,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:44,195 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30783413] [2021-10-04 18:44:44,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30783413] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:44,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:44,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:44,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832179673] [2021-10-04 18:44:44,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:44,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:44,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:44,197 INFO L87 Difference]: Start difference. First operand 434 states and 1054 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:44,427 INFO L93 Difference]: Finished difference Result 458 states and 1092 transitions. [2021-10-04 18:44:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:44:44,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:44,429 INFO L225 Difference]: With dead ends: 458 [2021-10-04 18:44:44,429 INFO L226 Difference]: Without dead ends: 431 [2021-10-04 18:44:44,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 104.4ms TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-10-04 18:44:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-10-04 18:44:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 430 states have (on average 2.432558139534884) internal successors, (1046), 430 states have internal predecessors, (1046), 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-04 18:44:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1046 transitions. [2021-10-04 18:44:44,440 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1046 transitions. Word has length 37 [2021-10-04 18:44:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:44,440 INFO L470 AbstractCegarLoop]: Abstraction has 431 states and 1046 transitions. [2021-10-04 18:44:44,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1046 transitions. [2021-10-04 18:44:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:44,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:44,442 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:44,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-04 18:44:44,443 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-04 18:44:44,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2049943436, now seen corresponding path program 25 times [2021-10-04 18:44:44,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:44,443 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248746290] [2021-10-04 18:44:44,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:44,444 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:44,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:44,546 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-04 18:44:44,547 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:44,547 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248746290] [2021-10-04 18:44:44,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248746290] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:44,547 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:44,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:44,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792737749] [2021-10-04 18:44:44,549 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:44,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:44,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:44,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:44,550 INFO L87 Difference]: Start difference. First operand 431 states and 1046 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:44,765 INFO L93 Difference]: Finished difference Result 446 states and 1064 transitions. [2021-10-04 18:44:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:44:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:44,768 INFO L225 Difference]: With dead ends: 446 [2021-10-04 18:44:44,768 INFO L226 Difference]: Without dead ends: 371 [2021-10-04 18:44:44,769 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 106.7ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-10-04 18:44:44,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2021-10-04 18:44:44,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2021-10-04 18:44:44,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 370 states have (on average 2.4297297297297296) internal successors, (899), 370 states have internal predecessors, (899), 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-04 18:44:44,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 899 transitions. [2021-10-04 18:44:44,779 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 899 transitions. Word has length 37 [2021-10-04 18:44:44,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:44,780 INFO L470 AbstractCegarLoop]: Abstraction has 371 states and 899 transitions. [2021-10-04 18:44:44,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:44,780 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 899 transitions. [2021-10-04 18:44:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:44,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:44,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:44,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-04 18:44:44,782 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-04 18:44:44,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -331123850, now seen corresponding path program 26 times [2021-10-04 18:44:44,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:44,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796160852] [2021-10-04 18:44:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:44,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:44,878 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-04 18:44:44,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:44,879 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796160852] [2021-10-04 18:44:44,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796160852] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:44,879 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:44,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:44,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114816681] [2021-10-04 18:44:44,880 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:44,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:44,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:44,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:44,882 INFO L87 Difference]: Start difference. First operand 371 states and 899 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:45,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:45,076 INFO L93 Difference]: Finished difference Result 436 states and 1022 transitions. [2021-10-04 18:44:45,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-04 18:44:45,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:45,078 INFO L225 Difference]: With dead ends: 436 [2021-10-04 18:44:45,078 INFO L226 Difference]: Without dead ends: 353 [2021-10-04 18:44:45,079 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 95.8ms TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2021-10-04 18:44:45,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2021-10-04 18:44:45,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 352 states have (on average 2.3920454545454546) internal successors, (842), 352 states have internal predecessors, (842), 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-04 18:44:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 842 transitions. [2021-10-04 18:44:45,088 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 842 transitions. Word has length 37 [2021-10-04 18:44:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:45,089 INFO L470 AbstractCegarLoop]: Abstraction has 353 states and 842 transitions. [2021-10-04 18:44:45,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:45,089 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 842 transitions. [2021-10-04 18:44:45,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:45,091 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:45,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:45,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-04 18:44:45,092 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1287360992, now seen corresponding path program 27 times [2021-10-04 18:44:45,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:45,093 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730116988] [2021-10-04 18:44:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:45,093 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:45,242 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-04 18:44:45,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:45,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730116988] [2021-10-04 18:44:45,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730116988] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:45,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:45,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-04 18:44:45,244 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534230371] [2021-10-04 18:44:45,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-04 18:44:45,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:45,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-04 18:44:45,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-04 18:44:45,245 INFO L87 Difference]: Start difference. First operand 353 states and 842 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:45,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:45,456 INFO L93 Difference]: Finished difference Result 418 states and 965 transitions. [2021-10-04 18:44:45,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:45,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:45,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:45,458 INFO L225 Difference]: With dead ends: 418 [2021-10-04 18:44:45,459 INFO L226 Difference]: Without dead ends: 233 [2021-10-04 18:44:45,459 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 107.4ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-04 18:44:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-04 18:44:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-04 18:44:45,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.2801724137931036) internal successors, (529), 232 states have internal predecessors, (529), 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-04 18:44:45,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 529 transitions. [2021-10-04 18:44:45,466 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 529 transitions. Word has length 37 [2021-10-04 18:44:45,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:45,466 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 529 transitions. [2021-10-04 18:44:45,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 9 states have internal predecessors, (37), 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-04 18:44:45,467 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 529 transitions. [2021-10-04 18:44:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:45,467 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:45,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:45,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2021-10-04 18:44:45,468 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:45,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:45,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1098767552, now seen corresponding path program 28 times [2021-10-04 18:44:45,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:45,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707815055] [2021-10-04 18:44:45,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:45,470 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:45,649 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-04 18:44:45,649 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:45,650 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707815055] [2021-10-04 18:44:45,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707815055] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:45,650 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:45,650 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-04 18:44:45,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961865427] [2021-10-04 18:44:45,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-04 18:44:45,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:45,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-04 18:44:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-04 18:44:45,652 INFO L87 Difference]: Start difference. First operand 233 states and 529 transitions. Second operand has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:45,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:45,958 INFO L93 Difference]: Finished difference Result 244 states and 541 transitions. [2021-10-04 18:44:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-04 18:44:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:45,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:45,959 INFO L225 Difference]: With dead ends: 244 [2021-10-04 18:44:45,959 INFO L226 Difference]: Without dead ends: 217 [2021-10-04 18:44:45,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 196.2ms TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:44:45,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2021-10-04 18:44:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2021-10-04 18:44:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 216 states have (on average 2.287037037037037) internal successors, (494), 216 states have internal predecessors, (494), 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-04 18:44:45,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 494 transitions. [2021-10-04 18:44:45,966 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 494 transitions. Word has length 37 [2021-10-04 18:44:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:45,966 INFO L470 AbstractCegarLoop]: Abstraction has 217 states and 494 transitions. [2021-10-04 18:44:45,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0833333333333335) internal successors, (37), 12 states have internal predecessors, (37), 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-04 18:44:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 494 transitions. [2021-10-04 18:44:45,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:45,967 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:45,968 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:45,968 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-10-04 18:44:45,968 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:45,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:45,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1800438858, now seen corresponding path program 29 times [2021-10-04 18:44:45,969 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:45,969 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54306923] [2021-10-04 18:44:45,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:45,970 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:46,114 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-04 18:44:46,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:46,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54306923] [2021-10-04 18:44:46,115 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54306923] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:46,115 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:46,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:46,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525296438] [2021-10-04 18:44:46,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:46,116 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:46,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:46,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:46,117 INFO L87 Difference]: Start difference. First operand 217 states and 494 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:46,393 INFO L93 Difference]: Finished difference Result 230 states and 509 transitions. [2021-10-04 18:44:46,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:46,394 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:46,395 INFO L225 Difference]: With dead ends: 230 [2021-10-04 18:44:46,395 INFO L226 Difference]: Without dead ends: 213 [2021-10-04 18:44:46,398 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 174.1ms TimeCoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:44:46,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-10-04 18:44:46,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2021-10-04 18:44:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 212 states have (on average 2.2877358490566038) internal successors, (485), 212 states have internal predecessors, (485), 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-04 18:44:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 485 transitions. [2021-10-04 18:44:46,406 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 485 transitions. Word has length 37 [2021-10-04 18:44:46,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:46,406 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 485 transitions. [2021-10-04 18:44:46,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:46,406 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 485 transitions. [2021-10-04 18:44:46,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:46,407 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:46,407 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:46,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-10-04 18:44:46,408 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:46,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1615774442, now seen corresponding path program 30 times [2021-10-04 18:44:46,408 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:46,408 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426784374] [2021-10-04 18:44:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:46,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:46,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:46,550 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-04 18:44:46,551 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:46,551 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426784374] [2021-10-04 18:44:46,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426784374] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:46,551 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:46,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:46,552 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420517323] [2021-10-04 18:44:46,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:46,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:46,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:46,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:46,553 INFO L87 Difference]: Start difference. First operand 213 states and 485 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:46,781 INFO L93 Difference]: Finished difference Result 228 states and 503 transitions. [2021-10-04 18:44:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:46,782 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:46,783 INFO L225 Difference]: With dead ends: 228 [2021-10-04 18:44:46,783 INFO L226 Difference]: Without dead ends: 209 [2021-10-04 18:44:46,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 158.3ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:44:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-04 18:44:46,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-10-04 18:44:46,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.2884615384615383) internal successors, (476), 208 states have internal predecessors, (476), 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-04 18:44:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 476 transitions. [2021-10-04 18:44:46,789 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 476 transitions. Word has length 37 [2021-10-04 18:44:46,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:46,789 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 476 transitions. [2021-10-04 18:44:46,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:46,789 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 476 transitions. [2021-10-04 18:44:46,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:46,790 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:46,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:46,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-10-04 18:44:46,791 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:46,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1382321780, now seen corresponding path program 31 times [2021-10-04 18:44:46,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:46,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471721010] [2021-10-04 18:44:46,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:46,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:46,924 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-04 18:44:46,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:46,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471721010] [2021-10-04 18:44:46,925 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471721010] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:46,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:46,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:46,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240089774] [2021-10-04 18:44:46,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:46,926 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:46,927 INFO L87 Difference]: Start difference. First operand 209 states and 476 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:47,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:47,144 INFO L93 Difference]: Finished difference Result 262 states and 571 transitions. [2021-10-04 18:44:47,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:47,145 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:47,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:47,146 INFO L225 Difference]: With dead ends: 262 [2021-10-04 18:44:47,146 INFO L226 Difference]: Without dead ends: 133 [2021-10-04 18:44:47,146 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 153.4ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:44:47,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-04 18:44:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-04 18:44:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 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-04 18:44:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2021-10-04 18:44:47,151 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 37 [2021-10-04 18:44:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:47,151 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2021-10-04 18:44:47,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:47,152 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2021-10-04 18:44:47,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-04 18:44:47,152 INFO L504 BasicCegarLoop]: Found error trace [2021-10-04 18:44:47,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-04 18:44:47,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2021-10-04 18:44:47,153 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-04 18:44:47,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-04 18:44:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash -420754676, now seen corresponding path program 32 times [2021-10-04 18:44:47,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-04 18:44:47,154 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201243701] [2021-10-04 18:44:47,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-04 18:44:47,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-04 18:44:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-04 18:44:47,289 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-04 18:44:47,290 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-04 18:44:47,290 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201243701] [2021-10-04 18:44:47,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201243701] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-04 18:44:47,290 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-04 18:44:47,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-04 18:44:47,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041285377] [2021-10-04 18:44:47,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-04 18:44:47,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-04 18:44:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-04 18:44:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-04 18:44:47,292 INFO L87 Difference]: Start difference. First operand 133 states and 245 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:47,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-04 18:44:47,486 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2021-10-04 18:44:47,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-04 18:44:47,487 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 37 [2021-10-04 18:44:47,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-04 18:44:47,487 INFO L225 Difference]: With dead ends: 132 [2021-10-04 18:44:47,487 INFO L226 Difference]: Without dead ends: 0 [2021-10-04 18:44:47,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 148.4ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-10-04 18:44:47,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-04 18:44:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-04 18:44:47,489 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-04 18:44:47,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-04 18:44:47,489 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-10-04 18:44:47,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-04 18:44:47,490 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-04 18:44:47,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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-04 18:44:47,490 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-04 18:44:47,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-04 18:44:47,493 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-04 18:44:47,494 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-04 18:44:47,495 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-04 18:44:47,495 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-04 18:44:47,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2021-10-04 18:44:47,501 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-04 18:44:47,502 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-04 18:44:47,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 06:44:47 BasicIcfg [2021-10-04 18:44:47,504 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-04 18:44:47,505 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-04 18:44:47,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-04 18:44:47,506 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-04 18:44:47,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 06:44:24" (3/4) ... [2021-10-04 18:44:47,510 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-04 18:44:47,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-04 18:44:47,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-04 18:44:47,518 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-04 18:44:47,527 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2021-10-04 18:44:47,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-04 18:44:47,528 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-04 18:44:47,595 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-04 18:44:47,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-04 18:44:47,598 INFO L168 Benchmark]: Toolchain (without parser) took 23802.89 ms. Allocated memory was 52.4 MB in the beginning and 161.5 MB in the end (delta: 109.1 MB). Free memory was 28.5 MB in the beginning and 99.2 MB in the end (delta: -70.8 MB). Peak memory consumption was 40.3 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,598 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-04 18:44:47,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.44 ms. Allocated memory is still 52.4 MB. Free memory was 28.1 MB in the beginning and 28.2 MB in the end (delta: -124.2 kB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,600 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.75 ms. Allocated memory is still 52.4 MB. Free memory was 28.2 MB in the beginning and 26.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,600 INFO L168 Benchmark]: Boogie Preprocessor took 48.71 ms. Allocated memory is still 52.4 MB. Free memory was 26.1 MB in the beginning and 36.2 MB in the end (delta: -10.1 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,601 INFO L168 Benchmark]: RCFGBuilder took 604.34 ms. Allocated memory is still 52.4 MB. Free memory was 36.1 MB in the beginning and 31.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,602 INFO L168 Benchmark]: TraceAbstraction took 22678.27 ms. Allocated memory was 52.4 MB in the beginning and 161.5 MB in the end (delta: 109.1 MB). Free memory was 31.5 MB in the beginning and 103.4 MB in the end (delta: -72.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,602 INFO L168 Benchmark]: Witness Printer took 90.62 ms. Allocated memory is still 161.5 MB. Free memory was 103.4 MB in the beginning and 99.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-04 18:44:47,609 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.26 ms. Allocated memory is still 41.9 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.44 ms. Allocated memory is still 52.4 MB. Free memory was 28.1 MB in the beginning and 28.2 MB in the end (delta: -124.2 kB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 52.75 ms. Allocated memory is still 52.4 MB. Free memory was 28.2 MB in the beginning and 26.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 48.71 ms. Allocated memory is still 52.4 MB. Free memory was 26.1 MB in the beginning and 36.2 MB in the end (delta: -10.1 MB). Peak memory consumption was 5.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 604.34 ms. Allocated memory is still 52.4 MB. Free memory was 36.1 MB in the beginning and 31.9 MB in the end (delta: 4.1 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 22678.27 ms. Allocated memory was 52.4 MB in the beginning and 161.5 MB in the end (delta: 109.1 MB). Free memory was 31.5 MB in the beginning and 103.4 MB in the end (delta: -72.0 MB). Peak memory consumption was 36.2 MB. Max. memory is 16.1 GB. * Witness Printer took 90.62 ms. Allocated memory is still 161.5 MB. Free memory was 103.4 MB in the beginning and 99.2 MB in the end (delta: 4.2 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: 6254.4ms, 197 PlacesBefore, 51 PlacesAfterwards, 200 TransitionsBefore, 46 TransitionsAfterwards, 5124 CoEnabledTransitionPairs, 13 FixpointIterations, 97 TrivialSequentialCompositions, 69 ConcurrentSequentialCompositions, 13 TrivialYvCompositions, 23 ConcurrentYvCompositions, 8 ChoiceCompositions, 210 TotalNumberOfCompositions, 18150 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11184, positive: 10648, positive conditional: 0, positive unconditional: 10648, negative: 536, negative conditional: 0, negative unconditional: 536, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4331, positive: 4256, positive conditional: 0, positive unconditional: 4256, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4331, positive: 4221, positive conditional: 0, positive unconditional: 4221, negative: 110, negative conditional: 0, negative unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 110, positive: 35, positive conditional: 0, positive unconditional: 35, negative: 75, negative conditional: 0, negative unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 155, positive: 34, positive conditional: 0, positive unconditional: 34, negative: 121, negative conditional: 0, negative unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 11184, positive: 6392, positive conditional: 0, positive unconditional: 6392, negative: 461, negative conditional: 0, negative unconditional: 461, unknown: 4331, unknown conditional: 0, unknown unconditional: 4331] , Statistics on independence cache: Total cache size (in pairs): 483, Positive cache size: 448, Positive conditional cache size: 0, Positive unconditional cache size: 448, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35 - 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: 91]: 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, 259 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22458.7ms, OverallIterations: 33, TraceHistogramMax: 1, EmptinessCheckTime: 138.5ms, AutomataDifference: 9269.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6416.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2199 SDtfs, 4947 SDslu, 10437 SDs, 0 SdLazy, 8053 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4342.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 569 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 526 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 4596.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1107occurred in iteration=7, InterpolantAutomatonStates: 388, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 913.8ms AutomataMinimizationTime, 33 MinimizatonAttempts, 3367 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 117.8ms SsaConstructionTime, 1145.9ms SatisfiabilityAnalysisTime, 3967.8ms InterpolantComputationTime, 1203 NumberOfCodeBlocks, 1203 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 9565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 0/0 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-04 18:44:47,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...