./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6768c7a8354b7367355bf78153a1ca4e21b48fa .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 03:07:48,707 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:07:48,710 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:07:48,750 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:07:48,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:07:48,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:07:48,761 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:07:48,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:07:48,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:07:48,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:07:48,773 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:07:48,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:07:48,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:07:48,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:07:48,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:07:48,780 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:07:48,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:07:48,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:07:48,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:07:48,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:07:48,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:07:48,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:07:48,798 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:07:48,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:07:48,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:07:48,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:07:48,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:07:48,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:07:48,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:07:48,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:07:48,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:07:48,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:07:48,827 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:07:48,828 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:07:48,828 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:07:48,829 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:07:48,829 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:07:48,829 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:07:48,829 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:07:48,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:07:48,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:07:48,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:07:48,852 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:07:48,853 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:07:48,854 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:07:48,854 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:07:48,854 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:07:48,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:07:48,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:07:48,856 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:07:48,856 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:07:48,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:07:48,856 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:07:48,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:07:48,857 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:07:48,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:07:48,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:07:48,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:07:48,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:07:48,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:07:48,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:07:48,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:07:48,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:07:48,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:07:48,858 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:07:48,859 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:07:48,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6768c7a8354b7367355bf78153a1ca4e21b48fa [2020-10-20 03:07:49,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:07:49,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:07:49,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:07:49,084 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:07:49,085 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:07:49,086 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe031_power.opt.i [2020-10-20 03:07:49,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8362c5e/97000d3b8149458e8205ed8b324e854a/FLAG9a06b84d3 [2020-10-20 03:07:49,789 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:07:49,790 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe031_power.opt.i [2020-10-20 03:07:49,814 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8362c5e/97000d3b8149458e8205ed8b324e854a/FLAG9a06b84d3 [2020-10-20 03:07:50,084 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d8362c5e/97000d3b8149458e8205ed8b324e854a [2020-10-20 03:07:50,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:07:50,093 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:07:50,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:07:50,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:07:50,101 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:07:50,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:50,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aa19b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50, skipping insertion in model container [2020-10-20 03:07:50,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:50,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:07:50,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:07:50,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:07:50,696 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:07:50,814 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:07:50,902 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:07:50,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50 WrapperNode [2020-10-20 03:07:50,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:07:50,904 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:07:50,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:07:50,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:07:50,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:50,942 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:50,983 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:07:50,983 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:07:50,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:07:50,984 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:07:50,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:50,998 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,014 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,022 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... [2020-10-20 03:07:51,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:07:51,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:07:51,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:07:51,029 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:07:51,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:07:51,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:07:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:07:51,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:07:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:07:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:07:51,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:07:51,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:07:51,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:07:51,106 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:07:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:07:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:07:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:07:51,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:07:51,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:07:51,109 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:07:53,129 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:07:53,129 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-20 03:07:53,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:07:53 BoogieIcfgContainer [2020-10-20 03:07:53,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:07:53,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:07:53,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:07:53,136 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:07:53,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:07:50" (1/3) ... [2020-10-20 03:07:53,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449d6b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:07:53, skipping insertion in model container [2020-10-20 03:07:53,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:07:50" (2/3) ... [2020-10-20 03:07:53,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449d6b5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:07:53, skipping insertion in model container [2020-10-20 03:07:53,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:07:53" (3/3) ... [2020-10-20 03:07:53,141 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_power.opt.i [2020-10-20 03:07:53,153 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:07:53,153 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:07:53,161 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-20 03:07:53,162 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:07:53,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,192 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,192 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,193 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,193 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,194 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,195 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,196 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,197 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,198 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,198 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,198 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,199 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,199 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,200 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,200 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,201 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,202 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,203 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,207 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,208 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,208 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,209 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,209 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,210 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,211 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,217 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,217 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,219 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,220 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,221 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:07:53,223 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:07:53,238 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-20 03:07:53,261 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:07:53,262 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:07:53,262 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:07:53,262 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:07:53,262 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:07:53,263 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:07:53,263 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:07:53,263 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:07:53,279 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:07:53,283 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-20 03:07:53,286 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-20 03:07:53,288 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-20 03:07:53,341 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-20 03:07:53,342 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:07:53,347 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-20 03:07:53,351 INFO L117 LiptonReduction]: Number of co-enabled transitions 1746 [2020-10-20 03:07:53,464 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:53,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:53,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:53,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:53,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:53,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:53,634 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:53,637 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:53,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:53,643 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:53,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:53,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:53,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:07:53,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:53,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:53,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:07:53,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:07:53,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:53,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:54,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-20 03:07:54,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:54,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-20 03:07:54,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:07:54,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:07:54,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,262 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,297 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,372 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:07:54,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:07:54,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:07:54,379 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:54,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:54,428 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:54,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,430 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:54,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:54,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:54,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:54,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:54,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:54,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:54,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:54,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,445 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:54,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,708 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,709 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,725 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:54,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,727 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:54,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:54,972 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-10-20 03:07:55,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:55,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:55,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:07:55,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:55,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 1] term [2020-10-20 03:07:55,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:55,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:55,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:55,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:55,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:55,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,089 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:55,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:55,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:55,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:55,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:07:55,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:07:55,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:55,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:55,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:07:55,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:07:55,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,165 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:55,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,168 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 4, 3, 1] term [2020-10-20 03:07:55,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:07:55,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:07:55,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,296 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:55,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,298 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:55,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:55,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:55,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:55,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:07:55,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:55,988 WARN L193 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-20 03:07:56,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2020-10-20 03:07:56,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:56,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:56,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,177 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:56,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:56,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:07:56,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,192 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-20 03:07:56,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-20 03:07:56,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,371 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:56,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,391 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:07:56,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:56,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:07:56,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,547 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:07:56,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:56,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:07:56,560 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:56,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,561 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:07:56,563 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:07:56,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-20 03:07:56,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:56,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:56,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:07:56,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:56,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:56,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:58,307 WARN L193 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2020-10-20 03:07:58,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-20 03:07:58,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:58,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-20 03:07:58,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:07:59,078 WARN L193 SmtUtils]: Spent 740.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 121 [2020-10-20 03:08:00,287 WARN L193 SmtUtils]: Spent 869.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-20 03:08:00,557 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-20 03:08:01,146 WARN L193 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-20 03:08:01,420 WARN L193 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-20 03:08:02,842 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 138 DAG size of output: 129 [2020-10-20 03:08:03,233 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-20 03:08:03,552 WARN L193 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-10-20 03:08:03,670 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-10-20 03:08:04,030 WARN L193 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2020-10-20 03:08:04,201 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2020-10-20 03:08:04,229 INFO L132 LiptonReduction]: Checked pairs total: 4721 [2020-10-20 03:08:04,229 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-20 03:08:04,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-10-20 03:08:04,274 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 650 states. [2020-10-20 03:08:04,277 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states. [2020-10-20 03:08:04,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-20 03:08:04,284 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:04,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:04,285 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:04,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash 117480453, now seen corresponding path program 1 times [2020-10-20 03:08:04,302 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:04,302 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501794298] [2020-10-20 03:08:04,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:04,545 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501794298] [2020-10-20 03:08:04,545 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:04,546 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:08:04,546 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504212603] [2020-10-20 03:08:04,551 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:08:04,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:04,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:08:04,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:04,571 INFO L87 Difference]: Start difference. First operand 650 states. Second operand 3 states. [2020-10-20 03:08:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:04,670 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-10-20 03:08:04,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:08:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-20 03:08:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:04,698 INFO L225 Difference]: With dead ends: 550 [2020-10-20 03:08:04,698 INFO L226 Difference]: Without dead ends: 450 [2020-10-20 03:08:04,700 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:04,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-10-20 03:08:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-10-20 03:08:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-10-20 03:08:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-10-20 03:08:04,812 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 7 [2020-10-20 03:08:04,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:04,813 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-10-20 03:08:04,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:08:04,813 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-10-20 03:08:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:08:04,816 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:04,816 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:04,816 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:08:04,817 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1229600893, now seen corresponding path program 1 times [2020-10-20 03:08:04,817 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:04,818 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613249822] [2020-10-20 03:08:04,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:04,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613249822] [2020-10-20 03:08:04,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:04,927 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:08:04,927 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685558998] [2020-10-20 03:08:04,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:08:04,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:08:04,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:04,930 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-10-20 03:08:04,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:04,966 INFO L93 Difference]: Finished difference Result 445 states and 1339 transitions. [2020-10-20 03:08:04,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:08:04,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 03:08:04,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:04,973 INFO L225 Difference]: With dead ends: 445 [2020-10-20 03:08:04,973 INFO L226 Difference]: Without dead ends: 445 [2020-10-20 03:08:04,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2020-10-20 03:08:04,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2020-10-20 03:08:04,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2020-10-20 03:08:04,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 1339 transitions. [2020-10-20 03:08:05,000 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 1339 transitions. Word has length 9 [2020-10-20 03:08:05,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,000 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 1339 transitions. [2020-10-20 03:08:05,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:08:05,000 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 1339 transitions. [2020-10-20 03:08:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:08:05,002 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,002 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:08:05,002 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,003 INFO L82 PathProgramCache]: Analyzing trace with hash -537078437, now seen corresponding path program 1 times [2020-10-20 03:08:05,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642462393] [2020-10-20 03:08:05,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:05,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:05,178 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642462393] [2020-10-20 03:08:05,178 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:05,179 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:08:05,179 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118296329] [2020-10-20 03:08:05,179 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:08:05,179 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:05,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:08:05,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:08:05,180 INFO L87 Difference]: Start difference. First operand 445 states and 1339 transitions. Second operand 4 states. [2020-10-20 03:08:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:05,222 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-10-20 03:08:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:08:05,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-20 03:08:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:05,226 INFO L225 Difference]: With dead ends: 440 [2020-10-20 03:08:05,227 INFO L226 Difference]: Without dead ends: 440 [2020-10-20 03:08:05,227 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:08:05,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-10-20 03:08:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-10-20 03:08:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-10-20 03:08:05,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-10-20 03:08:05,245 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 10 [2020-10-20 03:08:05,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,245 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-10-20 03:08:05,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:08:05,246 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-10-20 03:08:05,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-20 03:08:05,247 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,247 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:08:05,248 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,248 INFO L82 PathProgramCache]: Analyzing trace with hash -537078871, now seen corresponding path program 1 times [2020-10-20 03:08:05,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428309393] [2020-10-20 03:08:05,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:05,496 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428309393] [2020-10-20 03:08:05,496 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:05,496 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:08:05,496 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704086559] [2020-10-20 03:08:05,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:08:05,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:05,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:08:05,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:05,497 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 3 states. [2020-10-20 03:08:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:05,523 INFO L93 Difference]: Finished difference Result 434 states and 1298 transitions. [2020-10-20 03:08:05,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:08:05,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-20 03:08:05,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:05,528 INFO L225 Difference]: With dead ends: 434 [2020-10-20 03:08:05,528 INFO L226 Difference]: Without dead ends: 434 [2020-10-20 03:08:05,528 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-20 03:08:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2020-10-20 03:08:05,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2020-10-20 03:08:05,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2020-10-20 03:08:05,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1298 transitions. [2020-10-20 03:08:05,543 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1298 transitions. Word has length 10 [2020-10-20 03:08:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,544 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1298 transitions. [2020-10-20 03:08:05,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:08:05,544 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1298 transitions. [2020-10-20 03:08:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:08:05,545 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,546 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,546 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:08:05,546 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash 530435755, now seen corresponding path program 1 times [2020-10-20 03:08:05,547 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,547 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114990808] [2020-10-20 03:08:05,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:05,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:05,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114990808] [2020-10-20 03:08:05,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:05,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 03:08:05,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346537751] [2020-10-20 03:08:05,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:08:05,593 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:05,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:08:05,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:08:05,593 INFO L87 Difference]: Start difference. First operand 434 states and 1298 transitions. Second operand 3 states. [2020-10-20 03:08:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:05,610 INFO L93 Difference]: Finished difference Result 599 states and 1720 transitions. [2020-10-20 03:08:05,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:08:05,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 03:08:05,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:05,615 INFO L225 Difference]: With dead ends: 599 [2020-10-20 03:08:05,615 INFO L226 Difference]: Without dead ends: 464 [2020-10-20 03:08:05,615 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-20 03:08:05,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2020-10-20 03:08:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 419. [2020-10-20 03:08:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2020-10-20 03:08:05,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 1201 transitions. [2020-10-20 03:08:05,631 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 1201 transitions. Word has length 11 [2020-10-20 03:08:05,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,632 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 1201 transitions. [2020-10-20 03:08:05,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:08:05,632 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 1201 transitions. [2020-10-20 03:08:05,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:08:05,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:08:05,634 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash 530436747, now seen corresponding path program 1 times [2020-10-20 03:08:05,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378393393] [2020-10-20 03:08:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:05,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378393393] [2020-10-20 03:08:05,754 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:05,754 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:08:05,754 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146013733] [2020-10-20 03:08:05,755 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:08:05,755 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:05,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:08:05,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:05,757 INFO L87 Difference]: Start difference. First operand 419 states and 1201 transitions. Second operand 5 states. [2020-10-20 03:08:05,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:05,829 INFO L93 Difference]: Finished difference Result 407 states and 1157 transitions. [2020-10-20 03:08:05,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:08:05,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-20 03:08:05,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:05,833 INFO L225 Difference]: With dead ends: 407 [2020-10-20 03:08:05,834 INFO L226 Difference]: Without dead ends: 407 [2020-10-20 03:08:05,834 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:08:05,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2020-10-20 03:08:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2020-10-20 03:08:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2020-10-20 03:08:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 1157 transitions. [2020-10-20 03:08:05,847 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 1157 transitions. Word has length 11 [2020-10-20 03:08:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,848 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 1157 transitions. [2020-10-20 03:08:05,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:08:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 1157 transitions. [2020-10-20 03:08:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:08:05,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,849 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:08:05,849 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,850 INFO L82 PathProgramCache]: Analyzing trace with hash -769299944, now seen corresponding path program 1 times [2020-10-20 03:08:05,850 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103951816] [2020-10-20 03:08:05,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:05,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103951816] [2020-10-20 03:08:05,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:05,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:08:05,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669128668] [2020-10-20 03:08:05,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:08:05,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:05,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:08:05,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:05,923 INFO L87 Difference]: Start difference. First operand 407 states and 1157 transitions. Second operand 5 states. [2020-10-20 03:08:05,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:05,970 INFO L93 Difference]: Finished difference Result 402 states and 1138 transitions. [2020-10-20 03:08:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:08:05,971 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-20 03:08:05,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:05,974 INFO L225 Difference]: With dead ends: 402 [2020-10-20 03:08:05,974 INFO L226 Difference]: Without dead ends: 402 [2020-10-20 03:08:05,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:05,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2020-10-20 03:08:05,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 398. [2020-10-20 03:08:05,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2020-10-20 03:08:05,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 1127 transitions. [2020-10-20 03:08:05,988 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 1127 transitions. Word has length 12 [2020-10-20 03:08:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:05,988 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 1127 transitions. [2020-10-20 03:08:05,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:08:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 1127 transitions. [2020-10-20 03:08:05,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:08:05,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:05,990 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:05,990 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:08:05,990 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:05,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:05,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1921518076, now seen corresponding path program 1 times [2020-10-20 03:08:05,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:05,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501040223] [2020-10-20 03:08:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:06,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501040223] [2020-10-20 03:08:06,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:06,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:08:06,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460916542] [2020-10-20 03:08:06,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:08:06,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:06,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:08:06,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:08:06,110 INFO L87 Difference]: Start difference. First operand 398 states and 1127 transitions. Second operand 6 states. [2020-10-20 03:08:06,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:06,249 INFO L93 Difference]: Finished difference Result 440 states and 1227 transitions. [2020-10-20 03:08:06,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:08:06,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2020-10-20 03:08:06,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:06,253 INFO L225 Difference]: With dead ends: 440 [2020-10-20 03:08:06,253 INFO L226 Difference]: Without dead ends: 392 [2020-10-20 03:08:06,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:08:06,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2020-10-20 03:08:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2020-10-20 03:08:06,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2020-10-20 03:08:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 1086 transitions. [2020-10-20 03:08:06,267 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 1086 transitions. Word has length 13 [2020-10-20 03:08:06,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:06,267 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 1086 transitions. [2020-10-20 03:08:06,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:08:06,268 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 1086 transitions. [2020-10-20 03:08:06,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:08:06,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:06,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:06,269 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:08:06,269 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:06,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:06,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1352377110, now seen corresponding path program 1 times [2020-10-20 03:08:06,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:06,270 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417226163] [2020-10-20 03:08:06,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:06,369 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417226163] [2020-10-20 03:08:06,369 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:06,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:08:06,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120236191] [2020-10-20 03:08:06,370 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:08:06,370 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:06,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:08:06,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:08:06,371 INFO L87 Difference]: Start difference. First operand 392 states and 1086 transitions. Second operand 4 states. [2020-10-20 03:08:06,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:06,408 INFO L93 Difference]: Finished difference Result 384 states and 935 transitions. [2020-10-20 03:08:06,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:08:06,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 03:08:06,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:06,411 INFO L225 Difference]: With dead ends: 384 [2020-10-20 03:08:06,412 INFO L226 Difference]: Without dead ends: 280 [2020-10-20 03:08:06,412 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:06,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2020-10-20 03:08:06,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2020-10-20 03:08:06,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2020-10-20 03:08:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 662 transitions. [2020-10-20 03:08:06,421 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 662 transitions. Word has length 13 [2020-10-20 03:08:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:06,422 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 662 transitions. [2020-10-20 03:08:06,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:08:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 662 transitions. [2020-10-20 03:08:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-20 03:08:06,425 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:06,426 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:06,426 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:08:06,426 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:06,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:06,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1882145435, now seen corresponding path program 1 times [2020-10-20 03:08:06,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:06,427 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492709153] [2020-10-20 03:08:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:06,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492709153] [2020-10-20 03:08:06,567 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:06,567 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:08:06,567 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657252427] [2020-10-20 03:08:06,567 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:08:06,568 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:06,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:08:06,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:06,569 INFO L87 Difference]: Start difference. First operand 280 states and 662 transitions. Second operand 5 states. [2020-10-20 03:08:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:06,623 INFO L93 Difference]: Finished difference Result 230 states and 495 transitions. [2020-10-20 03:08:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:08:06,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-20 03:08:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:06,627 INFO L225 Difference]: With dead ends: 230 [2020-10-20 03:08:06,627 INFO L226 Difference]: Without dead ends: 176 [2020-10-20 03:08:06,627 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:08:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-10-20 03:08:06,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2020-10-20 03:08:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2020-10-20 03:08:06,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 368 transitions. [2020-10-20 03:08:06,633 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 368 transitions. Word has length 14 [2020-10-20 03:08:06,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:06,634 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 368 transitions. [2020-10-20 03:08:06,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:08:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 368 transitions. [2020-10-20 03:08:06,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 03:08:06,635 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:06,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:06,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:08:06,635 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:06,636 INFO L82 PathProgramCache]: Analyzing trace with hash 573655817, now seen corresponding path program 1 times [2020-10-20 03:08:06,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:06,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115867962] [2020-10-20 03:08:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:06,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:06,751 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115867962] [2020-10-20 03:08:06,751 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:06,751 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:08:06,752 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092601485] [2020-10-20 03:08:06,752 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:08:06,752 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:06,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:08:06,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:08:06,753 INFO L87 Difference]: Start difference. First operand 176 states and 368 transitions. Second operand 6 states. [2020-10-20 03:08:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:06,813 INFO L93 Difference]: Finished difference Result 157 states and 329 transitions. [2020-10-20 03:08:06,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:08:06,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-20 03:08:06,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:06,815 INFO L225 Difference]: With dead ends: 157 [2020-10-20 03:08:06,816 INFO L226 Difference]: Without dead ends: 97 [2020-10-20 03:08:06,816 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:08:06,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-10-20 03:08:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-10-20 03:08:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-20 03:08:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 176 transitions. [2020-10-20 03:08:06,819 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 176 transitions. Word has length 16 [2020-10-20 03:08:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:06,819 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 176 transitions. [2020-10-20 03:08:06,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:08:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 176 transitions. [2020-10-20 03:08:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:08:06,820 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:06,820 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:06,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 03:08:06,821 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:06,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:06,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2071543388, now seen corresponding path program 1 times [2020-10-20 03:08:06,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:06,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169178886] [2020-10-20 03:08:06,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:06,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:06,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:06,970 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169178886] [2020-10-20 03:08:06,970 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:06,971 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-20 03:08:06,971 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907858846] [2020-10-20 03:08:06,971 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 03:08:06,971 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 03:08:06,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 03:08:06,972 INFO L87 Difference]: Start difference. First operand 87 states and 176 transitions. Second operand 9 states. [2020-10-20 03:08:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:07,156 INFO L93 Difference]: Finished difference Result 142 states and 272 transitions. [2020-10-20 03:08:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 03:08:07,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20 [2020-10-20 03:08:07,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:07,158 INFO L225 Difference]: With dead ends: 142 [2020-10-20 03:08:07,159 INFO L226 Difference]: Without dead ends: 102 [2020-10-20 03:08:07,159 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-10-20 03:08:07,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-20 03:08:07,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2020-10-20 03:08:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-20 03:08:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 177 transitions. [2020-10-20 03:08:07,162 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 177 transitions. Word has length 20 [2020-10-20 03:08:07,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:07,163 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 177 transitions. [2020-10-20 03:08:07,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 03:08:07,163 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 177 transitions. [2020-10-20 03:08:07,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:08:07,164 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:07,164 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:07,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-20 03:08:07,164 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:07,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:07,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2143931996, now seen corresponding path program 2 times [2020-10-20 03:08:07,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:07,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767586406] [2020-10-20 03:08:07,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:08:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:08:07,215 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767586406] [2020-10-20 03:08:07,215 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:08:07,216 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:08:07,216 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807963595] [2020-10-20 03:08:07,216 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:08:07,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:08:07,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:08:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:08:07,217 INFO L87 Difference]: Start difference. First operand 93 states and 177 transitions. Second operand 4 states. [2020-10-20 03:08:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:08:07,235 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2020-10-20 03:08:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:08:07,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-20 03:08:07,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:08:07,236 INFO L225 Difference]: With dead ends: 103 [2020-10-20 03:08:07,236 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 03:08:07,237 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:08:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 03:08:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-20 03:08:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 03:08:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 80 transitions. [2020-10-20 03:08:07,239 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 80 transitions. Word has length 20 [2020-10-20 03:08:07,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:08:07,239 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 80 transitions. [2020-10-20 03:08:07,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:08:07,239 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 80 transitions. [2020-10-20 03:08:07,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-20 03:08:07,240 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:08:07,240 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:08:07,240 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-20 03:08:07,240 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:08:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:08:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash -7896946, now seen corresponding path program 3 times [2020-10-20 03:08:07,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:08:07,241 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652535805] [2020-10-20 03:08:07,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:08:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:08:07,275 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:08:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:08:07,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:08:07,386 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:08:07,386 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:08:07,386 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-20 03:08:07,387 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:08:07,400 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-180929847 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-180929847 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-180929847 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-180929847 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_In-180929847 ~y$r_buff1_thd0~0_Out-180929847) (or (and (or (and .cse0 (= ~y~0_Out-180929847 ~y~0_In-180929847)) (and .cse1 (= ~y~0_Out-180929847 ~y$w_buff1~0_In-180929847) .cse2)) .cse3) (and .cse4 (= ~y~0_Out-180929847 ~y$w_buff0~0_In-180929847) .cse5)) (or (and .cse1 (= ~y$w_buff1_used~0_Out-180929847 0) .cse2) (and (= ~y$w_buff1_used~0_Out-180929847 ~y$w_buff1_used~0_In-180929847) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847 0)) (or (and (= ~y$w_buff0_used~0_Out-180929847 ~y$w_buff0_used~0_In-180929847) .cse3) (and (= ~y$w_buff0_used~0_Out-180929847 0) .cse4 .cse5)) (= ~y$r_buff0_thd0~0_In-180929847 ~y$r_buff0_thd0~0_Out-180929847) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180929847, ~y$w_buff1~0=~y$w_buff1~0_In-180929847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180929847, ~y$w_buff0~0=~y$w_buff0~0_In-180929847, ~y~0=~y~0_In-180929847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180929847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180929847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-180929847, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-180929847|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-180929847|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-180929847|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-180929847|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-180929847|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-180929847|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847, ~y$w_buff1~0=~y$w_buff1~0_In-180929847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-180929847, ~y$w_buff0~0=~y$w_buff0~0_In-180929847, ~y~0=~y~0_Out-180929847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-180929847, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-180929847} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:08:07,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,414 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,414 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-20 03:08:07,415 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,415 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,416 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,416 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,417 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,417 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,418 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,418 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,419 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,419 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,419 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,420 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,420 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,420 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,422 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,422 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,422 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,423 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,423 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,424 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,428 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,428 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,429 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,429 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,430 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:08:07 BasicIcfg [2020-10-20 03:08:07,566 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:08:07,566 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:08:07,566 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:08:07,566 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:08:07,567 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:07:53" (3/4) ... [2020-10-20 03:08:07,569 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:08:07,573 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L2-->L831: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-180929847 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-180929847 256) 0)) (.cse9 (= (mod ~y$r_buff1_thd0~0_In-180929847 256) 0)) (.cse8 (= (mod ~y$w_buff1_used~0_In-180929847 256) 0))) (let ((.cse1 (not .cse8)) (.cse2 (not .cse9)) (.cse0 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= ~y$r_buff1_thd0~0_In-180929847 ~y$r_buff1_thd0~0_Out-180929847) (or (and (or (and .cse0 (= ~y~0_Out-180929847 ~y~0_In-180929847)) (and .cse1 (= ~y~0_Out-180929847 ~y$w_buff1~0_In-180929847) .cse2)) .cse3) (and .cse4 (= ~y~0_Out-180929847 ~y$w_buff0~0_In-180929847) .cse5)) (or (and .cse1 (= ~y$w_buff1_used~0_Out-180929847 0) .cse2) (and (= ~y$w_buff1_used~0_Out-180929847 ~y$w_buff1_used~0_In-180929847) .cse0)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847 0)) (or (and (= ~y$w_buff0_used~0_Out-180929847 ~y$w_buff0_used~0_In-180929847) .cse3) (and (= ~y$w_buff0_used~0_Out-180929847 0) .cse4 .cse5)) (= ~y$r_buff0_thd0~0_In-180929847 ~y$r_buff0_thd0~0_Out-180929847) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-180929847, ~y$w_buff1~0=~y$w_buff1~0_In-180929847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-180929847, ~y$w_buff0~0=~y$w_buff0~0_In-180929847, ~y~0=~y~0_In-180929847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-180929847, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-180929847} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-180929847, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-180929847|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-180929847|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-180929847|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-180929847|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-180929847|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-180929847|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-180929847|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-180929847, ~y$w_buff1~0=~y$w_buff1~0_In-180929847, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-180929847, ~y$w_buff0~0=~y$w_buff0~0_In-180929847, ~y~0=~y~0_Out-180929847, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-180929847, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-180929847} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-20 03:08:07,574 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,575 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,575 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [777] [2020-10-20 03:08:07,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,576 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,577 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,577 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,578 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,578 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,579 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,579 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,580 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,580 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,581 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:08:07,581 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:08:07,687 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:08:07,687 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:08:07,689 INFO L168 Benchmark]: Toolchain (without parser) took 17600.37 ms. Allocated memory was 40.9 MB in the beginning and 146.8 MB in the end (delta: 105.9 MB). Free memory was 17.6 MB in the beginning and 97.3 MB in the end (delta: -79.7 MB). Peak memory consumption was 26.2 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,689 INFO L168 Benchmark]: CDTParser took 0.61 ms. Allocated memory is still 31.5 MB. Free memory was 8.7 MB in the beginning and 8.6 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,690 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.25 ms. Allocated memory was 40.9 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Free memory was 16.7 MB in the beginning and 8.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,690 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.08 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 8.7 MB in the beginning and 26.1 MB in the end (delta: -17.4 MB). Peak memory consumption was 320.9 kB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,690 INFO L168 Benchmark]: Boogie Preprocessor took 44.77 ms. Allocated memory is still 43.5 MB. Free memory was 26.1 MB in the beginning and 23.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,691 INFO L168 Benchmark]: RCFGBuilder took 2103.35 ms. Allocated memory was 43.5 MB in the beginning and 62.4 MB in the end (delta: 18.9 MB). Free memory was 23.5 MB in the beginning and 41.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,691 INFO L168 Benchmark]: TraceAbstraction took 14432.79 ms. Allocated memory was 62.4 MB in the beginning and 146.8 MB in the end (delta: 84.4 MB). Free memory was 40.4 MB in the beginning and 113.1 MB in the end (delta: -72.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,692 INFO L168 Benchmark]: Witness Printer took 121.43 ms. Allocated memory is still 146.8 MB. Free memory was 113.1 MB in the beginning and 97.3 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 14.3 GB. [2020-10-20 03:08:07,694 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.61 ms. Allocated memory is still 31.5 MB. Free memory was 8.7 MB in the beginning and 8.6 MB in the end (delta: 47.4 kB). Peak memory consumption was 47.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 807.25 ms. Allocated memory was 40.9 MB in the beginning and 43.0 MB in the end (delta: 2.1 MB). Free memory was 16.7 MB in the beginning and 8.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.1 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 79.08 ms. Allocated memory was 43.0 MB in the beginning and 43.5 MB in the end (delta: 524.3 kB). Free memory was 8.7 MB in the beginning and 26.1 MB in the end (delta: -17.4 MB). Peak memory consumption was 320.9 kB. Max. memory is 14.3 GB. * Boogie Preprocessor took 44.77 ms. Allocated memory is still 43.5 MB. Free memory was 26.1 MB in the beginning and 23.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 14.3 GB. * RCFGBuilder took 2103.35 ms. Allocated memory was 43.5 MB in the beginning and 62.4 MB in the end (delta: 18.9 MB). Free memory was 23.5 MB in the beginning and 41.0 MB in the end (delta: -17.5 MB). Peak memory consumption was 29.3 MB. Max. memory is 14.3 GB. * TraceAbstraction took 14432.79 ms. Allocated memory was 62.4 MB in the beginning and 146.8 MB in the end (delta: 84.4 MB). Free memory was 40.4 MB in the beginning and 113.1 MB in the end (delta: -72.7 MB). Peak memory consumption was 103.0 MB. Max. memory is 14.3 GB. * Witness Printer took 121.43 ms. Allocated memory is still 146.8 MB. Free memory was 113.1 MB in the beginning and 97.3 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1270 VarBasedMoverChecksPositive, 73 VarBasedMoverChecksNegative, 28 SemBasedMoverChecksPositive, 45 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 109 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 10.9s, 107 PlacesBefore, 35 PlacesAfterwards, 100 TransitionsBefore, 26 TransitionsAfterwards, 1746 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4721 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L735] 0 int z = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L815] 0 pthread_t t2516; [L816] FCALL, FORK 0 pthread_create(&t2516, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t2517; [L818] FCALL, FORK 0 pthread_create(&t2517, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L819] 0 pthread_t t2518; [L820] FCALL, FORK 0 pthread_create(&t2518, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND TRUE 3 !expression [L17] COND FALSE 3 !(0) [L17] 3 __assert_fail ("0", "safe031_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L758] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L764] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L793] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 3 return 0; [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L837] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L838] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L838] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L839] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L839] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L840] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L840] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L842] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L843] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L843] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe031_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.0s, HoareTripleCheckerStatistics: 303 SDtfs, 295 SDslu, 505 SDs, 0 SdLazy, 318 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=650occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 68 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 11068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...