/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:02:26,113 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:02:26,116 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:02:26,154 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:02:26,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:02:26,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:02:26,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:02:26,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:02:26,171 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:02:26,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:02:26,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:02:26,175 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:02:26,176 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:02:26,178 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:02:26,181 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:02:26,182 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:02:26,183 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:02:26,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:02:26,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:02:26,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:02:26,195 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:02:26,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:02:26,198 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:02:26,198 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:02:26,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:02:26,210 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:02:26,210 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:02:26,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:02:26,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:02:26,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:02:26,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:02:26,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:02:26,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:02:26,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:02:26,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:02:26,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:02:26,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:02:26,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:02:26,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:02:26,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:02:26,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:02:26,227 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-06 01:02:26,266 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:02:26,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:02:26,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:02:26,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:02:26,268 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:02:26,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:02:26,269 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:02:26,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:02:26,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:02:26,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:02:26,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:02:26,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:02:26,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:02:26,271 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:02:26,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:02:26,272 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:02:26,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:02:26,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:02:26,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:02:26,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:02:26,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:02:26,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:02:26,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:02:26,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:02:26,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:02:26,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:02:26,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:02:26,275 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:02:26,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:02:26,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:02:26,276 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:02:26,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:02:26,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:02:26,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:02:26,590 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:02:26,590 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:02:26,591 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2020-10-06 01:02:26,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be7c596e/dfbb92cc68db4a0facb92f62243703f8/FLAG57fca15f3 [2020-10-06 01:02:27,180 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:02:27,181 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2020-10-06 01:02:27,194 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be7c596e/dfbb92cc68db4a0facb92f62243703f8/FLAG57fca15f3 [2020-10-06 01:02:27,469 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9be7c596e/dfbb92cc68db4a0facb92f62243703f8 [2020-10-06 01:02:27,476 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:02:27,478 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:02:27,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:27,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:02:27,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:02:27,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:27" (1/1) ... [2020-10-06 01:02:27,486 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b68cce0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:27, skipping insertion in model container [2020-10-06 01:02:27,486 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:02:27" (1/1) ... [2020-10-06 01:02:27,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:02:27,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:02:28,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:28,054 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:02:28,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:02:28,190 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:02:28,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28 WrapperNode [2020-10-06 01:02:28,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:02:28,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:28,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:02:28,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:02:28,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,219 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,259 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:02:28,260 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:02:28,260 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:02:28,260 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:02:28,268 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,268 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,282 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,285 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,289 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (1/1) ... [2020-10-06 01:02:28,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:02:28,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:02:28,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:02:28,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:02:28,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (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-06 01:02:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:02:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:02:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:02:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:02:28,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:02:28,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:02:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:02:28,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:02:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:02:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:02:28,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:02:28,367 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:02:30,096 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:02:30,097 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:02:30,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:30 BoogieIcfgContainer [2020-10-06 01:02:30,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:02:30,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:02:30,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:02:30,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:02:30,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:02:27" (1/3) ... [2020-10-06 01:02:30,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b9995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:30, skipping insertion in model container [2020-10-06 01:02:30,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:02:28" (2/3) ... [2020-10-06 01:02:30,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12b9995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:02:30, skipping insertion in model container [2020-10-06 01:02:30,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:02:30" (3/3) ... [2020-10-06 01:02:30,107 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2020-10-06 01:02:30,117 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:02:30,117 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:02:30,124 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:02:30,125 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:02:30,151 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,152 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,153 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,156 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,156 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,162 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,163 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,163 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,164 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,164 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:02:30,183 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 01:02:30,203 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:02:30,203 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:02:30,203 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:02:30,203 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:02:30,203 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:02:30,203 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:02:30,204 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:02:30,204 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:02:30,218 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:30,220 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:30,257 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 01:02:30,257 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:30,262 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 01:02:30,264 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 80 places, 75 transitions, 160 flow [2020-10-06 01:02:30,281 INFO L129 PetriNetUnfolder]: 2/73 cut-off events. [2020-10-06 01:02:30,281 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:02:30,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 73 events. 2/73 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 42 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 01:02:30,284 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 896 [2020-10-06 01:02:30,285 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:02:31,974 WARN L193 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 224 DAG size of output: 183 [2020-10-06 01:02:32,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-06 01:02:32,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:32,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-06 01:02:32,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:02:32,994 WARN L193 SmtUtils]: Spent 954.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 118 [2020-10-06 01:02:33,917 WARN L193 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-06 01:02:35,092 WARN L193 SmtUtils]: Spent 774.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2020-10-06 01:02:35,362 WARN L193 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2020-10-06 01:02:36,349 WARN L193 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 124 [2020-10-06 01:02:36,694 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:02:36,921 WARN L193 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2020-10-06 01:02:37,030 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2325 [2020-10-06 01:02:37,030 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-06 01:02:37,033 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-06 01:02:37,050 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-06 01:02:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-06 01:02:37,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:02:37,058 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:37,058 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:02:37,059 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:37,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash 897514, now seen corresponding path program 1 times [2020-10-06 01:02:37,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:37,091 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999379054] [2020-10-06 01:02:37,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:37,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:37,277 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-06 01:02:37,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999379054] [2020-10-06 01:02:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:37,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:37,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [50911717] [2020-10-06 01:02:37,281 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:37,283 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:37,295 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:02:37,295 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:37,299 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:37,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:37,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:37,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:37,316 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-06 01:02:37,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:37,379 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-06 01:02:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:37,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:02:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:37,392 INFO L225 Difference]: With dead ends: 137 [2020-10-06 01:02:37,392 INFO L226 Difference]: Without dead ends: 112 [2020-10-06 01:02:37,393 INFO L675 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-06 01:02:37,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-06 01:02:37,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-06 01:02:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-06 01:02:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-06 01:02:37,442 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-06 01:02:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:37,443 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-06 01:02:37,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-06 01:02:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:02:37,444 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:37,444 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:37,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:02:37,445 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash -13139348, now seen corresponding path program 1 times [2020-10-06 01:02:37,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:37,451 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430525589] [2020-10-06 01:02:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:37,594 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-06 01:02:37,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430525589] [2020-10-06 01:02:37,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:37,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:02:37,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1942027162] [2020-10-06 01:02:37,595 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:37,597 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:37,599 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:02:37,599 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:37,600 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:37,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:02:37,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:37,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:02:37,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:02:37,602 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-06 01:02:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:37,611 INFO L93 Difference]: Finished difference Result 107 states and 241 transitions. [2020-10-06 01:02:37,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:37,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:02:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:37,613 INFO L225 Difference]: With dead ends: 107 [2020-10-06 01:02:37,613 INFO L226 Difference]: Without dead ends: 107 [2020-10-06 01:02:37,614 INFO L675 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-06 01:02:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-06 01:02:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2020-10-06 01:02:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-10-06 01:02:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 241 transitions. [2020-10-06 01:02:37,626 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 241 transitions. Word has length 7 [2020-10-06 01:02:37,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:37,626 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 241 transitions. [2020-10-06 01:02:37,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:02:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 241 transitions. [2020-10-06 01:02:37,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:02:37,628 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:37,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:37,628 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:02:37,628 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash -407351812, now seen corresponding path program 1 times [2020-10-06 01:02:37,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:37,630 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294520711] [2020-10-06 01:02:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:37,685 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-06 01:02:37,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294520711] [2020-10-06 01:02:37,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:37,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:02:37,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [488979241] [2020-10-06 01:02:37,686 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:37,687 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:37,689 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-06 01:02:37,689 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:37,705 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:37,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:02:37,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:37,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:02:37,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:02:37,706 INFO L87 Difference]: Start difference. First operand 107 states and 241 transitions. Second operand 4 states. [2020-10-06 01:02:37,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:37,734 INFO L93 Difference]: Finished difference Result 135 states and 294 transitions. [2020-10-06 01:02:37,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:02:37,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-06 01:02:37,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:37,737 INFO L225 Difference]: With dead ends: 135 [2020-10-06 01:02:37,737 INFO L226 Difference]: Without dead ends: 75 [2020-10-06 01:02:37,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 01:02:37,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2020-10-06 01:02:37,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2020-10-06 01:02:37,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-10-06 01:02:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 155 transitions. [2020-10-06 01:02:37,744 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 155 transitions. Word has length 8 [2020-10-06 01:02:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:37,744 INFO L479 AbstractCegarLoop]: Abstraction has 75 states and 155 transitions. [2020-10-06 01:02:37,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:02:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 155 transitions. [2020-10-06 01:02:37,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:02:37,745 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:37,745 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:37,746 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:02:37,746 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:37,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:37,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1700985471, now seen corresponding path program 1 times [2020-10-06 01:02:37,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:37,748 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305646813] [2020-10-06 01:02:37,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:37,904 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-06 01:02:37,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305646813] [2020-10-06 01:02:37,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:37,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:02:37,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778040774] [2020-10-06 01:02:37,905 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:37,907 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:37,911 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2020-10-06 01:02:37,911 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:37,971 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:37,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:02:37,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:37,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:02:37,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:02:37,972 INFO L87 Difference]: Start difference. First operand 75 states and 155 transitions. Second operand 5 states. [2020-10-06 01:02:38,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:38,010 INFO L93 Difference]: Finished difference Result 74 states and 152 transitions. [2020-10-06 01:02:38,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:02:38,011 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-06 01:02:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:38,012 INFO L225 Difference]: With dead ends: 74 [2020-10-06 01:02:38,012 INFO L226 Difference]: Without dead ends: 74 [2020-10-06 01:02:38,012 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-06 01:02:38,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-06 01:02:38,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-06 01:02:38,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-06 01:02:38,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 152 transitions. [2020-10-06 01:02:38,018 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 152 transitions. Word has length 10 [2020-10-06 01:02:38,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:38,019 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 152 transitions. [2020-10-06 01:02:38,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:02:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 152 transitions. [2020-10-06 01:02:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:38,020 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:38,020 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:38,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:02:38,020 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:38,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:38,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1190886961, now seen corresponding path program 1 times [2020-10-06 01:02:38,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:38,026 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503337489] [2020-10-06 01:02:38,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:38,162 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-06 01:02:38,162 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503337489] [2020-10-06 01:02:38,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:38,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:02:38,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1483543629] [2020-10-06 01:02:38,166 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:38,167 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:38,170 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 27 transitions. [2020-10-06 01:02:38,170 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:38,227 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:02:38,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-06 01:02:38,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:38,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-06 01:02:38,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:02:38,228 INFO L87 Difference]: Start difference. First operand 74 states and 152 transitions. Second operand 6 states. [2020-10-06 01:02:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:38,319 INFO L93 Difference]: Finished difference Result 81 states and 165 transitions. [2020-10-06 01:02:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-06 01:02:38,320 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-06 01:02:38,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:38,322 INFO L225 Difference]: With dead ends: 81 [2020-10-06 01:02:38,322 INFO L226 Difference]: Without dead ends: 81 [2020-10-06 01:02:38,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:02:38,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-06 01:02:38,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2020-10-06 01:02:38,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-06 01:02:38,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 162 transitions. [2020-10-06 01:02:38,329 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 162 transitions. Word has length 11 [2020-10-06 01:02:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:38,330 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 162 transitions. [2020-10-06 01:02:38,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-06 01:02:38,330 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 162 transitions. [2020-10-06 01:02:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:02:38,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:38,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:38,331 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:02:38,331 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:38,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1190881195, now seen corresponding path program 1 times [2020-10-06 01:02:38,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:38,333 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694599732] [2020-10-06 01:02:38,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:38,736 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-06 01:02:38,736 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694599732] [2020-10-06 01:02:38,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:38,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:02:38,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [472404423] [2020-10-06 01:02:38,738 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:38,740 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:38,744 INFO L258 McrAutomatonBuilder]: Finished intersection with 25 states and 38 transitions. [2020-10-06 01:02:38,744 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:38,746 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:38,747 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:38,839 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 2, 2, 1] term [2020-10-06 01:02:38,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:38,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 1] term [2020-10-06 01:02:38,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:38,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:38,844 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:38,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:38,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:38,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-06 01:02:38,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:39,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term [2020-10-06 01:02:39,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,051 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2020-10-06 01:02:39,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:39,053 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:02:39,056 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,057 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,059 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:02:39,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 4, 3, 2, 1] term [2020-10-06 01:02:39,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2020-10-06 01:02:39,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,226 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:39,226 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,228 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,230 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,233 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:39,233 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:02:39,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,242 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,306 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,315 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,329 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:02:39,333 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,334 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,353 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,358 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 4, 3, 2, 1] term [2020-10-06 01:02:39,359 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,361 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 2, 1] term [2020-10-06 01:02:39,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2020-10-06 01:02:39,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,397 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:39,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,401 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,405 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:02:39,406 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-06 01:02:39,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,416 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,441 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-06 01:02:39,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,470 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,485 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 4, 3, 2, 1] term [2020-10-06 01:02:39,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 4, 2, 2, 1] term [2020-10-06 01:02:39,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,519 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 4, 1] term [2020-10-06 01:02:39,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,523 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:02:39,523 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,525 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:02:39,525 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,536 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:02:39,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:02:39,545 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:02:39,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,553 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:39,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,571 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 4, 3, 2, 1] term [2020-10-06 01:02:39,571 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:02:39,592 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 4 new interpolants: [1872#(or (and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond| 0) (= ~y$r_buff0_thd0~0 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond|)) (not (= (mod ~y$w_buff0_used~0 256) 0))), 1873#(and (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd0~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~__unbuffered_cnt~0 0))), 1874#(and (= ~y$r_buff1_thd0~0 0) (= ~y$w_buff0_used~0 1) (= ~y$r_buff0_thd1~0 1) (not (= 2 ~__unbuffered_cnt~0)) (= ~y$r_buff0_thd0~0 0)), 1871#(and (= ~y$r_buff1_thd0~0 0) (or (and (<= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= 2 ~y~0)) (not (= ~y$w_buff0~0 0)) (<= 0 (div ~y$w_buff0_used~0 256))) (not (= 2 ~__unbuffered_cnt~0))) (= ~y$r_buff0_thd0~0 0))] [2020-10-06 01:02:39,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-06 01:02:39,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:39,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-06 01:02:39,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-10-06 01:02:39,593 INFO L87 Difference]: Start difference. First operand 79 states and 162 transitions. Second operand 11 states. [2020-10-06 01:02:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:40,258 INFO L93 Difference]: Finished difference Result 80 states and 133 transitions. [2020-10-06 01:02:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-06 01:02:40,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-10-06 01:02:40,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:40,290 INFO L225 Difference]: With dead ends: 80 [2020-10-06 01:02:40,290 INFO L226 Difference]: Without dead ends: 52 [2020-10-06 01:02:40,290 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2020-10-06 01:02:40,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-10-06 01:02:40,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2020-10-06 01:02:40,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-06 01:02:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 77 transitions. [2020-10-06 01:02:40,296 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 77 transitions. Word has length 11 [2020-10-06 01:02:40,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:40,297 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 77 transitions. [2020-10-06 01:02:40,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-06 01:02:40,297 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2020-10-06 01:02:40,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-06 01:02:40,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:40,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:40,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:02:40,298 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:40,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:40,299 INFO L82 PathProgramCache]: Analyzing trace with hash 291693893, now seen corresponding path program 1 times [2020-10-06 01:02:40,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:40,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752540815] [2020-10-06 01:02:40,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:02:40,409 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-06 01:02:40,410 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752540815] [2020-10-06 01:02:40,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:02:40,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:02:40,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [897662693] [2020-10-06 01:02:40,411 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:02:40,416 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:02:40,424 INFO L258 McrAutomatonBuilder]: Finished intersection with 21 states and 26 transitions. [2020-10-06 01:02:40,424 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:02:40,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:02:40,462 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [2076#(not (= 2 ~__unbuffered_cnt~0)), 2077#(not (= ~__unbuffered_cnt~0 1))] [2020-10-06 01:02:40,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:02:40,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:02:40,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:02:40,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:02:40,463 INFO L87 Difference]: Start difference. First operand 48 states and 77 transitions. Second operand 7 states. [2020-10-06 01:02:40,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:02:40,505 INFO L93 Difference]: Finished difference Result 41 states and 61 transitions. [2020-10-06 01:02:40,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:02:40,506 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-10-06 01:02:40,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:02:40,507 INFO L225 Difference]: With dead ends: 41 [2020-10-06 01:02:40,507 INFO L226 Difference]: Without dead ends: 34 [2020-10-06 01:02:40,507 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-06 01:02:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-06 01:02:40,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-06 01:02:40,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-06 01:02:40,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-06 01:02:40,510 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 14 [2020-10-06 01:02:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:02:40,510 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-06 01:02:40,511 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:02:40,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-06 01:02:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:02:40,511 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:02:40,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:02:40,512 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:02:40,512 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:02:40,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:02:40,512 INFO L82 PathProgramCache]: Analyzing trace with hash -944183904, now seen corresponding path program 1 times [2020-10-06 01:02:40,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:02:40,517 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165010821] [2020-10-06 01:02:40,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:02:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:02:40,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:02:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:02:40,583 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:02:40,619 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:02:40,619 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:02:40,619 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:02:40,620 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:02:40,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L2-->L795: Formula: (let ((.cse7 (= (mod ~y$w_buff0_used~0_In366888921 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In366888921 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In366888921 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In366888921 256) 0))) (let ((.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse7 .cse6)) (.cse4 (not .cse7)) (.cse5 (not .cse6))) (and (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In366888921| ULTIMATE.start_assume_abort_if_not_~cond_Out366888921) (or (and (or (and .cse0 (= ~y~0_Out366888921 ~y$w_buff1~0_In366888921) .cse1) (and .cse2 (= ~y~0_Out366888921 ~y~0_In366888921))) .cse3) (and .cse4 (= ~y~0_Out366888921 ~y$w_buff0~0_In366888921) .cse5)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out366888921 0)) (or (and .cse0 (= ~y$w_buff1_used~0_Out366888921 0) .cse1) (and .cse2 (= ~y$w_buff1_used~0_Out366888921 ~y$w_buff1_used~0_In366888921))) (or (and .cse3 (= ~y$w_buff0_used~0_Out366888921 ~y$w_buff0_used~0_In366888921)) (and .cse4 (= ~y$w_buff0_used~0_Out366888921 0) .cse5)) (= ~y$r_buff1_thd0~0_In366888921 ~y$r_buff1_thd0~0_Out366888921) (= ~y$r_buff0_thd0~0_In366888921 ~y$r_buff0_thd0~0_Out366888921)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In366888921|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In366888921, ~y$w_buff1~0=~y$w_buff1~0_In366888921, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366888921, ~y$w_buff0~0=~y$w_buff0~0_In366888921, ~y~0=~y~0_In366888921, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In366888921, ~y$w_buff1_used~0=~y$w_buff1_used~0_In366888921} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out366888921, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out366888921|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out366888921|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out366888921|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out366888921|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out366888921|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out366888921|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In366888921|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out366888921, ~y$w_buff1~0=~y$w_buff1~0_In366888921, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out366888921, ~y$w_buff0~0=~y$w_buff0~0_In366888921, ~y~0=~y~0_Out366888921, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out366888921, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out366888921} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 01:02:40,632 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,632 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,634 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,634 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,635 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,635 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,636 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-06 01:02:40,636 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,637 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-06 01:02:40,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,637 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-06 01:02:40,637 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,637 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-06 01:02:40,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,638 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-06 01:02:40,638 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,639 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-06 01:02:40,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,639 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-06 01:02:40,639 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,639 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-06 01:02:40,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,640 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-06 01:02:40,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,640 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-06 01:02:40,640 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,640 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-06 01:02:40,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,641 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-06 01:02:40,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,641 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-06 01:02:40,641 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,641 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-06 01:02:40,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,642 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-06 01:02:40,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,642 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-06 01:02:40,642 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,642 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-06 01:02:40,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,643 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-06 01:02:40,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,643 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-06 01:02:40,643 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,643 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-06 01:02:40,644 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:02:40,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:02:40 BasicIcfg [2020-10-06 01:02:40,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:02:40,684 INFO L168 Benchmark]: Toolchain (without parser) took 13205.95 ms. Allocated memory was 146.8 MB in the beginning and 343.4 MB in the end (delta: 196.6 MB). Free memory was 101.6 MB in the beginning and 248.1 MB in the end (delta: -146.5 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,684 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 712.01 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,687 INFO L168 Benchmark]: Boogie Preprocessor took 34.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,688 INFO L168 Benchmark]: RCFGBuilder took 1804.78 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.0 MB in the beginning and 194.7 MB in the end (delta: -43.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,688 INFO L168 Benchmark]: TraceAbstraction took 10581.75 ms. Allocated memory was 246.4 MB in the beginning and 343.4 MB in the end (delta: 97.0 MB). Free memory was 194.7 MB in the beginning and 248.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. [2020-10-06 01:02:40,693 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 712.01 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 156.3 MB in the end (delta: -54.9 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.66 ms. Allocated memory is still 203.4 MB. Free memory was 156.3 MB in the beginning and 153.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.35 ms. Allocated memory is still 203.4 MB. Free memory was 153.7 MB in the beginning and 151.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1804.78 ms. Allocated memory was 203.4 MB in the beginning and 246.4 MB in the end (delta: 43.0 MB). Free memory was 151.0 MB in the beginning and 194.7 MB in the end (delta: -43.7 MB). Peak memory consumption was 101.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10581.75 ms. Allocated memory was 246.4 MB in the beginning and 343.4 MB in the end (delta: 97.0 MB). Free memory was 194.7 MB in the beginning and 248.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 43.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.8s, 80 ProgramPointsBefore, 26 ProgramPointsAfterwards, 75 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 451 VarBasedMoverChecksPositive, 23 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2325 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L699] 0 int __unbuffered_p1_EAX = 0; [L700] 0 _Bool main$tmp_guard0; [L701] 0 _Bool main$tmp_guard1; [L703] 0 int x = 0; [L705] 0 int y = 0; [L706] 0 _Bool y$flush_delayed; [L707] 0 int y$mem_tmp; [L708] 0 _Bool y$r_buff0_thd0; [L709] 0 _Bool y$r_buff0_thd1; [L710] 0 _Bool y$r_buff0_thd2; [L711] 0 _Bool y$r_buff1_thd0; [L712] 0 _Bool y$r_buff1_thd1; [L713] 0 _Bool y$r_buff1_thd2; [L714] 0 _Bool y$read_delayed; [L715] 0 int *y$read_delayed_var; [L716] 0 int y$w_buff0; [L717] 0 _Bool y$w_buff0_used; [L718] 0 int y$w_buff1; [L719] 0 _Bool y$w_buff1_used; [L720] 0 _Bool weak$$choice0; [L721] 0 _Bool weak$$choice2; [L781] 0 pthread_t t2013; [L782] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L725] 1 y$w_buff1 = y$w_buff0 [L726] 1 y$w_buff0 = 2 [L727] 1 y$w_buff1_used = y$w_buff0_used [L728] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L783] 0 pthread_t t2014; [L784] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L736] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L753] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L756] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 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) [L759] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L759] 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) [L759] 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) [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L760] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L761] 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 [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L762] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 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 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L743] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L746] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L748] 1 return 0; [L766] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 2 return 0; [L786] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L797] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 0 y$flush_delayed = weak$$choice2 [L800] 0 y$mem_tmp = y [L801] 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) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1 [L801] 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) [L801] 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) [L802] 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)) [L802] EXPR 0 !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) [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0 [L802] EXPR 0 !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) [L802] 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)) [L802] 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)) [L803] 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)) [L803] 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) [L803] 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)) [L803] 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)) [L804] 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)) [L804] EXPR 0 !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) [L804] 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)) [L804] 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)) [L805] 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)) [L805] 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) [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L805] 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) [L805] 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)) [L805] 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)) [L806] 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)) [L806] 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)) [L807] 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)) [L807] 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)) [L808] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) [L809] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L809] 0 y = y$flush_delayed ? y$mem_tmp : y [L810] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 74 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 95 SDtfs, 120 SDslu, 147 SDs, 0 SdLazy, 191 SolverSat, 71 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred 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.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 57 ConstructedInterpolants, 0 QuantifiedInterpolants, 5056 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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...