./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix046_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix046_rmo.oepc.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 e2f62f7cd67498c54e99a6212a8a5014bc650033 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-5485861 [2020-10-26 00:22:10,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-26 00:22:10,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-26 00:22:10,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-26 00:22:10,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-26 00:22:10,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-26 00:22:10,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-26 00:22:10,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-26 00:22:10,190 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-26 00:22:10,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-26 00:22:10,198 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-26 00:22:10,203 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-26 00:22:10,204 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-26 00:22:10,206 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-26 00:22:10,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-26 00:22:10,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-26 00:22:10,212 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-26 00:22:10,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-26 00:22:10,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-26 00:22:10,222 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-26 00:22:10,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-26 00:22:10,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-26 00:22:10,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-26 00:22:10,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-26 00:22:10,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-26 00:22:10,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-26 00:22:10,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-26 00:22:10,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-26 00:22:10,246 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-26 00:22:10,247 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-26 00:22:10,247 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-26 00:22:10,248 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-26 00:22:10,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-26 00:22:10,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-26 00:22:10,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-26 00:22:10,255 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-26 00:22:10,256 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-26 00:22:10,256 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-26 00:22:10,257 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-26 00:22:10,259 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-26 00:22:10,259 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-26 00:22:10,260 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-26 00:22:10,319 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-26 00:22:10,320 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-26 00:22:10,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-26 00:22:10,323 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-26 00:22:10,324 INFO L138 SettingsManager]: * Use SBE=true [2020-10-26 00:22:10,324 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-26 00:22:10,324 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-26 00:22:10,324 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-26 00:22:10,325 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-26 00:22:10,325 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-26 00:22:10,326 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-26 00:22:10,327 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-26 00:22:10,327 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-26 00:22:10,327 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-26 00:22:10,327 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-26 00:22:10,328 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-26 00:22:10,328 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-26 00:22:10,328 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-26 00:22:10,328 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-26 00:22:10,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-26 00:22:10,329 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-26 00:22:10,329 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-26 00:22:10,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-26 00:22:10,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-26 00:22:10,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-26 00:22:10,330 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-26 00:22:10,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-26 00:22:10,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-26 00:22:10,331 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-26 00:22:10,331 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e2f62f7cd67498c54e99a6212a8a5014bc650033 [2020-10-26 00:22:10,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-26 00:22:10,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-26 00:22:10,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-26 00:22:10,814 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-26 00:22:10,815 INFO L275 PluginConnector]: CDTParser initialized [2020-10-26 00:22:10,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix046_rmo.oepc.i [2020-10-26 00:22:10,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a21d3d2/979bfb7654a040fbbe5c292a29c2ede8/FLAGe6f02b58d [2020-10-26 00:22:11,594 INFO L306 CDTParser]: Found 1 translation units. [2020-10-26 00:22:11,595 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix046_rmo.oepc.i [2020-10-26 00:22:11,623 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a21d3d2/979bfb7654a040fbbe5c292a29c2ede8/FLAGe6f02b58d [2020-10-26 00:22:11,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/95a21d3d2/979bfb7654a040fbbe5c292a29c2ede8 [2020-10-26 00:22:11,837 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-26 00:22:11,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-26 00:22:11,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-26 00:22:11,846 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-26 00:22:11,850 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-26 00:22:11,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:22:11" (1/1) ... [2020-10-26 00:22:11,854 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75d2ed3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:11, skipping insertion in model container [2020-10-26 00:22:11,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 12:22:11" (1/1) ... [2020-10-26 00:22:11,863 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-26 00:22:11,941 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-26 00:22:12,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:22:12,517 INFO L203 MainTranslator]: Completed pre-run [2020-10-26 00:22:12,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-26 00:22:12,720 INFO L208 MainTranslator]: Completed translation [2020-10-26 00:22:12,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12 WrapperNode [2020-10-26 00:22:12,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-26 00:22:12,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-26 00:22:12,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-26 00:22:12,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-26 00:22:12,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,800 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-26 00:22:12,801 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-26 00:22:12,801 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-26 00:22:12,801 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-26 00:22:12,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,817 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,817 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (1/1) ... [2020-10-26 00:22:12,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-26 00:22:12,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-26 00:22:12,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-26 00:22:12,846 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-26 00:22:12,847 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (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-26 00:22:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-26 00:22:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-26 00:22:12,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-26 00:22:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-26 00:22:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-26 00:22:12,926 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-26 00:22:12,926 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-26 00:22:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-26 00:22:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-26 00:22:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-26 00:22:12,927 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-26 00:22:12,927 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-26 00:22:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-26 00:22:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-26 00:22:12,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-26 00:22:12,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-26 00:22:12,930 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-26 00:22:15,597 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-26 00:22:15,597 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-26 00:22:15,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:22:15 BoogieIcfgContainer [2020-10-26 00:22:15,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-26 00:22:15,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-26 00:22:15,602 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-26 00:22:15,606 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-26 00:22:15,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 12:22:11" (1/3) ... [2020-10-26 00:22:15,607 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf105fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:22:15, skipping insertion in model container [2020-10-26 00:22:15,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 12:22:12" (2/3) ... [2020-10-26 00:22:15,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bf105fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 12:22:15, skipping insertion in model container [2020-10-26 00:22:15,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:22:15" (3/3) ... [2020-10-26 00:22:15,610 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_rmo.oepc.i [2020-10-26 00:22:15,622 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-26 00:22:15,622 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-26 00:22:15,628 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-26 00:22:15,629 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-26 00:22:15,678 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,679 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,679 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,680 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,680 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,681 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,682 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,682 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,683 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,684 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,685 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,685 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,686 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,686 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,686 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,687 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,688 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,689 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,689 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,690 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,690 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,691 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,692 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,693 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,693 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,694 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,694 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,695 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,696 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,697 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,698 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,699 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,700 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,701 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,702 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,703 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,705 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,706 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,707 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,708 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,710 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,710 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,711 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,712 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,713 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,717 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,717 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,718 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,725 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,726 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,726 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,726 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,727 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,728 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,729 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,730 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,731 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,732 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,733 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,735 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,735 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,736 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,737 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,737 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,738 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,738 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-26 00:22:15,740 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-26 00:22:15,753 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-26 00:22:15,776 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-26 00:22:15,776 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-26 00:22:15,777 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-26 00:22:15,777 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-26 00:22:15,777 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-26 00:22:15,777 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-26 00:22:15,777 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-26 00:22:15,778 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-26 00:22:15,791 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-26 00:22:15,793 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 123 transitions, 266 flow [2020-10-26 00:22:15,797 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 123 transitions, 266 flow [2020-10-26 00:22:15,799 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 133 places, 123 transitions, 266 flow [2020-10-26 00:22:15,855 INFO L129 PetriNetUnfolder]: 3/119 cut-off events. [2020-10-26 00:22:15,856 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-26 00:22:15,860 INFO L80 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 99 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-10-26 00:22:15,865 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-10-26 00:22:16,317 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-10-26 00:22:16,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:16,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:16,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:16,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:16,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:16,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:16,684 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:16,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:16,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:16,723 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:16,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:16,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:16,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:16,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:16,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:16,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:16,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:16,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:16,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:16,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:16,826 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:16,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:16,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:16,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:16,839 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:22:16,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:16,846 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-26 00:22:16,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:16,848 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-26 00:22:16,849 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:16,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:16,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:22:16,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:22:16,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:17,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,073 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,155 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,195 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,198 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,276 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,282 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,362 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,412 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,578 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,603 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,604 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,607 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,609 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,731 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:17,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:17,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:17,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:17,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-26 00:22:17,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:18,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:18,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-26 00:22:18,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:22:18,175 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:18,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:18,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:18,218 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:18,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:18,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:18,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:18,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:18,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:18,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:22:18,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:18,226 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-26 00:22:18,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:18,227 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-26 00:22:18,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:18,773 WARN L193 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-26 00:22:18,895 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-26 00:22:19,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,088 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,382 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,387 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,408 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,483 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:22:19,486 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:22:19,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,532 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:22:19,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,534 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-26 00:22:19,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,536 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-26 00:22:19,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,570 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,592 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,594 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,672 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,674 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,674 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-26 00:22:19,678 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-26 00:22:19,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,680 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-26 00:22:19,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,682 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-26 00:22:19,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-26 00:22:19,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-26 00:22:19,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-26 00:22:19,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,772 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,773 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,796 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,798 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,801 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,855 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,870 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,872 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,874 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,876 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,901 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,960 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,962 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-26 00:22:19,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-26 00:22:19,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-26 00:22:19,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:19,981 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-26 00:22:19,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-26 00:22:20,541 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2020-10-26 00:22:21,708 WARN L193 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-10-26 00:22:21,976 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-26 00:22:22,101 INFO L131 LiptonReduction]: Checked pairs total: 8235 [2020-10-26 00:22:22,101 INFO L133 LiptonReduction]: Total number of compositions: 103 [2020-10-26 00:22:22,107 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 34 transitions, 88 flow [2020-10-26 00:22:22,463 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 4874 states. [2020-10-26 00:22:22,465 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states. [2020-10-26 00:22:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-26 00:22:22,471 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:22,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-26 00:22:22,472 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1248956, now seen corresponding path program 1 times [2020-10-26 00:22:22,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:22,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290494035] [2020-10-26 00:22:22,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:22,791 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-26 00:22:22,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290494035] [2020-10-26 00:22:22,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:22,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:22:22,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670788026] [2020-10-26 00:22:22,797 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:22:22,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:22:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:22:22,816 INFO L87 Difference]: Start difference. First operand 4874 states. Second operand 3 states. [2020-10-26 00:22:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:23,036 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2020-10-26 00:22:23,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:22:23,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-26 00:22:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:23,108 INFO L225 Difference]: With dead ends: 4062 [2020-10-26 00:22:23,108 INFO L226 Difference]: Without dead ends: 3312 [2020-10-26 00:22:23,110 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-26 00:22:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3312 states. [2020-10-26 00:22:23,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 3312. [2020-10-26 00:22:23,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3312 states. [2020-10-26 00:22:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3312 states to 3312 states and 12950 transitions. [2020-10-26 00:22:23,439 INFO L78 Accepts]: Start accepts. Automaton has 3312 states and 12950 transitions. Word has length 3 [2020-10-26 00:22:23,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:23,439 INFO L481 AbstractCegarLoop]: Abstraction has 3312 states and 12950 transitions. [2020-10-26 00:22:23,439 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:22:23,440 INFO L276 IsEmpty]: Start isEmpty. Operand 3312 states and 12950 transitions. [2020-10-26 00:22:23,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-26 00:22:23,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:23,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:23,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-26 00:22:23,446 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -2053809436, now seen corresponding path program 1 times [2020-10-26 00:22:23,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:23,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274527264] [2020-10-26 00:22:23,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:23,583 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-26 00:22:23,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274527264] [2020-10-26 00:22:23,583 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:23,583 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:22:23,584 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594360029] [2020-10-26 00:22:23,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:22:23,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:23,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:22:23,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:22:23,586 INFO L87 Difference]: Start difference. First operand 3312 states and 12950 transitions. Second operand 3 states. [2020-10-26 00:22:23,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:23,630 INFO L93 Difference]: Finished difference Result 3062 states and 11850 transitions. [2020-10-26 00:22:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:22:23,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-26 00:22:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:23,660 INFO L225 Difference]: With dead ends: 3062 [2020-10-26 00:22:23,661 INFO L226 Difference]: Without dead ends: 3062 [2020-10-26 00:22:23,662 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-26 00:22:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3062 states. [2020-10-26 00:22:23,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3062 to 3062. [2020-10-26 00:22:23,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2020-10-26 00:22:23,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 11850 transitions. [2020-10-26 00:22:23,796 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 11850 transitions. Word has length 11 [2020-10-26 00:22:23,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:23,797 INFO L481 AbstractCegarLoop]: Abstraction has 3062 states and 11850 transitions. [2020-10-26 00:22:23,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:22:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 11850 transitions. [2020-10-26 00:22:23,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-26 00:22:23,805 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:23,806 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:23,806 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-26 00:22:23,806 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:23,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:23,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1927309425, now seen corresponding path program 1 times [2020-10-26 00:22:23,816 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:23,817 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287614038] [2020-10-26 00:22:23,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:23,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:24,004 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-26 00:22:24,006 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287614038] [2020-10-26 00:22:24,006 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:24,006 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-26 00:22:24,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355455891] [2020-10-26 00:22:24,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:22:24,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:24,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:22:24,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:22:24,009 INFO L87 Difference]: Start difference. First operand 3062 states and 11850 transitions. Second operand 3 states. [2020-10-26 00:22:24,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:24,056 INFO L93 Difference]: Finished difference Result 3022 states and 11668 transitions. [2020-10-26 00:22:24,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:22:24,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-26 00:22:24,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:24,086 INFO L225 Difference]: With dead ends: 3022 [2020-10-26 00:22:24,086 INFO L226 Difference]: Without dead ends: 3022 [2020-10-26 00:22:24,086 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-26 00:22:24,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2020-10-26 00:22:24,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 3022. [2020-10-26 00:22:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3022 states. [2020-10-26 00:22:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3022 states to 3022 states and 11668 transitions. [2020-10-26 00:22:24,206 INFO L78 Accepts]: Start accepts. Automaton has 3022 states and 11668 transitions. Word has length 13 [2020-10-26 00:22:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:24,206 INFO L481 AbstractCegarLoop]: Abstraction has 3022 states and 11668 transitions. [2020-10-26 00:22:24,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:22:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3022 states and 11668 transitions. [2020-10-26 00:22:24,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-26 00:22:24,210 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:24,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:24,210 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-26 00:22:24,211 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:24,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash -382982227, now seen corresponding path program 1 times [2020-10-26 00:22:24,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:24,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938193257] [2020-10-26 00:22:24,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:24,330 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-26 00:22:24,330 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938193257] [2020-10-26 00:22:24,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:24,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:22:24,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885247036] [2020-10-26 00:22:24,331 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:22:24,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:24,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:22:24,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:22:24,332 INFO L87 Difference]: Start difference. First operand 3022 states and 11668 transitions. Second operand 4 states. [2020-10-26 00:22:24,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:24,442 INFO L93 Difference]: Finished difference Result 2964 states and 10373 transitions. [2020-10-26 00:22:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-26 00:22:24,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-26 00:22:24,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:24,463 INFO L225 Difference]: With dead ends: 2964 [2020-10-26 00:22:24,463 INFO L226 Difference]: Without dead ends: 2214 [2020-10-26 00:22:24,464 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-26 00:22:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2214 states. [2020-10-26 00:22:24,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2214 to 2214. [2020-10-26 00:22:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2214 states. [2020-10-26 00:22:24,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2214 states to 2214 states and 7628 transitions. [2020-10-26 00:22:24,582 INFO L78 Accepts]: Start accepts. Automaton has 2214 states and 7628 transitions. Word has length 14 [2020-10-26 00:22:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:24,582 INFO L481 AbstractCegarLoop]: Abstraction has 2214 states and 7628 transitions. [2020-10-26 00:22:24,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:22:24,582 INFO L276 IsEmpty]: Start isEmpty. Operand 2214 states and 7628 transitions. [2020-10-26 00:22:24,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-26 00:22:24,586 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:24,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:24,587 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-26 00:22:24,587 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1079458941, now seen corresponding path program 1 times [2020-10-26 00:22:24,588 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:24,588 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747972356] [2020-10-26 00:22:24,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:24,672 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-26 00:22:24,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747972356] [2020-10-26 00:22:24,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:24,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:22:24,673 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637202572] [2020-10-26 00:22:24,673 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:22:24,673 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:24,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:22:24,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:22:24,676 INFO L87 Difference]: Start difference. First operand 2214 states and 7628 transitions. Second operand 3 states. [2020-10-26 00:22:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:24,711 INFO L93 Difference]: Finished difference Result 3270 states and 11011 transitions. [2020-10-26 00:22:24,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:22:24,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-26 00:22:24,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:24,746 INFO L225 Difference]: With dead ends: 3270 [2020-10-26 00:22:24,746 INFO L226 Difference]: Without dead ends: 2310 [2020-10-26 00:22:24,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 00:22:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2020-10-26 00:22:24,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2178. [2020-10-26 00:22:24,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-26 00:22:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 7215 transitions. [2020-10-26 00:22:24,821 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 7215 transitions. Word has length 17 [2020-10-26 00:22:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:24,822 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 7215 transitions. [2020-10-26 00:22:24,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:22:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 7215 transitions. [2020-10-26 00:22:24,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-26 00:22:24,826 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:24,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:24,826 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-26 00:22:24,826 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:24,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1005001136, now seen corresponding path program 1 times [2020-10-26 00:22:24,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:24,827 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042847570] [2020-10-26 00:22:24,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:24,868 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-26 00:22:24,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042847570] [2020-10-26 00:22:24,869 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:24,869 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-26 00:22:24,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410644601] [2020-10-26 00:22:24,870 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-26 00:22:24,870 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:24,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-26 00:22:24,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-26 00:22:24,871 INFO L87 Difference]: Start difference. First operand 2178 states and 7215 transitions. Second operand 3 states. [2020-10-26 00:22:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:24,935 INFO L93 Difference]: Finished difference Result 3203 states and 10351 transitions. [2020-10-26 00:22:24,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-26 00:22:24,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-10-26 00:22:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:24,945 INFO L225 Difference]: With dead ends: 3203 [2020-10-26 00:22:24,946 INFO L226 Difference]: Without dead ends: 2334 [2020-10-26 00:22:24,946 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-26 00:22:24,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2334 states. [2020-10-26 00:22:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2334 to 2178. [2020-10-26 00:22:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2178 states. [2020-10-26 00:22:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2178 states to 2178 states and 6968 transitions. [2020-10-26 00:22:25,016 INFO L78 Accepts]: Start accepts. Automaton has 2178 states and 6968 transitions. Word has length 17 [2020-10-26 00:22:25,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:25,017 INFO L481 AbstractCegarLoop]: Abstraction has 2178 states and 6968 transitions. [2020-10-26 00:22:25,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-26 00:22:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 2178 states and 6968 transitions. [2020-10-26 00:22:25,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-26 00:22:25,021 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:25,021 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-26 00:22:25,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-26 00:22:25,022 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:25,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:25,022 INFO L82 PathProgramCache]: Analyzing trace with hash -676228949, now seen corresponding path program 1 times [2020-10-26 00:22:25,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:25,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8665992] [2020-10-26 00:22:25,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:25,189 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-26 00:22:25,189 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8665992] [2020-10-26 00:22:25,189 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:25,189 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-26 00:22:25,190 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384114889] [2020-10-26 00:22:25,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-26 00:22:25,190 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:25,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-26 00:22:25,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-26 00:22:25,191 INFO L87 Difference]: Start difference. First operand 2178 states and 6968 transitions. Second operand 5 states. [2020-10-26 00:22:25,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:25,266 INFO L93 Difference]: Finished difference Result 1832 states and 5382 transitions. [2020-10-26 00:22:25,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:22:25,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-10-26 00:22:25,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:25,272 INFO L225 Difference]: With dead ends: 1832 [2020-10-26 00:22:25,272 INFO L226 Difference]: Without dead ends: 1402 [2020-10-26 00:22:25,273 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-26 00:22:25,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-10-26 00:22:25,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2020-10-26 00:22:25,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2020-10-26 00:22:25,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 4054 transitions. [2020-10-26 00:22:25,312 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 4054 transitions. Word has length 17 [2020-10-26 00:22:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:25,313 INFO L481 AbstractCegarLoop]: Abstraction has 1402 states and 4054 transitions. [2020-10-26 00:22:25,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-26 00:22:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 4054 transitions. [2020-10-26 00:22:25,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-26 00:22:25,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:25,317 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-26 00:22:25,317 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-26 00:22:25,317 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:25,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:25,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1166926340, now seen corresponding path program 1 times [2020-10-26 00:22:25,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:25,318 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720151081] [2020-10-26 00:22:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:25,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:25,531 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-26 00:22:25,531 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720151081] [2020-10-26 00:22:25,531 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:25,531 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-26 00:22:25,532 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055483546] [2020-10-26 00:22:25,532 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-26 00:22:25,532 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:25,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-26 00:22:25,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-26 00:22:25,533 INFO L87 Difference]: Start difference. First operand 1402 states and 4054 transitions. Second operand 6 states. [2020-10-26 00:22:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:25,631 INFO L93 Difference]: Finished difference Result 1239 states and 3550 transitions. [2020-10-26 00:22:25,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-26 00:22:25,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-26 00:22:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:25,638 INFO L225 Difference]: With dead ends: 1239 [2020-10-26 00:22:25,638 INFO L226 Difference]: Without dead ends: 1063 [2020-10-26 00:22:25,639 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-26 00:22:25,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2020-10-26 00:22:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1063. [2020-10-26 00:22:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1063 states. [2020-10-26 00:22:25,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1063 states to 1063 states and 3070 transitions. [2020-10-26 00:22:25,673 INFO L78 Accepts]: Start accepts. Automaton has 1063 states and 3070 transitions. Word has length 20 [2020-10-26 00:22:25,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:25,673 INFO L481 AbstractCegarLoop]: Abstraction has 1063 states and 3070 transitions. [2020-10-26 00:22:25,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-26 00:22:25,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 3070 transitions. [2020-10-26 00:22:25,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-26 00:22:25,679 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:25,679 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] [2020-10-26 00:22:25,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-26 00:22:25,679 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:25,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:25,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1772040044, now seen corresponding path program 1 times [2020-10-26 00:22:25,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:25,683 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116897942] [2020-10-26 00:22:25,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:25,835 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-26 00:22:25,835 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116897942] [2020-10-26 00:22:25,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:25,836 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:22:25,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469854333] [2020-10-26 00:22:25,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-26 00:22:25,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:25,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-26 00:22:25,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-26 00:22:25,838 INFO L87 Difference]: Start difference. First operand 1063 states and 3070 transitions. Second operand 7 states. [2020-10-26 00:22:25,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:25,933 INFO L93 Difference]: Finished difference Result 1033 states and 3010 transitions. [2020-10-26 00:22:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-26 00:22:25,934 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-26 00:22:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:25,936 INFO L225 Difference]: With dead ends: 1033 [2020-10-26 00:22:25,936 INFO L226 Difference]: Without dead ends: 545 [2020-10-26 00:22:25,937 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-26 00:22:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2020-10-26 00:22:25,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 545. [2020-10-26 00:22:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2020-10-26 00:22:25,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 1592 transitions. [2020-10-26 00:22:25,953 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 1592 transitions. Word has length 24 [2020-10-26 00:22:25,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:25,954 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 1592 transitions. [2020-10-26 00:22:25,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-26 00:22:25,954 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 1592 transitions. [2020-10-26 00:22:25,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 00:22:25,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:25,957 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, 1, 1] [2020-10-26 00:22:25,957 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-26 00:22:25,957 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:25,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:25,958 INFO L82 PathProgramCache]: Analyzing trace with hash -457680553, now seen corresponding path program 1 times [2020-10-26 00:22:25,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:25,959 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184144202] [2020-10-26 00:22:25,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:26,039 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-26 00:22:26,039 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184144202] [2020-10-26 00:22:26,039 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:26,039 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-26 00:22:26,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333126488] [2020-10-26 00:22:26,040 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-26 00:22:26,040 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:26,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-26 00:22:26,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-26 00:22:26,041 INFO L87 Difference]: Start difference. First operand 545 states and 1592 transitions. Second operand 4 states. [2020-10-26 00:22:26,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:26,066 INFO L93 Difference]: Finished difference Result 850 states and 2456 transitions. [2020-10-26 00:22:26,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-26 00:22:26,066 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-10-26 00:22:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:26,069 INFO L225 Difference]: With dead ends: 850 [2020-10-26 00:22:26,069 INFO L226 Difference]: Without dead ends: 343 [2020-10-26 00:22:26,069 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-26 00:22:26,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-10-26 00:22:26,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2020-10-26 00:22:26,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2020-10-26 00:22:26,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 940 transitions. [2020-10-26 00:22:26,080 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 940 transitions. Word has length 28 [2020-10-26 00:22:26,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:26,081 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 940 transitions. [2020-10-26 00:22:26,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-26 00:22:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 940 transitions. [2020-10-26 00:22:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 00:22:26,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:26,084 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, 1, 1] [2020-10-26 00:22:26,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-26 00:22:26,085 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1525900279, now seen corresponding path program 2 times [2020-10-26 00:22:26,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:26,086 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005203553] [2020-10-26 00:22:26,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:26,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:26,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-26 00:22:26,734 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005203553] [2020-10-26 00:22:26,734 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:26,734 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-26 00:22:26,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971974971] [2020-10-26 00:22:26,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-26 00:22:26,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:26,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-26 00:22:26,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-10-26 00:22:26,736 INFO L87 Difference]: Start difference. First operand 343 states and 940 transitions. Second operand 12 states. [2020-10-26 00:22:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:27,513 INFO L93 Difference]: Finished difference Result 540 states and 1429 transitions. [2020-10-26 00:22:27,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-26 00:22:27,514 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-26 00:22:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:27,515 INFO L225 Difference]: With dead ends: 540 [2020-10-26 00:22:27,517 INFO L226 Difference]: Without dead ends: 450 [2020-10-26 00:22:27,518 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2020-10-26 00:22:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-26 00:22:27,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-26 00:22:27,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-26 00:22:27,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1218 transitions. [2020-10-26 00:22:27,535 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1218 transitions. Word has length 28 [2020-10-26 00:22:27,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:27,537 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1218 transitions. [2020-10-26 00:22:27,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-26 00:22:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1218 transitions. [2020-10-26 00:22:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 00:22:27,540 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:27,540 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, 1, 1] [2020-10-26 00:22:27,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-26 00:22:27,540 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1133038043, now seen corresponding path program 3 times [2020-10-26 00:22:27,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:27,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931670051] [2020-10-26 00:22:27,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-26 00:22:28,089 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-26 00:22:28,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931670051] [2020-10-26 00:22:28,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-26 00:22:28,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-26 00:22:28,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758085995] [2020-10-26 00:22:28,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-26 00:22:28,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-26 00:22:28,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-26 00:22:28,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-26 00:22:28,091 INFO L87 Difference]: Start difference. First operand 450 states and 1218 transitions. Second operand 8 states. [2020-10-26 00:22:28,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-26 00:22:28,295 INFO L93 Difference]: Finished difference Result 567 states and 1491 transitions. [2020-10-26 00:22:28,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-26 00:22:28,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-10-26 00:22:28,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-26 00:22:28,297 INFO L225 Difference]: With dead ends: 567 [2020-10-26 00:22:28,297 INFO L226 Difference]: Without dead ends: 312 [2020-10-26 00:22:28,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-26 00:22:28,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-10-26 00:22:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 273. [2020-10-26 00:22:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-26 00:22:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 710 transitions. [2020-10-26 00:22:28,305 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 710 transitions. Word has length 28 [2020-10-26 00:22:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-26 00:22:28,305 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 710 transitions. [2020-10-26 00:22:28,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-26 00:22:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 710 transitions. [2020-10-26 00:22:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-26 00:22:28,307 INFO L414 BasicCegarLoop]: Found error trace [2020-10-26 00:22:28,307 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, 1, 1] [2020-10-26 00:22:28,307 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-26 00:22:28,307 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-26 00:22:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-26 00:22:28,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1265034487, now seen corresponding path program 4 times [2020-10-26 00:22:28,308 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-26 00:22:28,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495728020] [2020-10-26 00:22:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-26 00:22:28,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:22:28,388 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:22:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-26 00:22:28,483 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-26 00:22:28,542 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-26 00:22:28,542 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-26 00:22:28,543 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-26 00:22:28,544 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-26 00:22:28,574 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L2-->L887: Formula: (let ((.cse6 (= (mod ~b$w_buff1_used~0_In969583959 256) 0)) (.cse7 (= (mod ~b$r_buff1_thd0~0_In969583959 256) 0)) (.cse8 (= (mod ~b$r_buff0_thd0~0_In969583959 256) 0)) (.cse9 (= (mod ~b$w_buff0_used~0_In969583959 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out969583959)) (or (and (or (and .cse0 (= ~b$w_buff1~0_In969583959 ~b~0_Out969583959) .cse1) (and (= ~b~0_In969583959 ~b~0_Out969583959) .cse2)) .cse3) (and .cse4 .cse5 (= ~b$w_buff0~0_In969583959 ~b~0_Out969583959))) (= ~b$r_buff0_thd0~0_Out969583959 ~b$r_buff0_thd0~0_In969583959) (or (and (= ~b$w_buff0_used~0_In969583959 ~b$w_buff0_used~0_Out969583959) .cse3) (and .cse4 .cse5 (= ~b$w_buff0_used~0_Out969583959 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959| ULTIMATE.start_assume_abort_if_not_~cond_Out969583959) (or (and .cse0 (= ~b$w_buff1_used~0_Out969583959 0) .cse1) (and .cse2 (= ~b$w_buff1_used~0_In969583959 ~b$w_buff1_used~0_Out969583959))) (= ~b$r_buff1_thd0~0_Out969583959 ~b$r_buff1_thd0~0_In969583959)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In969583959, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In969583959, ~b$w_buff1_used~0=~b$w_buff1_used~0_In969583959, ~b~0=~b~0_In969583959, ~b$w_buff1~0=~b$w_buff1~0_In969583959, ~b$w_buff0~0=~b$w_buff0~0_In969583959, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In969583959} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out969583959, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out969583959|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out969583959|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out969583959|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out969583959|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out969583959, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out969583959|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out969583959|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out969583959, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out969583959, ~b~0=~b~0_Out969583959, ~b$w_buff1~0=~b$w_buff1~0_In969583959, ~b$w_buff0~0=~b$w_buff0~0_In969583959, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out969583959} AuxVars[] AssignedVars[~b$w_buff0_used~0, ULTIMATE.start_main_#t~ite60, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0] because there is no mapped edge [2020-10-26 00:22:28,584 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-26 00:22:28,584 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,584 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-26 00:22:28,585 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [751] [2020-10-26 00:22:28,589 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-26 00:22:28,589 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,590 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-26 00:22:28,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,590 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-26 00:22:28,590 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,591 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-26 00:22:28,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,591 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-26 00:22:28,591 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,592 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-26 00:22:28,592 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,592 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-26 00:22:28,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,593 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-26 00:22:28,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,593 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-26 00:22:28,593 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,593 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-26 00:22:28,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,594 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-26 00:22:28,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,594 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-26 00:22:28,594 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,595 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-26 00:22:28,595 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,600 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-26 00:22:28,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,601 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-26 00:22:28,601 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,601 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-26 00:22:28,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,602 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-26 00:22:28,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,602 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-26 00:22:28,602 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,602 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-26 00:22:28,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,603 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-26 00:22:28,603 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,603 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-26 00:22:28,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,604 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-26 00:22:28,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,604 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-26 00:22:28,604 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,605 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-26 00:22:28,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,605 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-26 00:22:28,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,605 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-26 00:22:28,605 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,606 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-26 00:22:28,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,606 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-26 00:22:28,606 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,606 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-26 00:22:28,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,607 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-26 00:22:28,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,607 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-26 00:22:28,607 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,607 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-26 00:22:28,608 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 12:22:28 BasicIcfg [2020-10-26 00:22:28,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-26 00:22:28,715 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-26 00:22:28,715 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-26 00:22:28,715 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-26 00:22:28,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 12:22:15" (3/4) ... [2020-10-26 00:22:28,718 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-26 00:22:28,741 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1207] [1207] L2-->L887: Formula: (let ((.cse6 (= (mod ~b$w_buff1_used~0_In969583959 256) 0)) (.cse7 (= (mod ~b$r_buff1_thd0~0_In969583959 256) 0)) (.cse8 (= (mod ~b$r_buff0_thd0~0_In969583959 256) 0)) (.cse9 (= (mod ~b$w_buff0_used~0_In969583959 256) 0))) (let ((.cse3 (or .cse8 .cse9)) (.cse4 (not .cse9)) (.cse5 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6)) (.cse2 (or .cse6 .cse7))) (and (not (= 0 ULTIMATE.start_assume_abort_if_not_~cond_Out969583959)) (or (and (or (and .cse0 (= ~b$w_buff1~0_In969583959 ~b~0_Out969583959) .cse1) (and (= ~b~0_In969583959 ~b~0_Out969583959) .cse2)) .cse3) (and .cse4 .cse5 (= ~b$w_buff0~0_In969583959 ~b~0_Out969583959))) (= ~b$r_buff0_thd0~0_Out969583959 ~b$r_buff0_thd0~0_In969583959) (or (and (= ~b$w_buff0_used~0_In969583959 ~b$w_buff0_used~0_Out969583959) .cse3) (and .cse4 .cse5 (= ~b$w_buff0_used~0_Out969583959 0))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959| ULTIMATE.start_assume_abort_if_not_~cond_Out969583959) (or (and .cse0 (= ~b$w_buff1_used~0_Out969583959 0) .cse1) (and .cse2 (= ~b$w_buff1_used~0_In969583959 ~b$w_buff1_used~0_Out969583959))) (= ~b$r_buff1_thd0~0_Out969583959 ~b$r_buff1_thd0~0_In969583959)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In969583959, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In969583959, ~b$w_buff1_used~0=~b$w_buff1_used~0_In969583959, ~b~0=~b~0_In969583959, ~b$w_buff1~0=~b$w_buff1~0_In969583959, ~b$w_buff0~0=~b$w_buff0~0_In969583959, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In969583959} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out969583959, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out969583959|, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out969583959|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out969583959|, ULTIMATE.start_main_#t~ite56=|ULTIMATE.start_main_#t~ite56_Out969583959|, ~b$w_buff0_used~0=~b$w_buff0_used~0_Out969583959, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In969583959|, ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out969583959|, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out969583959|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out969583959, ~b$w_buff1_used~0=~b$w_buff1_used~0_Out969583959, ~b~0=~b~0_Out969583959, ~b$w_buff1~0=~b$w_buff1~0_In969583959, ~b$w_buff0~0=~b$w_buff0~0_In969583959, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_Out969583959} AuxVars[] AssignedVars[~b$w_buff0_used~0, ULTIMATE.start_main_#t~ite60, ~b$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_assume_abort_if_not_~cond, ~b$w_buff1_used~0, ~b~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ULTIMATE.start_main_#t~ite56, ~b$r_buff0_thd0~0] because there is no mapped edge [2020-10-26 00:22:28,743 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-26 00:22:28,743 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,743 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-26 00:22:28,744 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [751] [2020-10-26 00:22:28,745 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-26 00:22:28,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,745 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-26 00:22:28,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,745 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-26 00:22:28,745 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,745 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-26 00:22:28,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,746 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-26 00:22:28,746 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,746 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-26 00:22:28,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,747 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-26 00:22:28,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,747 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-26 00:22:28,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,747 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-26 00:22:28,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,748 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-26 00:22:28,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,748 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-26 00:22:28,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,748 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-26 00:22:28,748 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,748 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-26 00:22:28,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,749 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-26 00:22:28,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,749 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-26 00:22:28,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,749 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-26 00:22:28,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,750 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-26 00:22:28,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,750 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-26 00:22:28,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,750 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-26 00:22:28,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,751 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-26 00:22:28,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,751 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-26 00:22:28,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,751 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-26 00:22:28,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,752 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-26 00:22:28,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,752 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-26 00:22:28,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,752 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-26 00:22:28,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,752 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-26 00:22:28,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,753 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-26 00:22:28,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,753 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-26 00:22:28,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,753 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-26 00:22:28,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,754 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-26 00:22:28,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,754 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-26 00:22:28,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,754 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-26 00:22:28,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-26 00:22:28,845 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-26 00:22:28,849 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-26 00:22:28,851 INFO L168 Benchmark]: Toolchain (without parser) took 17011.80 ms. Allocated memory was 56.6 MB in the beginning and 400.6 MB in the end (delta: 343.9 MB). Free memory was 31.8 MB in the beginning and 256.0 MB in the end (delta: -224.2 MB). Peak memory consumption was 123.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,851 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 41.9 MB. Free memory was 21.9 MB in the beginning and 21.9 MB in the end (delta: 31.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-26 00:22:28,852 INFO L168 Benchmark]: CACSL2BoogieTranslator took 876.14 ms. Allocated memory is still 56.6 MB. Free memory was 31.2 MB in the beginning and 34.7 MB in the end (delta: -3.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,854 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.67 ms. Allocated memory is still 56.6 MB. Free memory was 34.7 MB in the beginning and 32.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,854 INFO L168 Benchmark]: Boogie Preprocessor took 44.70 ms. Allocated memory is still 56.6 MB. Free memory was 32.1 MB in the beginning and 29.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,855 INFO L168 Benchmark]: RCFGBuilder took 2754.09 ms. Allocated memory was 56.6 MB in the beginning and 109.1 MB in the end (delta: 52.4 MB). Free memory was 29.5 MB in the beginning and 81.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,855 INFO L168 Benchmark]: TraceAbstraction took 13112.16 ms. Allocated memory was 109.1 MB in the beginning and 400.6 MB in the end (delta: 291.5 MB). Free memory was 81.0 MB in the beginning and 283.3 MB in the end (delta: -202.2 MB). Peak memory consumption was 281.2 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,856 INFO L168 Benchmark]: Witness Printer took 134.23 ms. Allocated memory is still 400.6 MB. Free memory was 283.3 MB in the beginning and 256.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2020-10-26 00:22:28,858 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 41.9 MB. Free memory was 21.9 MB in the beginning and 21.9 MB in the end (delta: 31.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 876.14 ms. Allocated memory is still 56.6 MB. Free memory was 31.2 MB in the beginning and 34.7 MB in the end (delta: -3.5 MB). Peak memory consumption was 13.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 77.67 ms. Allocated memory is still 56.6 MB. Free memory was 34.7 MB in the beginning and 32.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.70 ms. Allocated memory is still 56.6 MB. Free memory was 32.1 MB in the beginning and 29.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2754.09 ms. Allocated memory was 56.6 MB in the beginning and 109.1 MB in the end (delta: 52.4 MB). Free memory was 29.5 MB in the beginning and 81.0 MB in the end (delta: -51.5 MB). Peak memory consumption was 38.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 13112.16 ms. Allocated memory was 109.1 MB in the beginning and 400.6 MB in the end (delta: 291.5 MB). Free memory was 81.0 MB in the beginning and 283.3 MB in the end (delta: -202.2 MB). Peak memory consumption was 281.2 MB. Max. memory is 16.1 GB. * Witness Printer took 134.23 ms. Allocated memory is still 400.6 MB. Free memory was 283.3 MB in the beginning and 256.0 MB in the end (delta: 27.3 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2176 VarBasedMoverChecksPositive, 92 VarBasedMoverChecksNegative, 16 SemBasedMoverChecksPositive, 76 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 256 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.3s, 133 PlacesBefore, 47 PlacesAfterwards, 123 TransitionsBefore, 34 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 8235 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_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1233; [L870] FCALL, FORK 0 pthread_create(&t1233, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1234; [L872] FCALL, FORK 0 pthread_create(&t1234, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix046_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L873] 0 pthread_t t1235; [L874] FCALL, FORK 0 pthread_create(&t1235, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L875] 0 pthread_t t1236; [L876] FCALL, FORK 0 pthread_create(&t1236, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L808] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L837] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_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}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=2] [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] EXPR 1 b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b [L768] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] EXPR 4 b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b [L847] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] EXPR 2 b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b [L788] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L889] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_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", "mix046_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_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}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 121 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.6s, HoareTripleCheckerStatistics: 470 SDtfs, 639 SDslu, 880 SDs, 0 SdLazy, 667 SolverSat, 143 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4874occurred 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.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 327 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 248 NumberOfCodeBlocks, 248 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 208 ConstructedInterpolants, 0 QuantifiedInterpolants, 39382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...