./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 505e718826e0afe8bb405a2ce57a251a8a8b7519 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 02:52:22,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 02:52:22,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 02:52:22,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 02:52:22,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 02:52:22,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 02:52:22,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 02:52:22,056 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 02:52:22,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 02:52:22,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 02:52:22,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 02:52:22,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 02:52:22,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 02:52:22,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 02:52:22,062 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 02:52:22,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 02:52:22,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 02:52:22,065 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 02:52:22,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 02:52:22,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 02:52:22,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 02:52:22,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 02:52:22,072 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 02:52:22,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 02:52:22,076 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 02:52:22,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 02:52:22,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 02:52:22,077 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 02:52:22,078 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 02:52:22,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 02:52:22,079 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 02:52:22,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 02:52:22,081 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 02:52:22,082 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 02:52:22,090 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 02:52:22,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 02:52:22,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 02:52:22,091 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 02:52:22,091 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 02:52:22,092 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 02:52:22,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 02:52:22,093 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 02:52:22,140 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 02:52:22,143 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 02:52:22,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 02:52:22,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 02:52:22,146 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 02:52:22,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 02:52:22,146 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 02:52:22,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 02:52:22,146 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 02:52:22,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 02:52:22,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 02:52:22,147 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 02:52:22,147 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 02:52:22,147 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 02:52:22,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 02:52:22,148 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 02:52:22,148 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 02:52:22,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 02:52:22,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 02:52:22,150 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 02:52:22,150 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 02:52:22,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:52:22,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 02:52:22,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 02:52:22,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 505e718826e0afe8bb405a2ce57a251a8a8b7519 [2020-10-20 02:52:22,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 02:52:22,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 02:52:22,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 02:52:22,403 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 02:52:22,403 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 02:52:22,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i [2020-10-20 02:52:22,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bd817b1/aed31cc3dfda477bb41d1f4402ec0a66/FLAG7edc0126a [2020-10-20 02:52:23,094 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 02:52:23,095 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix013_tso.opt.i [2020-10-20 02:52:23,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bd817b1/aed31cc3dfda477bb41d1f4402ec0a66/FLAG7edc0126a [2020-10-20 02:52:23,306 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95bd817b1/aed31cc3dfda477bb41d1f4402ec0a66 [2020-10-20 02:52:23,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 02:52:23,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 02:52:23,319 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 02:52:23,319 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 02:52:23,322 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 02:52:23,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:23,329 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d880cf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23, skipping insertion in model container [2020-10-20 02:52:23,329 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:23,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 02:52:23,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 02:52:23,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:52:23,802 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 02:52:23,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 02:52:23,965 INFO L208 MainTranslator]: Completed translation [2020-10-20 02:52:23,965 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23 WrapperNode [2020-10-20 02:52:23,966 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 02:52:23,966 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 02:52:23,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 02:52:23,967 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 02:52:23,976 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:23,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 02:52:24,056 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 02:52:24,056 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 02:52:24,056 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 02:52:24,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,073 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... [2020-10-20 02:52:24,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 02:52:24,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 02:52:24,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 02:52:24,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 02:52:24,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 02:52:24,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 02:52:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 02:52:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 02:52:24,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 02:52:24,171 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 02:52:24,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 02:52:24,171 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 02:52:24,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 02:52:24,171 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 02:52:24,171 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 02:52:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-20 02:52:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-20 02:52:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 02:52:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 02:52:24,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 02:52:24,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 02:52:24,174 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 02:52:26,864 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 02:52:26,865 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 02:52:26,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:52:26 BoogieIcfgContainer [2020-10-20 02:52:26,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 02:52:26,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 02:52:26,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 02:52:26,875 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 02:52:26,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 02:52:23" (1/3) ... [2020-10-20 02:52:26,876 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a2346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:52:26, skipping insertion in model container [2020-10-20 02:52:26,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 02:52:23" (2/3) ... [2020-10-20 02:52:26,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a2346b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 02:52:26, skipping insertion in model container [2020-10-20 02:52:26,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:52:26" (3/3) ... [2020-10-20 02:52:26,880 INFO L111 eAbstractionObserver]: Analyzing ICFG mix013_tso.opt.i [2020-10-20 02:52:26,893 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 02:52:26,893 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 02:52:26,902 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 02:52:26,903 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 02:52:26,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,953 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,955 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,957 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,957 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,958 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,958 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,959 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,965 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,966 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,967 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,972 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,973 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,973 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,974 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,974 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,974 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,974 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,975 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,976 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,977 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,977 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,979 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,980 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,981 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,982 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,983 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,984 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,985 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,986 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,990 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,991 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,992 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:26,993 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,000 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,001 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,004 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,005 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,006 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,013 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,014 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,015 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,015 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,016 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,017 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,017 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,018 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,019 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,020 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,023 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,024 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,025 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,026 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,026 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,027 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,027 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,028 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,029 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,030 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,031 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,031 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,031 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,032 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,033 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,035 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,036 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,038 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,038 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,038 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,039 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 02:52:27,040 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 02:52:27,059 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-20 02:52:27,091 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 02:52:27,091 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 02:52:27,091 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 02:52:27,092 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 02:52:27,092 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 02:52:27,092 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 02:52:27,092 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 02:52:27,092 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 02:52:27,117 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 02:52:27,122 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-20 02:52:27,126 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 132 places, 122 transitions, 264 flow [2020-10-20 02:52:27,129 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 132 places, 122 transitions, 264 flow [2020-10-20 02:52:27,216 INFO L129 PetriNetUnfolder]: 3/118 cut-off events. [2020-10-20 02:52:27,216 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 02:52:27,223 INFO L80 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 118 events. 3/118 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2020-10-20 02:52:27,228 INFO L117 LiptonReduction]: Number of co-enabled transitions 2734 [2020-10-20 02:52:27,883 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:27,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:27,886 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:52:27,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:27,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:52:27,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:27,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:27,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:27,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:27,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:27,966 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:27,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,001 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,033 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,147 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,149 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,203 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,313 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,314 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,316 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:52:28,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,467 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 02:52:28,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,682 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 02:52:28,685 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:52:28,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:28,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,932 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:28,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:28,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:28,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:28,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:28,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:29,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:29,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,066 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,069 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,071 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:29,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:29,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:29,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:29,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:29,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:29,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:29,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:29,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:29,787 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-20 02:52:29,898 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-20 02:52:30,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:30,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 02:52:30,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:30,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 02:52:30,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:30,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:30,728 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,728 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:30,730 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:30,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:30,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:30,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:30,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:31,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:52:31,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:52:31,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,301 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,310 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:31,345 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:31,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:52:31,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,542 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,548 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,552 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,554 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,887 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 02:52:31,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:31,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,896 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,897 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 02:52:31,898 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 02:52:31,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 02:52:31,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 02:52:31,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 02:52:31,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 02:52:33,272 WARN L193 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 128 [2020-10-20 02:52:33,508 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-20 02:52:33,613 INFO L132 LiptonReduction]: Checked pairs total: 9159 [2020-10-20 02:52:33,614 INFO L134 LiptonReduction]: Total number of compositions: 112 [2020-10-20 02:52:33,621 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-20 02:52:33,853 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3010 states. [2020-10-20 02:52:33,856 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states. [2020-10-20 02:52:33,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 02:52:33,866 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:33,867 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:33,868 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:33,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:33,875 INFO L82 PathProgramCache]: Analyzing trace with hash -969727296, now seen corresponding path program 1 times [2020-10-20 02:52:33,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:33,887 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969866226] [2020-10-20 02:52:33,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:34,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:34,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:34,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969866226] [2020-10-20 02:52:34,164 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:34,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:52:34,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449765639] [2020-10-20 02:52:34,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:52:34,172 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:52:34,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:34,192 INFO L87 Difference]: Start difference. First operand 3010 states. Second operand 3 states. [2020-10-20 02:52:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:34,326 INFO L93 Difference]: Finished difference Result 2610 states and 10086 transitions. [2020-10-20 02:52:34,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:52:34,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 02:52:34,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:34,383 INFO L225 Difference]: With dead ends: 2610 [2020-10-20 02:52:34,383 INFO L226 Difference]: Without dead ends: 2130 [2020-10-20 02:52:34,385 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:34,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2020-10-20 02:52:34,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 2130. [2020-10-20 02:52:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2020-10-20 02:52:34,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 8102 transitions. [2020-10-20 02:52:34,567 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 8102 transitions. Word has length 9 [2020-10-20 02:52:34,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:34,569 INFO L481 AbstractCegarLoop]: Abstraction has 2130 states and 8102 transitions. [2020-10-20 02:52:34,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:52:34,569 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 8102 transitions. [2020-10-20 02:52:34,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 02:52:34,572 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:34,572 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:34,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 02:52:34,572 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:34,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:34,573 INFO L82 PathProgramCache]: Analyzing trace with hash 100025621, now seen corresponding path program 1 times [2020-10-20 02:52:34,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:34,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327902203] [2020-10-20 02:52:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:34,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:34,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327902203] [2020-10-20 02:52:34,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:34,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:52:34,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611622912] [2020-10-20 02:52:34,652 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:52:34,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:34,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:52:34,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:34,652 INFO L87 Difference]: Start difference. First operand 2130 states and 8102 transitions. Second operand 3 states. [2020-10-20 02:52:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:34,686 INFO L93 Difference]: Finished difference Result 1970 states and 7414 transitions. [2020-10-20 02:52:34,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:52:34,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 02:52:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:35,011 INFO L225 Difference]: With dead ends: 1970 [2020-10-20 02:52:35,012 INFO L226 Difference]: Without dead ends: 1970 [2020-10-20 02:52:35,013 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:35,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2020-10-20 02:52:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1970. [2020-10-20 02:52:35,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1970 states. [2020-10-20 02:52:35,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1970 states to 1970 states and 7414 transitions. [2020-10-20 02:52:35,091 INFO L78 Accepts]: Start accepts. Automaton has 1970 states and 7414 transitions. Word has length 11 [2020-10-20 02:52:35,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:35,092 INFO L481 AbstractCegarLoop]: Abstraction has 1970 states and 7414 transitions. [2020-10-20 02:52:35,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:52:35,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1970 states and 7414 transitions. [2020-10-20 02:52:35,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 02:52:35,096 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:35,096 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:35,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 02:52:35,096 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:35,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:35,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1633608615, now seen corresponding path program 1 times [2020-10-20 02:52:35,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:35,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086200552] [2020-10-20 02:52:35,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:35,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:35,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086200552] [2020-10-20 02:52:35,208 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:35,208 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 02:52:35,208 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522262540] [2020-10-20 02:52:35,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 02:52:35,209 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:35,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 02:52:35,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:35,210 INFO L87 Difference]: Start difference. First operand 1970 states and 7414 transitions. Second operand 3 states. [2020-10-20 02:52:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:35,234 INFO L93 Difference]: Finished difference Result 1842 states and 6870 transitions. [2020-10-20 02:52:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 02:52:35,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-20 02:52:35,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:35,251 INFO L225 Difference]: With dead ends: 1842 [2020-10-20 02:52:35,251 INFO L226 Difference]: Without dead ends: 1842 [2020-10-20 02:52:35,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 02:52:35,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1842 states. [2020-10-20 02:52:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1842 to 1842. [2020-10-20 02:52:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1842 states. [2020-10-20 02:52:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 6870 transitions. [2020-10-20 02:52:35,326 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 6870 transitions. Word has length 13 [2020-10-20 02:52:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:35,326 INFO L481 AbstractCegarLoop]: Abstraction has 1842 states and 6870 transitions. [2020-10-20 02:52:35,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 02:52:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 6870 transitions. [2020-10-20 02:52:35,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 02:52:35,330 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:35,330 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:35,331 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 02:52:35,331 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:35,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1247021923, now seen corresponding path program 1 times [2020-10-20 02:52:35,332 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:35,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971607918] [2020-10-20 02:52:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:35,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:35,517 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971607918] [2020-10-20 02:52:35,517 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:35,517 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:52:35,518 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636326282] [2020-10-20 02:52:35,518 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:52:35,519 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:35,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:52:35,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:52:35,562 INFO L87 Difference]: Start difference. First operand 1842 states and 6870 transitions. Second operand 4 states. [2020-10-20 02:52:35,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:35,673 INFO L93 Difference]: Finished difference Result 1908 states and 6484 transitions. [2020-10-20 02:52:35,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 02:52:35,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 02:52:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:35,691 INFO L225 Difference]: With dead ends: 1908 [2020-10-20 02:52:35,691 INFO L226 Difference]: Without dead ends: 1428 [2020-10-20 02:52:35,692 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:52:35,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-10-20 02:52:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2020-10-20 02:52:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2020-10-20 02:52:35,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 4800 transitions. [2020-10-20 02:52:35,763 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 4800 transitions. Word has length 15 [2020-10-20 02:52:35,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:35,763 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 4800 transitions. [2020-10-20 02:52:35,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:52:35,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 4800 transitions. [2020-10-20 02:52:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 02:52:35,769 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:35,769 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:35,769 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 02:52:35,770 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash 767218723, now seen corresponding path program 1 times [2020-10-20 02:52:35,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:35,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277853352] [2020-10-20 02:52:35,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:35,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:35,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277853352] [2020-10-20 02:52:35,960 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:35,960 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 02:52:35,960 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043393051] [2020-10-20 02:52:35,960 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 02:52:35,961 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 02:52:35,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:52:35,965 INFO L87 Difference]: Start difference. First operand 1428 states and 4800 transitions. Second operand 5 states. [2020-10-20 02:52:36,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:36,036 INFO L93 Difference]: Finished difference Result 1245 states and 3853 transitions. [2020-10-20 02:52:36,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 02:52:36,037 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-20 02:52:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:36,044 INFO L225 Difference]: With dead ends: 1245 [2020-10-20 02:52:36,044 INFO L226 Difference]: Without dead ends: 945 [2020-10-20 02:52:36,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:52:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2020-10-20 02:52:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2020-10-20 02:52:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2020-10-20 02:52:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 2868 transitions. [2020-10-20 02:52:36,076 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 2868 transitions. Word has length 17 [2020-10-20 02:52:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:36,077 INFO L481 AbstractCegarLoop]: Abstraction has 945 states and 2868 transitions. [2020-10-20 02:52:36,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 02:52:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 2868 transitions. [2020-10-20 02:52:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 02:52:36,081 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:36,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 02:52:36,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 02:52:36,082 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash 33746590, now seen corresponding path program 1 times [2020-10-20 02:52:36,083 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:36,083 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105503109] [2020-10-20 02:52:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:36,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:36,268 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105503109] [2020-10-20 02:52:36,268 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:36,268 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:52:36,268 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068640296] [2020-10-20 02:52:36,269 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 02:52:36,269 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:36,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 02:52:36,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 02:52:36,270 INFO L87 Difference]: Start difference. First operand 945 states and 2868 transitions. Second operand 6 states. [2020-10-20 02:52:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:36,342 INFO L93 Difference]: Finished difference Result 833 states and 2499 transitions. [2020-10-20 02:52:36,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 02:52:36,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-20 02:52:36,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:36,348 INFO L225 Difference]: With dead ends: 833 [2020-10-20 02:52:36,349 INFO L226 Difference]: Without dead ends: 734 [2020-10-20 02:52:36,349 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:52:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2020-10-20 02:52:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 734. [2020-10-20 02:52:36,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734 states. [2020-10-20 02:52:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 2235 transitions. [2020-10-20 02:52:36,371 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 2235 transitions. Word has length 20 [2020-10-20 02:52:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:36,371 INFO L481 AbstractCegarLoop]: Abstraction has 734 states and 2235 transitions. [2020-10-20 02:52:36,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 02:52:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 2235 transitions. [2020-10-20 02:52:36,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 02:52:36,374 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:36,374 INFO L422 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] [2020-10-20 02:52:36,375 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 02:52:36,375 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:36,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:36,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2011213859, now seen corresponding path program 1 times [2020-10-20 02:52:36,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:36,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137166002] [2020-10-20 02:52:36,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:36,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:36,529 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137166002] [2020-10-20 02:52:36,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:36,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 02:52:36,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65181251] [2020-10-20 02:52:36,530 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:52:36,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:36,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:52:36,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:52:36,531 INFO L87 Difference]: Start difference. First operand 734 states and 2235 transitions. Second operand 7 states. [2020-10-20 02:52:36,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:36,620 INFO L93 Difference]: Finished difference Result 709 states and 2183 transitions. [2020-10-20 02:52:36,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:52:36,621 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-20 02:52:36,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:36,627 INFO L225 Difference]: With dead ends: 709 [2020-10-20 02:52:36,627 INFO L226 Difference]: Without dead ends: 693 [2020-10-20 02:52:36,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-20 02:52:36,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2020-10-20 02:52:36,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2020-10-20 02:52:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2020-10-20 02:52:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 2153 transitions. [2020-10-20 02:52:36,649 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 2153 transitions. Word has length 23 [2020-10-20 02:52:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:36,650 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 2153 transitions. [2020-10-20 02:52:36,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:52:36,650 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 2153 transitions. [2020-10-20 02:52:36,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:52:36,652 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:36,652 INFO L422 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] [2020-10-20 02:52:36,653 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 02:52:36,653 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:36,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:36,653 INFO L82 PathProgramCache]: Analyzing trace with hash 536341755, now seen corresponding path program 1 times [2020-10-20 02:52:36,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:36,654 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373610069] [2020-10-20 02:52:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:36,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373610069] [2020-10-20 02:52:36,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:36,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:52:36,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177592414] [2020-10-20 02:52:36,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:52:36,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:36,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:52:36,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:52:36,737 INFO L87 Difference]: Start difference. First operand 693 states and 2153 transitions. Second operand 4 states. [2020-10-20 02:52:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:36,762 INFO L93 Difference]: Finished difference Result 967 states and 2927 transitions. [2020-10-20 02:52:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 02:52:36,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-20 02:52:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:36,766 INFO L225 Difference]: With dead ends: 967 [2020-10-20 02:52:36,766 INFO L226 Difference]: Without dead ends: 421 [2020-10-20 02:52:36,767 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:52:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2020-10-20 02:52:36,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2020-10-20 02:52:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-10-20 02:52:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1177 transitions. [2020-10-20 02:52:36,807 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1177 transitions. Word has length 26 [2020-10-20 02:52:36,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:36,809 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1177 transitions. [2020-10-20 02:52:36,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:52:36,810 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1177 transitions. [2020-10-20 02:52:36,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:52:36,813 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:36,813 INFO L422 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] [2020-10-20 02:52:36,813 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 02:52:36,813 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:36,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1316603387, now seen corresponding path program 2 times [2020-10-20 02:52:36,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:36,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804956629] [2020-10-20 02:52:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:36,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:36,908 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804956629] [2020-10-20 02:52:36,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:36,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 02:52:36,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016233974] [2020-10-20 02:52:36,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 02:52:36,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:36,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 02:52:36,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 02:52:36,910 INFO L87 Difference]: Start difference. First operand 421 states and 1177 transitions. Second operand 4 states. [2020-10-20 02:52:36,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:36,927 INFO L93 Difference]: Finished difference Result 519 states and 1423 transitions. [2020-10-20 02:52:36,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 02:52:36,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-20 02:52:36,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:36,930 INFO L225 Difference]: With dead ends: 519 [2020-10-20 02:52:36,930 INFO L226 Difference]: Without dead ends: 229 [2020-10-20 02:52:36,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 02:52:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-10-20 02:52:36,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2020-10-20 02:52:36,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-10-20 02:52:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 553 transitions. [2020-10-20 02:52:36,939 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 553 transitions. Word has length 26 [2020-10-20 02:52:36,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:36,940 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 553 transitions. [2020-10-20 02:52:36,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 02:52:36,940 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 553 transitions. [2020-10-20 02:52:36,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:52:36,942 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:36,942 INFO L422 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] [2020-10-20 02:52:36,942 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 02:52:36,942 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:36,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:36,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2122280343, now seen corresponding path program 3 times [2020-10-20 02:52:36,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:36,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525610686] [2020-10-20 02:52:36,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 02:52:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 02:52:37,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525610686] [2020-10-20 02:52:37,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 02:52:37,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 02:52:37,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81556436] [2020-10-20 02:52:37,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 02:52:37,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 02:52:37,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 02:52:37,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 02:52:37,217 INFO L87 Difference]: Start difference. First operand 229 states and 553 transitions. Second operand 7 states. [2020-10-20 02:52:37,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 02:52:37,392 INFO L93 Difference]: Finished difference Result 247 states and 587 transitions. [2020-10-20 02:52:37,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 02:52:37,394 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-20 02:52:37,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 02:52:37,396 INFO L225 Difference]: With dead ends: 247 [2020-10-20 02:52:37,396 INFO L226 Difference]: Without dead ends: 197 [2020-10-20 02:52:37,397 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-20 02:52:37,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2020-10-20 02:52:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2020-10-20 02:52:37,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2020-10-20 02:52:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 467 transitions. [2020-10-20 02:52:37,402 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 467 transitions. Word has length 26 [2020-10-20 02:52:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 02:52:37,403 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 467 transitions. [2020-10-20 02:52:37,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 02:52:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 467 transitions. [2020-10-20 02:52:37,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 02:52:37,404 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 02:52:37,404 INFO L422 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] [2020-10-20 02:52:37,404 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 02:52:37,404 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 02:52:37,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 02:52:37,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1288711301, now seen corresponding path program 4 times [2020-10-20 02:52:37,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 02:52:37,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624508353] [2020-10-20 02:52:37,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 02:52:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:52:37,481 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:52:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 02:52:37,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 02:52:37,587 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 02:52:37,588 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 02:52:37,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 02:52:37,589 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 02:52:37,614 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1262] [1262] L882-->L889: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-2126305655 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-2126305655 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-2126305655 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-2126305655 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out-2126305655 ~z$r_buff0_thd0~0_In-2126305655) (or (and .cse0 (= ~z$w_buff1_used~0_Out-2126305655 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-2126305655 ~z$w_buff1_used~0_Out-2126305655))) (or (and .cse3 .cse4 (= ~z$w_buff0_used~0_Out-2126305655 0)) (and .cse5 (= ~z$w_buff0_used~0_Out-2126305655 ~z$w_buff0_used~0_In-2126305655))) (or (and .cse3 .cse4 (= ~z~0_Out-2126305655 ~z$w_buff0~0_In-2126305655)) (and .cse5 (or (and .cse0 (= ~z~0_Out-2126305655 ~z$w_buff1~0_In-2126305655) .cse1) (and .cse2 (= ~z~0_Out-2126305655 ~z~0_In-2126305655))))) (= ~z$r_buff1_thd0~0_In-2126305655 ~z$r_buff1_thd0~0_Out-2126305655) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2126305655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126305655, ~z$w_buff0~0=~z$w_buff0~0_In-2126305655, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2126305655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126305655, ~z$w_buff1~0=~z$w_buff1~0_In-2126305655, ~z~0=~z~0_In-2126305655} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2126305655, ~z$w_buff0~0=~z$w_buff0~0_In-2126305655, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2126305655, ~z$w_buff1~0=~z$w_buff1~0_In-2126305655, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-2126305655|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2126305655|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2126305655|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2126305655|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2126305655|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2126305655, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2126305655|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2126305655, ~z~0=~z~0_Out-2126305655} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-20 02:52:37,623 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,623 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [816] [2020-10-20 02:52:37,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,624 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,624 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,625 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,625 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,626 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,626 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,627 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,627 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,629 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,629 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,630 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,630 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,631 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,631 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,633 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,633 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 02:52:37 BasicIcfg [2020-10-20 02:52:37,765 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 02:52:37,766 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 02:52:37,766 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 02:52:37,766 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 02:52:37,767 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 02:52:26" (3/4) ... [2020-10-20 02:52:37,770 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 02:52:37,788 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1262] [1262] L882-->L889: Formula: (let ((.cse7 (= (mod ~z$w_buff1_used~0_In-2126305655 256) 0)) (.cse6 (= (mod ~z$r_buff1_thd0~0_In-2126305655 256) 0)) (.cse8 (= (mod ~z$w_buff0_used~0_In-2126305655 256) 0)) (.cse9 (= (mod ~z$r_buff0_thd0~0_In-2126305655 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse5 (or .cse8 .cse9)) (.cse0 (not .cse6)) (.cse1 (not .cse7)) (.cse2 (or .cse6 .cse7))) (and (= ~z$r_buff0_thd0~0_Out-2126305655 ~z$r_buff0_thd0~0_In-2126305655) (or (and .cse0 (= ~z$w_buff1_used~0_Out-2126305655 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_In-2126305655 ~z$w_buff1_used~0_Out-2126305655))) (or (and .cse3 .cse4 (= ~z$w_buff0_used~0_Out-2126305655 0)) (and .cse5 (= ~z$w_buff0_used~0_Out-2126305655 ~z$w_buff0_used~0_In-2126305655))) (or (and .cse3 .cse4 (= ~z~0_Out-2126305655 ~z$w_buff0~0_In-2126305655)) (and .cse5 (or (and .cse0 (= ~z~0_Out-2126305655 ~z$w_buff1~0_In-2126305655) .cse1) (and .cse2 (= ~z~0_Out-2126305655 ~z~0_In-2126305655))))) (= ~z$r_buff1_thd0~0_In-2126305655 ~z$r_buff1_thd0~0_Out-2126305655) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2126305655, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2126305655, ~z$w_buff0~0=~z$w_buff0~0_In-2126305655, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2126305655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2126305655, ~z$w_buff1~0=~z$w_buff1~0_In-2126305655, ~z~0=~z~0_In-2126305655} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-2126305655, ~z$w_buff0~0=~z$w_buff0~0_In-2126305655, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-2126305655, ~z$w_buff1~0=~z$w_buff1~0_In-2126305655, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-2126305655|, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2126305655|, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2126305655|, ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-2126305655|, ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-2126305655|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-2126305655|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-2126305655, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-2126305655|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-2126305655, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-2126305655, ~z~0=~z~0_Out-2126305655} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite63, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2020-10-20 02:52:37,790 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,791 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [816] [2020-10-20 02:52:37,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,791 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,791 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,792 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,792 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,793 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,793 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,793 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,793 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,794 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,794 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,795 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,795 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,796 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,796 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,797 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,797 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,798 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,798 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,799 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,799 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,800 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,800 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,800 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,801 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,801 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,802 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,802 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,803 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 02:52:37,803 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 02:52:37,920 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 02:52:37,920 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 02:52:37,922 INFO L168 Benchmark]: Toolchain (without parser) took 14610.03 ms. Allocated memory was 44.0 MB in the beginning and 185.1 MB in the end (delta: 141.0 MB). Free memory was 22.2 MB in the beginning and 53.1 MB in the end (delta: -30.9 MB). Peak memory consumption was 110.1 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,922 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 32.5 MB. Free memory was 10.1 MB in the beginning and 10.1 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.51 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 21.3 MB in the beginning and 11.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 89.18 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 11.5 MB in the beginning and 28.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,924 INFO L168 Benchmark]: Boogie Preprocessor took 46.88 ms. Allocated memory is still 46.7 MB. Free memory was 28.6 MB in the beginning and 25.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,926 INFO L168 Benchmark]: RCFGBuilder took 2765.23 ms. Allocated memory was 46.7 MB in the beginning and 75.0 MB in the end (delta: 28.3 MB). Free memory was 25.8 MB in the beginning and 49.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 41.7 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,926 INFO L168 Benchmark]: TraceAbstraction took 10895.82 ms. Allocated memory was 75.0 MB in the beginning and 185.1 MB in the end (delta: 110.1 MB). Free memory was 49.4 MB in the beginning and 84.7 MB in the end (delta: -35.3 MB). Peak memory consumption was 74.8 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,927 INFO L168 Benchmark]: Witness Printer took 154.35 ms. Allocated memory is still 185.1 MB. Free memory was 84.7 MB in the beginning and 53.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.3 GB. [2020-10-20 02:52:37,930 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.29 ms. Allocated memory is still 32.5 MB. Free memory was 10.1 MB in the beginning and 10.1 MB in the end (delta: 47.5 kB). Peak memory consumption was 47.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 647.51 ms. Allocated memory was 44.0 MB in the beginning and 46.1 MB in the end (delta: 2.1 MB). Free memory was 21.3 MB in the beginning and 11.5 MB in the end (delta: 9.8 MB). Peak memory consumption was 11.9 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 89.18 ms. Allocated memory was 46.1 MB in the beginning and 46.7 MB in the end (delta: 524.3 kB). Free memory was 11.5 MB in the beginning and 28.6 MB in the end (delta: -17.1 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 46.88 ms. Allocated memory is still 46.7 MB. Free memory was 28.6 MB in the beginning and 25.8 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2765.23 ms. Allocated memory was 46.7 MB in the beginning and 75.0 MB in the end (delta: 28.3 MB). Free memory was 25.8 MB in the beginning and 49.4 MB in the end (delta: -23.6 MB). Peak memory consumption was 41.7 MB. Max. memory is 14.3 GB. * TraceAbstraction took 10895.82 ms. Allocated memory was 75.0 MB in the beginning and 185.1 MB in the end (delta: 110.1 MB). Free memory was 49.4 MB in the beginning and 84.7 MB in the end (delta: -35.3 MB). Peak memory consumption was 74.8 MB. Max. memory is 14.3 GB. * Witness Printer took 154.35 ms. Allocated memory is still 185.1 MB. Free memory was 84.7 MB in the beginning and 53.1 MB in the end (delta: 31.6 MB). Peak memory consumption was 31.6 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1894 VarBasedMoverChecksPositive, 101 VarBasedMoverChecksNegative, 43 SemBasedMoverChecksPositive, 58 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 212 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.4s, 132 PlacesBefore, 45 PlacesAfterwards, 122 TransitionsBefore, 33 TransitionsAfterwards, 2734 CoEnabledTransitionPairs, 9 FixpointIterations, 43 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 9159 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t349; [L872] FCALL, FORK 0 pthread_create(&t349, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t350; [L874] FCALL, FORK 0 pthread_create(&t350, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t351; [L876] FCALL, FORK 0 pthread_create(&t351, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t352; [L878] FCALL, FORK 0 pthread_create(&t352, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1) [L836] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L838] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L838] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 [L796] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L800] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L801] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L801] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix013_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 120 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 337 SDtfs, 372 SDslu, 587 SDs, 0 SdLazy, 208 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3010occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 212 NumberOfCodeBlocks, 212 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 176 ConstructedInterpolants, 0 QuantifiedInterpolants, 16249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...