./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/lamport.wvr.c --full-output -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf --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 22c1a7ba6cef8c4744a9014742d68072d39cb86a -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-POR-NewStatesSleepPersistentFixedOrder-NoLbe-Lockstep.epf .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 22:33:53,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 22:33:53,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 22:33:53,066 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 22:33:53,067 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 22:33:53,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 22:33:53,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 22:33:53,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 22:33:53,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 22:33:53,089 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 22:33:53,090 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 22:33:53,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 22:33:53,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 22:33:53,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 22:33:53,101 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 22:33:53,106 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 22:33:53,108 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 22:33:53,109 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 22:33:53,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 22:33:53,118 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 22:33:53,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 22:33:53,121 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 22:33:53,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 22:33:53,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 22:33:53,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 22:33:53,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 22:33:53,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 22:33:53,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 22:33:53,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 22:33:53,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 22:33:53,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 22:33:53,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 22:33:53,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 22:33:53,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 22:33:53,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 22:33:53,145 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 22:33:53,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 22:33:53,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 22:33:53,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 22:33:53,148 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 22:33:53,149 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 22:33:53,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 22:33:53,201 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 22:33:53,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 22:33:53,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 22:33:53,203 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 22:33:53,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 22:33:53,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 22:33:53,205 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 22:33:53,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 22:33:53,206 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 22:33:53,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 22:33:53,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 22:33:53,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 22:33:53,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 22:33:53,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 22:33:53,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 22:33:53,208 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 22:33:53,208 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 22:33:53,209 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 22:33:53,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 22:33:53,209 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 22:33:53,209 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 22:33:53,209 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 22:33:53,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:33:53,210 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 22:33:53,210 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 22:33:53,210 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 22:33:53,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 22:33:53,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 22:33:53,211 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 22:33:53,211 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 22:33:53,211 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 -> 22c1a7ba6cef8c4744a9014742d68072d39cb86a [2021-10-05 22:33:53,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 22:33:53,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 22:33:53,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 22:33:53,666 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 22:33:53,667 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 22:33:53,668 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-05 22:33:53,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f685dd7b4/02364e47716a4ce9a972bbd7741aa34d/FLAGb738a27a2 [2021-10-05 22:33:54,400 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 22:33:54,401 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/lamport.wvr.c [2021-10-05 22:33:54,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f685dd7b4/02364e47716a4ce9a972bbd7741aa34d/FLAGb738a27a2 [2021-10-05 22:33:54,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/f685dd7b4/02364e47716a4ce9a972bbd7741aa34d [2021-10-05 22:33:54,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 22:33:54,791 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 22:33:54,792 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 22:33:54,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 22:33:54,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 22:33:54,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:33:54" (1/1) ... [2021-10-05 22:33:54,799 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee32581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:54, skipping insertion in model container [2021-10-05 22:33:54,799 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:33:54" (1/1) ... [2021-10-05 22:33:54,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 22:33:54,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 22:33:55,034 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[2722,2735] [2021-10-05 22:33:55,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:33:55,055 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 22:33:55,086 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[2722,2735] [2021-10-05 22:33:55,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 22:33:55,108 INFO L208 MainTranslator]: Completed translation [2021-10-05 22:33:55,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55 WrapperNode [2021-10-05 22:33:55,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 22:33:55,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 22:33:55,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 22:33:55,110 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 22:33:55,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,161 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 22:33:55,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 22:33:55,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 22:33:55,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 22:33:55,172 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,189 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 22:33:55,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 22:33:55,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 22:33:55,196 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 22:33:55,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (1/1) ... [2021-10-05 22:33:55,212 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 22:33:55,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 22:33:55,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 22:33:55,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 22:33:55,318 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 22:33:55,318 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 22:33:55,319 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 22:33:55,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 22:33:55,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2021-10-05 22:33:55,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2021-10-05 22:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 22:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 22:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 22:33:55,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-05 22:33:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 22:33:55,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 22:33:55,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 22:33:55,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 22:33:55,325 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 22:33:55,862 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 22:33:55,863 INFO L299 CfgBuilder]: Removed 29 assume(true) statements. [2021-10-05 22:33:55,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:33:55 BoogieIcfgContainer [2021-10-05 22:33:55,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 22:33:55,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 22:33:55,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 22:33:55,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 22:33:55,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:33:54" (1/3) ... [2021-10-05 22:33:55,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b5f705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:33:55, skipping insertion in model container [2021-10-05 22:33:55,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:33:55" (2/3) ... [2021-10-05 22:33:55,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b5f705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:33:55, skipping insertion in model container [2021-10-05 22:33:55,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:33:55" (3/3) ... [2021-10-05 22:33:55,879 INFO L111 eAbstractionObserver]: Analyzing ICFG lamport.wvr.c [2021-10-05 22:33:55,885 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 22:33:55,885 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 22:33:55,886 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 22:33:55,886 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 22:33:55,943 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,944 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,944 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,944 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,944 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,945 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,945 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,945 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,945 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,946 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,946 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,946 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,946 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,947 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,947 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,947 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,948 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,948 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,948 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,962 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,962 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,963 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,963 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,963 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,963 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,964 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,964 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,964 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,965 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,965 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,966 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,966 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,966 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,967 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,967 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,967 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,967 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,968 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,968 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,968 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,968 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,969 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,969 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,970 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,970 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,970 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,971 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,971 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,971 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,971 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,972 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,972 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,972 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,972 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,973 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,973 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,973 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,974 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,974 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,974 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,974 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,975 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,975 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,975 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,976 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,976 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,976 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,976 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,977 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,978 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,978 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,978 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,978 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,979 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,979 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,979 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,979 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,980 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,980 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,980 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,980 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,981 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,981 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,981 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,982 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,982 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,982 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,983 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,983 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,983 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,984 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,984 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,984 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,984 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,985 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,987 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,988 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,988 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,988 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,989 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,990 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,990 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,990 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,990 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,991 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,994 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,994 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,994 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,994 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:55,994 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,001 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,001 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,001 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,002 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,003 WARN L313 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,003 WARN L313 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,010 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,011 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,011 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,012 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,012 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,014 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,015 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork2_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,015 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,016 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 22:33:56,025 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2021-10-05 22:33:56,075 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 22:33:56,084 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-05 22:33:56,084 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-10-05 22:33:56,105 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 22:33:56,117 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 204 transitions, 432 flow [2021-10-05 22:33:56,123 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 204 transitions, 432 flow [2021-10-05 22:33:56,126 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 201 places, 204 transitions, 432 flow [2021-10-05 22:33:56,305 INFO L129 PetriNetUnfolder]: 13/201 cut-off events. [2021-10-05 22:33:56,305 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-10-05 22:33:56,312 INFO L84 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 201 events. 13/201 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 204 event pairs, 0 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 164. Up to 2 conditions per place. [2021-10-05 22:33:56,318 INFO L116 LiptonReduction]: Number of co-enabled transitions 5124 [2021-10-05 22:34:05,329 INFO L131 LiptonReduction]: Checked pairs total: 16438 [2021-10-05 22:34:05,329 INFO L133 LiptonReduction]: Total number of compositions: 206 [2021-10-05 22:34:05,340 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 51 places, 46 transitions, 116 flow [2021-10-05 22:34:05,423 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-05 22:34:05,429 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-05 22:34:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-05 22:34:05,460 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:05,461 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-05 22:34:05,462 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:05,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1829567922, now seen corresponding path program 1 times [2021-10-05 22:34:05,477 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:05,478 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645165099] [2021-10-05 22:34:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:05,479 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:05,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:05,692 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645165099] [2021-10-05 22:34:05,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645165099] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:05,693 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:05,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 22:34:05,695 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061237992] [2021-10-05 22:34:05,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 22:34:05,701 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:05,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 22:34:05,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 22:34:05,724 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-05 22:34:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:05,763 INFO L93 Difference]: Finished difference Result 945 states and 2622 transitions. [2021-10-05 22:34:05,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 22:34:05,765 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-05 22:34:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:05,804 INFO L225 Difference]: With dead ends: 945 [2021-10-05 22:34:05,805 INFO L226 Difference]: Without dead ends: 945 [2021-10-05 22:34:05,806 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-05 22:34:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-10-05 22:34:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-10-05 22:34:05,933 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-05 22:34:05,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2622 transitions. [2021-10-05 22:34:05,943 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2622 transitions. Word has length 19 [2021-10-05 22:34:05,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:05,944 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2622 transitions. [2021-10-05 22:34:05,944 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-05 22:34:05,946 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2622 transitions. [2021-10-05 22:34:05,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:05,954 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:05,954 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-05 22:34:05,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 22:34:05,955 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:05,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash -518723085, now seen corresponding path program 1 times [2021-10-05 22:34:05,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:05,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58146322] [2021-10-05 22:34:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:05,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:06,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:06,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:06,510 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58146322] [2021-10-05 22:34:06,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58146322] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:06,511 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:06,511 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:06,511 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354170578] [2021-10-05 22:34:06,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:06,512 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:06,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:06,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:06,523 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-05 22:34:07,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:07,097 INFO L93 Difference]: Finished difference Result 1200 states and 3198 transitions. [2021-10-05 22:34:07,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:34:07,098 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-05 22:34:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:07,107 INFO L225 Difference]: With dead ends: 1200 [2021-10-05 22:34:07,108 INFO L226 Difference]: Without dead ends: 1101 [2021-10-05 22:34:07,109 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 244.8ms TimeCoverageRelationStatistics Valid=94, Invalid=412, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:34:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2021-10-05 22:34:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 945. [2021-10-05 22:34:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 944 states have (on average 2.718220338983051) internal successors, (2566), 944 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:07,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2566 transitions. [2021-10-05 22:34:07,149 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2566 transitions. Word has length 37 [2021-10-05 22:34:07,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:07,150 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 2566 transitions. [2021-10-05 22:34:07,150 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-05 22:34:07,151 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2566 transitions. [2021-10-05 22:34:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:07,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:07,155 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-05 22:34:07,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 22:34:07,156 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:07,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:07,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1968724417, now seen corresponding path program 2 times [2021-10-05 22:34:07,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:07,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771780962] [2021-10-05 22:34:07,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:07,158 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:07,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:07,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:07,616 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:07,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771780962] [2021-10-05 22:34:07,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771780962] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:07,617 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:07,617 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:07,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599991286] [2021-10-05 22:34:07,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:07,618 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:07,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:07,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:07,619 INFO L87 Difference]: Start difference. First operand 945 states and 2566 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-05 22:34:08,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:08,140 INFO L93 Difference]: Finished difference Result 1156 states and 3103 transitions. [2021-10-05 22:34:08,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:34:08,141 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-05 22:34:08,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:08,150 INFO L225 Difference]: With dead ends: 1156 [2021-10-05 22:34:08,150 INFO L226 Difference]: Without dead ends: 1085 [2021-10-05 22:34:08,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 287.1ms TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:34:08,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1085 states. [2021-10-05 22:34:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1085 to 973. [2021-10-05 22:34:08,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 972 states have (on average 2.7098765432098766) internal successors, (2634), 972 states have internal predecessors, (2634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:08,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 2634 transitions. [2021-10-05 22:34:08,191 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 2634 transitions. Word has length 37 [2021-10-05 22:34:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:08,191 INFO L470 AbstractCegarLoop]: Abstraction has 973 states and 2634 transitions. [2021-10-05 22:34:08,191 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-05 22:34:08,191 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 2634 transitions. [2021-10-05 22:34:08,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:08,196 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:08,196 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-05 22:34:08,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 22:34:08,196 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:08,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:08,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1498182851, now seen corresponding path program 3 times [2021-10-05 22:34:08,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:08,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907330324] [2021-10-05 22:34:08,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:08,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:08,548 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:08,549 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907330324] [2021-10-05 22:34:08,549 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907330324] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:08,549 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:08,549 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-10-05 22:34:08,549 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251451665] [2021-10-05 22:34:08,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-10-05 22:34:08,550 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-05 22:34:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:34:08,551 INFO L87 Difference]: Start difference. First operand 973 states and 2634 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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-05 22:34:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:09,174 INFO L93 Difference]: Finished difference Result 1120 states and 2993 transitions. [2021-10-05 22:34:09,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-10-05 22:34:09,174 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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-05 22:34:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:09,183 INFO L225 Difference]: With dead ends: 1120 [2021-10-05 22:34:09,183 INFO L226 Difference]: Without dead ends: 1071 [2021-10-05 22:34:09,184 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 337.4ms TimeCoverageRelationStatistics Valid=153, Invalid=603, Unknown=0, NotChecked=0, Total=756 [2021-10-05 22:34:09,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2021-10-05 22:34:09,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 959. [2021-10-05 22:34:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 2.7066805845511483) internal successors, (2593), 958 states have internal predecessors, (2593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 2593 transitions. [2021-10-05 22:34:09,231 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 2593 transitions. Word has length 37 [2021-10-05 22:34:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:09,232 INFO L470 AbstractCegarLoop]: Abstraction has 959 states and 2593 transitions. [2021-10-05 22:34:09,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 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-05 22:34:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 2593 transitions. [2021-10-05 22:34:09,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:09,235 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:09,236 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-05 22:34:09,236 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 22:34:09,236 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:09,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:09,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1443845345, now seen corresponding path program 4 times [2021-10-05 22:34:09,238 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:09,238 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339517788] [2021-10-05 22:34:09,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:09,238 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:09,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:09,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339517788] [2021-10-05 22:34:09,535 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339517788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:09,535 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:09,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:09,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291050911] [2021-10-05 22:34:09,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:09,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:09,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:09,538 INFO L87 Difference]: Start difference. First operand 959 states and 2593 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-05 22:34:10,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:10,030 INFO L93 Difference]: Finished difference Result 1114 states and 2969 transitions. [2021-10-05 22:34:10,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:34:10,030 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-05 22:34:10,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:10,038 INFO L225 Difference]: With dead ends: 1114 [2021-10-05 22:34:10,038 INFO L226 Difference]: Without dead ends: 953 [2021-10-05 22:34:10,039 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 228.3ms TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2021-10-05 22:34:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2021-10-05 22:34:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 841. [2021-10-05 22:34:10,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 841 states, 840 states have (on average 2.732142857142857) internal successors, (2295), 840 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 2295 transitions. [2021-10-05 22:34:10,081 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 2295 transitions. Word has length 37 [2021-10-05 22:34:10,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:10,081 INFO L470 AbstractCegarLoop]: Abstraction has 841 states and 2295 transitions. [2021-10-05 22:34:10,081 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-05 22:34:10,081 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 2295 transitions. [2021-10-05 22:34:10,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:10,086 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:10,086 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-05 22:34:10,086 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 22:34:10,087 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:10,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1774997531, now seen corresponding path program 5 times [2021-10-05 22:34:10,088 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:10,088 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509184062] [2021-10-05 22:34:10,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:10,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:10,203 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:10,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509184062] [2021-10-05 22:34:10,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509184062] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:10,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:10,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:10,206 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997905519] [2021-10-05 22:34:10,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:10,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:10,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:10,210 INFO L87 Difference]: Start difference. First operand 841 states and 2295 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-05 22:34:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:10,344 INFO L93 Difference]: Finished difference Result 1571 states and 4248 transitions. [2021-10-05 22:34:10,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:10,345 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-05 22:34:10,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:10,356 INFO L225 Difference]: With dead ends: 1571 [2021-10-05 22:34:10,356 INFO L226 Difference]: Without dead ends: 1527 [2021-10-05 22:34:10,357 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 66.5ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:34:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2021-10-05 22:34:10,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1001. [2021-10-05 22:34:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 1000 states have (on average 2.711) internal successors, (2711), 1000 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 2711 transitions. [2021-10-05 22:34:10,396 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 2711 transitions. Word has length 37 [2021-10-05 22:34:10,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:10,397 INFO L470 AbstractCegarLoop]: Abstraction has 1001 states and 2711 transitions. [2021-10-05 22:34:10,397 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-05 22:34:10,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 2711 transitions. [2021-10-05 22:34:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:10,401 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:10,401 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-05 22:34:10,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 22:34:10,401 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:10,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:10,402 INFO L82 PathProgramCache]: Analyzing trace with hash 385123147, now seen corresponding path program 6 times [2021-10-05 22:34:10,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:10,403 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789236461] [2021-10-05 22:34:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:10,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:10,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:10,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:10,634 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789236461] [2021-10-05 22:34:10,634 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789236461] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:10,634 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:10,634 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-10-05 22:34:10,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547581087] [2021-10-05 22:34:10,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-10-05 22:34:10,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:10,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-10-05 22:34:10,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:34:10,636 INFO L87 Difference]: Start difference. First operand 1001 states and 2711 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-05 22:34:11,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:11,101 INFO L93 Difference]: Finished difference Result 1260 states and 3286 transitions. [2021-10-05 22:34:11,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-10-05 22:34:11,102 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-05 22:34:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:11,110 INFO L225 Difference]: With dead ends: 1260 [2021-10-05 22:34:11,110 INFO L226 Difference]: Without dead ends: 1107 [2021-10-05 22:34:11,111 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 249.9ms TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2021-10-05 22:34:11,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2021-10-05 22:34:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 985. [2021-10-05 22:34:11,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 984 states have (on average 2.6910569105691056) internal successors, (2648), 984 states have internal predecessors, (2648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 2648 transitions. [2021-10-05 22:34:11,146 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 2648 transitions. Word has length 37 [2021-10-05 22:34:11,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:11,147 INFO L470 AbstractCegarLoop]: Abstraction has 985 states and 2648 transitions. [2021-10-05 22:34:11,147 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-05 22:34:11,147 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 2648 transitions. [2021-10-05 22:34:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:11,151 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:11,151 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-05 22:34:11,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 22:34:11,152 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:11,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash -471075629, now seen corresponding path program 7 times [2021-10-05 22:34:11,152 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:11,153 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379767560] [2021-10-05 22:34:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:11,153 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:11,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:11,281 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:11,282 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379767560] [2021-10-05 22:34:11,282 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379767560] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:11,282 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:11,282 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:11,283 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505404480] [2021-10-05 22:34:11,283 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:11,283 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:11,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:11,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:11,284 INFO L87 Difference]: Start difference. First operand 985 states and 2648 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-05 22:34:11,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:11,571 INFO L93 Difference]: Finished difference Result 1330 states and 3403 transitions. [2021-10-05 22:34:11,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:34:11,572 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-05 22:34:11,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:11,580 INFO L225 Difference]: With dead ends: 1330 [2021-10-05 22:34:11,581 INFO L226 Difference]: Without dead ends: 1165 [2021-10-05 22:34:11,581 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 96.5ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-10-05 22:34:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2021-10-05 22:34:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 969. [2021-10-05 22:34:11,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 968 states have (on average 2.6807851239669422) internal successors, (2595), 968 states have internal predecessors, (2595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 2595 transitions. [2021-10-05 22:34:11,616 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 2595 transitions. Word has length 37 [2021-10-05 22:34:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:11,616 INFO L470 AbstractCegarLoop]: Abstraction has 969 states and 2595 transitions. [2021-10-05 22:34:11,617 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-05 22:34:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 2595 transitions. [2021-10-05 22:34:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:11,620 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:11,621 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-05 22:34:11,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 22:34:11,621 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:11,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:11,622 INFO L82 PathProgramCache]: Analyzing trace with hash -2087158397, now seen corresponding path program 8 times [2021-10-05 22:34:11,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:11,622 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945745346] [2021-10-05 22:34:11,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:11,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:11,737 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:11,737 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945745346] [2021-10-05 22:34:11,737 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945745346] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:11,737 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:11,737 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:11,738 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172730714] [2021-10-05 22:34:11,738 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:11,738 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:11,739 INFO L87 Difference]: Start difference. First operand 969 states and 2595 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-05 22:34:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:12,058 INFO L93 Difference]: Finished difference Result 1104 states and 2849 transitions. [2021-10-05 22:34:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:34:12,058 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-05 22:34:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:12,065 INFO L225 Difference]: With dead ends: 1104 [2021-10-05 22:34:12,065 INFO L226 Difference]: Without dead ends: 813 [2021-10-05 22:34:12,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2021-10-05 22:34:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 701. [2021-10-05 22:34:12,104 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-05 22:34:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1922 transitions. [2021-10-05 22:34:12,107 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1922 transitions. Word has length 37 [2021-10-05 22:34:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:12,108 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1922 transitions. [2021-10-05 22:34:12,108 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-05 22:34:12,108 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1922 transitions. [2021-10-05 22:34:12,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:12,110 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:12,111 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-05 22:34:12,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 22:34:12,111 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:12,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:12,112 INFO L82 PathProgramCache]: Analyzing trace with hash 300715621, now seen corresponding path program 9 times [2021-10-05 22:34:12,112 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:12,112 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432891136] [2021-10-05 22:34:12,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:12,113 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:12,186 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:12,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432891136] [2021-10-05 22:34:12,187 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432891136] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:12,187 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:12,187 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 22:34:12,187 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334668537] [2021-10-05 22:34:12,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 22:34:12,188 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 22:34:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-05 22:34:12,190 INFO L87 Difference]: Start difference. First operand 701 states and 1922 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-05 22:34:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:12,214 INFO L93 Difference]: Finished difference Result 749 states and 2012 transitions. [2021-10-05 22:34:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 22:34:12,215 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-05 22:34:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:12,220 INFO L225 Difference]: With dead ends: 749 [2021-10-05 22:34:12,220 INFO L226 Difference]: Without dead ends: 701 [2021-10-05 22:34:12,220 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-05 22:34:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2021-10-05 22:34:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2021-10-05 22:34:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 701 states, 700 states have (on average 2.72) internal successors, (1904), 700 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:12,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1904 transitions. [2021-10-05 22:34:12,242 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1904 transitions. Word has length 37 [2021-10-05 22:34:12,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:12,243 INFO L470 AbstractCegarLoop]: Abstraction has 701 states and 1904 transitions. [2021-10-05 22:34:12,243 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-05 22:34:12,243 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1904 transitions. [2021-10-05 22:34:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:12,246 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:12,246 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-05 22:34:12,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-05 22:34:12,247 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:12,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:12,248 INFO L82 PathProgramCache]: Analyzing trace with hash 635562123, now seen corresponding path program 10 times [2021-10-05 22:34:12,248 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:12,248 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411802389] [2021-10-05 22:34:12,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:12,249 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:12,374 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:12,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411802389] [2021-10-05 22:34:12,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411802389] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:12,374 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:12,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:12,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323572352] [2021-10-05 22:34:12,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:12,375 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:12,376 INFO L87 Difference]: Start difference. First operand 701 states and 1904 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-05 22:34:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:12,495 INFO L93 Difference]: Finished difference Result 1313 states and 3502 transitions. [2021-10-05 22:34:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:34:12,496 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-05 22:34:12,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:12,504 INFO L225 Difference]: With dead ends: 1313 [2021-10-05 22:34:12,504 INFO L226 Difference]: Without dead ends: 1169 [2021-10-05 22:34:12,505 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 79.6ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:34:12,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2021-10-05 22:34:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 707. [2021-10-05 22:34:12,529 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-05 22:34:12,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1916 transitions. [2021-10-05 22:34:12,532 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1916 transitions. Word has length 37 [2021-10-05 22:34:12,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:12,532 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 1916 transitions. [2021-10-05 22:34:12,533 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-05 22:34:12,533 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1916 transitions. [2021-10-05 22:34:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:12,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:12,535 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-05 22:34:12,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-05 22:34:12,536 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:12,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1090437495, now seen corresponding path program 11 times [2021-10-05 22:34:12,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:12,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868069245] [2021-10-05 22:34:12,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:12,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:12,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:12,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:12,631 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:12,631 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868069245] [2021-10-05 22:34:12,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868069245] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:12,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:12,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:12,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57119839] [2021-10-05 22:34:12,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:12,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:12,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:12,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:12,634 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-05 22:34:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:12,772 INFO L93 Difference]: Finished difference Result 887 states and 2384 transitions. [2021-10-05 22:34:12,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 22:34:12,773 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-05 22:34:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:12,778 INFO L225 Difference]: With dead ends: 887 [2021-10-05 22:34:12,778 INFO L226 Difference]: Without dead ends: 699 [2021-10-05 22:34:12,779 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 98.2ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:34:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2021-10-05 22:34:12,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 687. [2021-10-05 22:34:12,801 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-05 22:34:12,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1864 transitions. [2021-10-05 22:34:12,805 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1864 transitions. Word has length 37 [2021-10-05 22:34:12,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:12,806 INFO L470 AbstractCegarLoop]: Abstraction has 687 states and 1864 transitions. [2021-10-05 22:34:12,806 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-05 22:34:12,807 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1864 transitions. [2021-10-05 22:34:12,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:12,810 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:12,810 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-05 22:34:12,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-05 22:34:12,811 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:12,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 795454409, now seen corresponding path program 12 times [2021-10-05 22:34:12,812 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:12,812 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743981307] [2021-10-05 22:34:12,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:12,813 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:12,890 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:12,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743981307] [2021-10-05 22:34:12,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743981307] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:12,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:12,891 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:12,891 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026142675] [2021-10-05 22:34:12,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:12,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:12,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:12,893 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-05 22:34:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:12,998 INFO L93 Difference]: Finished difference Result 861 states and 2314 transitions. [2021-10-05 22:34:12,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:12,999 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-05 22:34:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:13,005 INFO L225 Difference]: With dead ends: 861 [2021-10-05 22:34:13,005 INFO L226 Difference]: Without dead ends: 807 [2021-10-05 22:34:13,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 68.1ms TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2021-10-05 22:34:13,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2021-10-05 22:34:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 807. [2021-10-05 22:34:13,027 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-05 22:34:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 2164 transitions. [2021-10-05 22:34:13,031 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 2164 transitions. Word has length 37 [2021-10-05 22:34:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 807 states and 2164 transitions. [2021-10-05 22:34:13,032 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-05 22:34:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 2164 transitions. [2021-10-05 22:34:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:13,035 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:13,035 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-05 22:34:13,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-05 22:34:13,035 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:13,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:13,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1506945655, now seen corresponding path program 13 times [2021-10-05 22:34:13,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:13,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656001059] [2021-10-05 22:34:13,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:13,037 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:13,150 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:13,150 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656001059] [2021-10-05 22:34:13,150 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656001059] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:13,150 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:13,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:13,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251683925] [2021-10-05 22:34:13,151 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:13,151 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:13,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:13,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:13,153 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-05 22:34:13,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:13,495 INFO L93 Difference]: Finished difference Result 1024 states and 2603 transitions. [2021-10-05 22:34:13,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:34:13,495 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-05 22:34:13,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:13,500 INFO L225 Difference]: With dead ends: 1024 [2021-10-05 22:34:13,500 INFO L226 Difference]: Without dead ends: 863 [2021-10-05 22:34:13,501 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 144.5ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:34:13,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2021-10-05 22:34:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 771. [2021-10-05 22:34:13,529 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-05 22:34:13,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 2030 transitions. [2021-10-05 22:34:13,532 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 2030 transitions. Word has length 37 [2021-10-05 22:34:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:13,532 INFO L470 AbstractCegarLoop]: Abstraction has 771 states and 2030 transitions. [2021-10-05 22:34:13,532 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-05 22:34:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 2030 transitions. [2021-10-05 22:34:13,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:13,535 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:13,535 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-05 22:34:13,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-05 22:34:13,536 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:13,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:13,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1361827723, now seen corresponding path program 14 times [2021-10-05 22:34:13,537 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:13,537 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148359235] [2021-10-05 22:34:13,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:13,537 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:13,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:13,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:13,659 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148359235] [2021-10-05 22:34:13,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148359235] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:13,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:13,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:13,659 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764752096] [2021-10-05 22:34:13,660 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:13,660 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:13,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:13,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:13,661 INFO L87 Difference]: Start difference. First operand 771 states and 2030 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-05 22:34:14,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:14,009 INFO L93 Difference]: Finished difference Result 1104 states and 2908 transitions. [2021-10-05 22:34:14,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:34:14,009 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-05 22:34:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:14,016 INFO L225 Difference]: With dead ends: 1104 [2021-10-05 22:34:14,016 INFO L226 Difference]: Without dead ends: 1065 [2021-10-05 22:34:14,017 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 137.2ms TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:34:14,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2021-10-05 22:34:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 882. [2021-10-05 22:34:14,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 881 states have (on average 2.6799091940976165) internal successors, (2361), 881 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:14,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 2361 transitions. [2021-10-05 22:34:14,050 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 2361 transitions. Word has length 37 [2021-10-05 22:34:14,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:14,050 INFO L470 AbstractCegarLoop]: Abstraction has 882 states and 2361 transitions. [2021-10-05 22:34:14,050 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-05 22:34:14,051 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 2361 transitions. [2021-10-05 22:34:14,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:14,053 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:14,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-05 22:34:14,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-05 22:34:14,054 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:14,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:14,055 INFO L82 PathProgramCache]: Analyzing trace with hash -148850481, now seen corresponding path program 15 times [2021-10-05 22:34:14,055 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:14,055 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456456349] [2021-10-05 22:34:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:14,055 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:14,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:14,180 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456456349] [2021-10-05 22:34:14,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456456349] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:14,180 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:14,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:14,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669954678] [2021-10-05 22:34:14,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:14,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:14,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:14,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:14,182 INFO L87 Difference]: Start difference. First operand 882 states and 2361 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-05 22:34:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:14,575 INFO L93 Difference]: Finished difference Result 1064 states and 2829 transitions. [2021-10-05 22:34:14,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:34:14,576 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-05 22:34:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:14,585 INFO L225 Difference]: With dead ends: 1064 [2021-10-05 22:34:14,585 INFO L226 Difference]: Without dead ends: 1031 [2021-10-05 22:34:14,586 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 164.4ms TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:34:14,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2021-10-05 22:34:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 891. [2021-10-05 22:34:14,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 2.6764044943820227) internal successors, (2382), 890 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 2382 transitions. [2021-10-05 22:34:14,617 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 2382 transitions. Word has length 37 [2021-10-05 22:34:14,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:14,617 INFO L470 AbstractCegarLoop]: Abstraction has 891 states and 2382 transitions. [2021-10-05 22:34:14,618 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-05 22:34:14,618 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 2382 transitions. [2021-10-05 22:34:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:14,621 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:14,621 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-05 22:34:14,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-05 22:34:14,622 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:14,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:14,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1344275613, now seen corresponding path program 16 times [2021-10-05 22:34:14,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:14,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68095048] [2021-10-05 22:34:14,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:14,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:14,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:14,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68095048] [2021-10-05 22:34:14,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68095048] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:14,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:14,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:14,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752310871] [2021-10-05 22:34:14,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:14,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:14,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:14,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:14,744 INFO L87 Difference]: Start difference. First operand 891 states and 2382 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-05 22:34:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:15,115 INFO L93 Difference]: Finished difference Result 1058 states and 2810 transitions. [2021-10-05 22:34:15,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:34:15,116 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-05 22:34:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:15,123 INFO L225 Difference]: With dead ends: 1058 [2021-10-05 22:34:15,123 INFO L226 Difference]: Without dead ends: 978 [2021-10-05 22:34:15,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 152.4ms TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:34:15,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2021-10-05 22:34:15,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 873. [2021-10-05 22:34:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 872 states have (on average 2.6731651376146788) internal successors, (2331), 872 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:15,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 2331 transitions. [2021-10-05 22:34:15,151 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 2331 transitions. Word has length 37 [2021-10-05 22:34:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:15,152 INFO L470 AbstractCegarLoop]: Abstraction has 873 states and 2331 transitions. [2021-10-05 22:34:15,152 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-05 22:34:15,152 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 2331 transitions. [2021-10-05 22:34:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:15,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:15,155 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-05 22:34:15,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-05 22:34:15,156 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1309457275, now seen corresponding path program 17 times [2021-10-05 22:34:15,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:15,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471332583] [2021-10-05 22:34:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:15,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:15,274 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:15,275 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471332583] [2021-10-05 22:34:15,275 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471332583] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:15,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:15,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:15,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750865941] [2021-10-05 22:34:15,276 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:15,276 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:15,278 INFO L87 Difference]: Start difference. First operand 873 states and 2331 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-05 22:34:15,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:15,590 INFO L93 Difference]: Finished difference Result 1092 states and 2836 transitions. [2021-10-05 22:34:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:34:15,590 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-05 22:34:15,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:15,594 INFO L225 Difference]: With dead ends: 1092 [2021-10-05 22:34:15,594 INFO L226 Difference]: Without dead ends: 928 [2021-10-05 22:34:15,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 109.1ms TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2021-10-05 22:34:15,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-10-05 22:34:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 798. [2021-10-05 22:34:15,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 2.6223337515683816) internal successors, (2090), 797 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2090 transitions. [2021-10-05 22:34:15,618 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2090 transitions. Word has length 37 [2021-10-05 22:34:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:15,619 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 2090 transitions. [2021-10-05 22:34:15,619 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-05 22:34:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2090 transitions. [2021-10-05 22:34:15,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:15,621 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:15,622 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-05 22:34:15,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-05 22:34:15,622 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:15,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:15,623 INFO L82 PathProgramCache]: Analyzing trace with hash 79456157, now seen corresponding path program 18 times [2021-10-05 22:34:15,623 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:15,623 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377285496] [2021-10-05 22:34:15,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:15,623 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:15,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:15,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:15,730 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377285496] [2021-10-05 22:34:15,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377285496] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:15,730 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:15,730 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:15,730 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413437671] [2021-10-05 22:34:15,731 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:15,731 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:15,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:15,732 INFO L87 Difference]: Start difference. First operand 798 states and 2090 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-05 22:34:16,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:16,056 INFO L93 Difference]: Finished difference Result 1003 states and 2545 transitions. [2021-10-05 22:34:16,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-10-05 22:34:16,057 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-05 22:34:16,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:16,061 INFO L225 Difference]: With dead ends: 1003 [2021-10-05 22:34:16,061 INFO L226 Difference]: Without dead ends: 884 [2021-10-05 22:34:16,062 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 119.5ms TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:34:16,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-10-05 22:34:16,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 780. [2021-10-05 22:34:16,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 779 states have (on average 2.6097560975609757) internal successors, (2033), 779 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2033 transitions. [2021-10-05 22:34:16,086 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 2033 transitions. Word has length 37 [2021-10-05 22:34:16,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:16,087 INFO L470 AbstractCegarLoop]: Abstraction has 780 states and 2033 transitions. [2021-10-05 22:34:16,087 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-05 22:34:16,087 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 2033 transitions. [2021-10-05 22:34:16,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:16,089 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:16,090 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-05 22:34:16,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-05 22:34:16,090 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:16,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:16,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1462467201, now seen corresponding path program 19 times [2021-10-05 22:34:16,091 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:16,091 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089775604] [2021-10-05 22:34:16,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:16,091 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:16,223 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:16,223 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089775604] [2021-10-05 22:34:16,224 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089775604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:16,224 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:16,224 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:16,224 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724643455] [2021-10-05 22:34:16,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-05 22:34:16,225 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:16,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-05 22:34:16,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-10-05 22:34:16,227 INFO L87 Difference]: Start difference. First operand 780 states and 2033 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-05 22:34:16,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:16,585 INFO L93 Difference]: Finished difference Result 1017 states and 2508 transitions. [2021-10-05 22:34:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-10-05 22:34:16,585 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-05 22:34:16,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:16,588 INFO L225 Difference]: With dead ends: 1017 [2021-10-05 22:34:16,588 INFO L226 Difference]: Without dead ends: 814 [2021-10-05 22:34:16,589 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 145.2ms TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2021-10-05 22:34:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2021-10-05 22:34:16,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 672. [2021-10-05 22:34:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 671 states have (on average 2.599105812220566) internal successors, (1744), 671 states have internal predecessors, (1744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1744 transitions. [2021-10-05 22:34:16,608 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1744 transitions. Word has length 37 [2021-10-05 22:34:16,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:16,608 INFO L470 AbstractCegarLoop]: Abstraction has 672 states and 1744 transitions. [2021-10-05 22:34:16,608 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-05 22:34:16,608 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1744 transitions. [2021-10-05 22:34:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:16,610 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:16,611 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-05 22:34:16,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-05 22:34:16,611 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:16,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:16,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2143919669, now seen corresponding path program 20 times [2021-10-05 22:34:16,612 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:16,612 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488426387] [2021-10-05 22:34:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:16,612 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:16,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:16,702 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:16,702 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488426387] [2021-10-05 22:34:16,702 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488426387] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:16,703 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:16,703 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:16,703 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029257818] [2021-10-05 22:34:16,704 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:16,705 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:16,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:16,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:16,706 INFO L87 Difference]: Start difference. First operand 672 states and 1744 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-05 22:34:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:16,834 INFO L93 Difference]: Finished difference Result 878 states and 2204 transitions. [2021-10-05 22:34:16,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 22:34:16,834 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-05 22:34:16,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:16,836 INFO L225 Difference]: With dead ends: 878 [2021-10-05 22:34:16,837 INFO L226 Difference]: Without dead ends: 734 [2021-10-05 22:34:16,837 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 88.4ms TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-10-05 22:34:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2021-10-05 22:34:16,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 660. [2021-10-05 22:34:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 2.5918057663125946) internal successors, (1708), 659 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1708 transitions. [2021-10-05 22:34:16,854 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1708 transitions. Word has length 37 [2021-10-05 22:34:16,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:16,856 INFO L470 AbstractCegarLoop]: Abstraction has 660 states and 1708 transitions. [2021-10-05 22:34:16,856 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-05 22:34:16,856 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1708 transitions. [2021-10-05 22:34:16,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:16,858 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:16,859 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-05 22:34:16,859 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-05 22:34:16,859 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:16,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:16,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1837332457, now seen corresponding path program 21 times [2021-10-05 22:34:16,860 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:16,860 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770091540] [2021-10-05 22:34:16,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:16,860 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:16,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:16,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:16,957 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:16,958 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770091540] [2021-10-05 22:34:16,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770091540] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:16,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:16,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-05 22:34:16,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665427993] [2021-10-05 22:34:16,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 22:34:16,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 22:34:16,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-10-05 22:34:16,960 INFO L87 Difference]: Start difference. First operand 660 states and 1708 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-05 22:34:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:17,072 INFO L93 Difference]: Finished difference Result 437 states and 1056 transitions. [2021-10-05 22:34:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 22:34:17,072 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-05 22:34:17,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:17,073 INFO L225 Difference]: With dead ends: 437 [2021-10-05 22:34:17,074 INFO L226 Difference]: Without dead ends: 233 [2021-10-05 22:34:17,074 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 84.9ms TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-10-05 22:34:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-05 22:34:17,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-05 22:34:17,079 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-05 22:34:17,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 529 transitions. [2021-10-05 22:34:17,080 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 529 transitions. Word has length 37 [2021-10-05 22:34:17,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:17,081 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 529 transitions. [2021-10-05 22:34:17,081 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-05 22:34:17,081 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 529 transitions. [2021-10-05 22:34:17,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:17,082 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:17,082 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-05 22:34:17,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-05 22:34:17,083 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:17,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:17,083 INFO L82 PathProgramCache]: Analyzing trace with hash 220660213, now seen corresponding path program 22 times [2021-10-05 22:34:17,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:17,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568131447] [2021-10-05 22:34:17,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:17,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:17,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:17,249 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568131447] [2021-10-05 22:34:17,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568131447] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:17,249 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:17,250 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:17,250 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602798285] [2021-10-05 22:34:17,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:17,250 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:17,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:17,251 INFO L87 Difference]: Start difference. First operand 233 states and 529 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-05 22:34:17,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:17,535 INFO L93 Difference]: Finished difference Result 262 states and 563 transitions. [2021-10-05 22:34:17,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:34:17,536 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-05 22:34:17,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:17,537 INFO L225 Difference]: With dead ends: 262 [2021-10-05 22:34:17,537 INFO L226 Difference]: Without dead ends: 247 [2021-10-05 22:34:17,537 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 168.7ms TimeCoverageRelationStatistics Valid=87, Invalid=375, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:34:17,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-10-05 22:34:17,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2021-10-05 22:34:17,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.271551724137931) internal successors, (527), 232 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 527 transitions. [2021-10-05 22:34:17,545 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 527 transitions. Word has length 37 [2021-10-05 22:34:17,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:17,545 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 527 transitions. [2021-10-05 22:34:17,545 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-05 22:34:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 527 transitions. [2021-10-05 22:34:17,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:17,546 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:17,546 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-05 22:34:17,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-05 22:34:17,547 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:17,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:17,547 INFO L82 PathProgramCache]: Analyzing trace with hash -1290017991, now seen corresponding path program 23 times [2021-10-05 22:34:17,547 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:17,548 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988430411] [2021-10-05 22:34:17,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:17,548 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:17,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:17,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:17,697 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:17,697 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988430411] [2021-10-05 22:34:17,697 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988430411] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:17,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:17,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:17,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478778323] [2021-10-05 22:34:17,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:17,698 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:17,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:17,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:17,699 INFO L87 Difference]: Start difference. First operand 233 states and 527 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-05 22:34:18,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:18,004 INFO L93 Difference]: Finished difference Result 246 states and 542 transitions. [2021-10-05 22:34:18,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-05 22:34:18,004 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-05 22:34:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:18,005 INFO L225 Difference]: With dead ends: 246 [2021-10-05 22:34:18,005 INFO L226 Difference]: Without dead ends: 233 [2021-10-05 22:34:18,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 180.6ms TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2021-10-05 22:34:18,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-10-05 22:34:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2021-10-05 22:34:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.2629310344827585) internal successors, (525), 232 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 525 transitions. [2021-10-05 22:34:18,012 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 525 transitions. Word has length 37 [2021-10-05 22:34:18,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:18,012 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 525 transitions. [2021-10-05 22:34:18,013 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-05 22:34:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 525 transitions. [2021-10-05 22:34:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:18,014 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:18,014 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-05 22:34:18,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-05 22:34:18,014 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:18,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1809524173, now seen corresponding path program 24 times [2021-10-05 22:34:18,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:18,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78429523] [2021-10-05 22:34:18,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:18,015 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:18,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:18,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:18,191 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78429523] [2021-10-05 22:34:18,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78429523] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:18,191 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:18,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:18,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053159478] [2021-10-05 22:34:18,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:18,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:18,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:18,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:18,194 INFO L87 Difference]: Start difference. First operand 233 states and 525 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-05 22:34:18,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:18,486 INFO L93 Difference]: Finished difference Result 244 states and 537 transitions. [2021-10-05 22:34:18,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-05 22:34:18,486 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-05 22:34:18,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:18,487 INFO L225 Difference]: With dead ends: 244 [2021-10-05 22:34:18,488 INFO L226 Difference]: Without dead ends: 209 [2021-10-05 22:34:18,488 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 182.5ms TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2021-10-05 22:34:18,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2021-10-05 22:34:18,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2021-10-05 22:34:18,499 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-05 22:34:18,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 476 transitions. [2021-10-05 22:34:18,500 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 476 transitions. Word has length 37 [2021-10-05 22:34:18,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:18,500 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 476 transitions. [2021-10-05 22:34:18,501 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-05 22:34:18,501 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 476 transitions. [2021-10-05 22:34:18,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:18,505 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:18,506 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-05 22:34:18,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-05 22:34:18,507 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:18,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:18,508 INFO L82 PathProgramCache]: Analyzing trace with hash 168289765, now seen corresponding path program 25 times [2021-10-05 22:34:18,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:18,508 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757177401] [2021-10-05 22:34:18,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:18,509 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:18,654 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:18,654 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757177401] [2021-10-05 22:34:18,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757177401] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:18,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:18,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:18,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178839196] [2021-10-05 22:34:18,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:18,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:18,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:18,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:18,657 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-05 22:34:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:18,915 INFO L93 Difference]: Finished difference Result 262 states and 571 transitions. [2021-10-05 22:34:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:34:18,915 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-05 22:34:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:18,917 INFO L225 Difference]: With dead ends: 262 [2021-10-05 22:34:18,917 INFO L226 Difference]: Without dead ends: 133 [2021-10-05 22:34:18,917 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 169.5ms TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:34:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-05 22:34:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-05 22:34:18,922 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-05 22:34:18,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2021-10-05 22:34:18,923 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 37 [2021-10-05 22:34:18,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:18,923 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2021-10-05 22:34:18,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-05 22:34:18,923 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2021-10-05 22:34:18,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-10-05 22:34:18,924 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 22:34:18,924 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-05 22:34:18,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-05 22:34:18,925 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2021-10-05 22:34:18,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 22:34:18,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1061711353, now seen corresponding path program 26 times [2021-10-05 22:34:18,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 22:34:18,926 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166805051] [2021-10-05 22:34:18,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 22:34:18,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 22:34:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 22:34:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 22:34:19,087 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 22:34:19,087 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166805051] [2021-10-05 22:34:19,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166805051] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 22:34:19,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 22:34:19,088 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-10-05 22:34:19,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336673040] [2021-10-05 22:34:19,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-10-05 22:34:19,088 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 22:34:19,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-05 22:34:19,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-10-05 22:34:19,090 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-05 22:34:19,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 22:34:19,290 INFO L93 Difference]: Finished difference Result 132 states and 244 transitions. [2021-10-05 22:34:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-05 22:34:19,291 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-05 22:34:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 22:34:19,291 INFO L225 Difference]: With dead ends: 132 [2021-10-05 22:34:19,291 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 22:34:19,292 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 148.1ms TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2021-10-05 22:34:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 22:34:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 22:34:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-05 22:34:19,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 22:34:19,293 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2021-10-05 22:34:19,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 22:34:19,293 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 22:34:19,294 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-05 22:34:19,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 22:34:19,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 22:34:19,297 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 22:34:19,298 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 22:34:19,298 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 22:34:19,299 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATION [2021-10-05 22:34:19,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-05 22:34:19,304 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 22:34:19,304 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 22:34:19,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:34:19 BasicIcfg [2021-10-05 22:34:19,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 22:34:19,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 22:34:19,308 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 22:34:19,308 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 22:34:19,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:33:55" (3/4) ... [2021-10-05 22:34:19,313 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 22:34:19,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 22:34:19,321 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 22:34:19,322 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2021-10-05 22:34:19,328 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2021-10-05 22:34:19,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2021-10-05 22:34:19,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 22:34:19,329 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 22:34:19,377 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 22:34:19,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 22:34:19,379 INFO L168 Benchmark]: Toolchain (without parser) took 24592.56 ms. Allocated memory was 48.2 MB in the beginning and 197.1 MB in the end (delta: 148.9 MB). Free memory was 24.0 MB in the beginning and 155.2 MB in the end (delta: -131.2 MB). Peak memory consumption was 19.7 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,380 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 48.2 MB. Free memory was 28.9 MB in the beginning and 28.9 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 22:34:19,380 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.57 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 34.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,381 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.99 ms. Allocated memory is still 58.7 MB. Free memory was 34.3 MB in the beginning and 32.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,381 INFO L168 Benchmark]: Boogie Preprocessor took 33.66 ms. Allocated memory is still 58.7 MB. Free memory was 32.2 MB in the beginning and 30.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,382 INFO L168 Benchmark]: RCFGBuilder took 671.17 ms. Allocated memory is still 58.7 MB. Free memory was 30.6 MB in the beginning and 29.6 MB in the end (delta: 948.5 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,382 INFO L168 Benchmark]: TraceAbstraction took 23438.06 ms. Allocated memory was 58.7 MB in the beginning and 197.1 MB in the end (delta: 138.4 MB). Free memory was 29.2 MB in the beginning and 158.3 MB in the end (delta: -129.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,383 INFO L168 Benchmark]: Witness Printer took 69.55 ms. Allocated memory is still 197.1 MB. Free memory was 158.3 MB in the beginning and 155.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 22:34:19,385 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.25 ms. Allocated memory is still 48.2 MB. Free memory was 28.9 MB in the beginning and 28.9 MB in the end (delta: 36.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 316.57 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 23.7 MB in the beginning and 34.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.99 ms. Allocated memory is still 58.7 MB. Free memory was 34.3 MB in the beginning and 32.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.66 ms. Allocated memory is still 58.7 MB. Free memory was 32.2 MB in the beginning and 30.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 671.17 ms. Allocated memory is still 58.7 MB. Free memory was 30.6 MB in the beginning and 29.6 MB in the end (delta: 948.5 kB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 23438.06 ms. Allocated memory was 58.7 MB in the beginning and 197.1 MB in the end (delta: 138.4 MB). Free memory was 29.2 MB in the beginning and 158.3 MB in the end (delta: -129.2 MB). Peak memory consumption was 10.1 MB. Max. memory is 16.1 GB. * Witness Printer took 69.55 ms. Allocated memory is still 197.1 MB. Free memory was 158.3 MB in the beginning and 155.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9206.1ms, 201 PlacesBefore, 51 PlacesAfterwards, 204 TransitionsBefore, 46 TransitionsAfterwards, 5124 CoEnabledTransitionPairs, 12 FixpointIterations, 100 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 23 ConcurrentYvCompositions, 8 ChoiceCompositions, 206 TotalNumberOfCompositions, 16438 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 10672, positive: 10188, positive conditional: 0, positive unconditional: 10188, negative: 484, negative conditional: 0, negative unconditional: 484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4341, positive: 4265, positive conditional: 0, positive unconditional: 4265, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4341, positive: 4224, positive conditional: 0, positive unconditional: 4224, negative: 117, negative conditional: 0, negative unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 117, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 76, negative conditional: 0, negative unconditional: 76, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 162, positive: 37, positive conditional: 0, positive unconditional: 37, negative: 125, negative conditional: 0, negative unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 10672, positive: 5923, positive conditional: 0, positive unconditional: 5923, negative: 408, negative conditional: 0, negative unconditional: 408, unknown: 4341, unknown conditional: 0, unknown unconditional: 4341] , Statistics on independence cache: Total cache size (in pairs): 462, Positive cache size: 428, Positive conditional cache size: 0, Positive unconditional cache size: 428, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - 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: 112]: 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, 263 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 23229.6ms, OverallIterations: 27, TraceHistogramMax: 1, EmptinessCheckTime: 111.2ms, AutomataDifference: 8146.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 9339.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1910 SDtfs, 4021 SDslu, 8709 SDs, 0 SdLazy, 6726 SolverSat, 330 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3870.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 471 GetRequests, 30 SyntacticMatches, 9 SemanticMatches, 432 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 3874.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1001occurred in iteration=6, InterpolantAutomatonStates: 332, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 779.1ms AutomataMinimizationTime, 27 MinimizatonAttempts, 2906 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 92.5ms SsaConstructionTime, 1183.0ms SatisfiabilityAnalysisTime, 3160.6ms InterpolantComputationTime, 981 NumberOfCodeBlocks, 981 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 7644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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-05 22:34:19,443 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...