/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:10:06,355 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:10:06,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:10:06,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:10:06,383 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:10:06,384 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:10:06,385 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:10:06,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:10:06,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:10:06,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:10:06,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:10:06,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:10:06,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:10:06,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:10:06,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:10:06,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:10:06,397 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:10:06,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:10:06,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:10:06,402 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:10:06,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:10:06,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:10:06,406 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:10:06,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:10:06,409 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:10:06,409 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:10:06,409 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:10:06,410 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:10:06,411 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:10:06,412 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:10:06,412 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:10:06,413 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:10:06,413 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:10:06,414 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:10:06,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:10:06,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:10:06,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:10:06,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:10:06,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:10:06,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:10:06,418 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:10:06,419 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:10:06,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:10:06,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:10:06,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:10:06,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:10:06,444 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:10:06,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:10:06,444 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:10:06,444 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:10:06,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:10:06,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:10:06,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:10:06,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:10:06,445 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:10:06,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:10:06,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:10:06,446 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:10:06,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:10:06,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:10:06,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:10:06,447 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:10:06,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:10:06,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:10:06,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:10:06,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:10:06,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:10:06,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:10:06,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:10:06,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:10:06,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:10:06,770 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:10:06,787 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:10:06,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:10:06,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:10:06,796 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:10:06,797 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2020-10-16 12:10:06,862 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d4571e979/b3533b135a2c4782abbedc331de84d44/FLAG1c8ee017f [2020-10-16 12:10:07,477 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:10:07,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe021_power.opt.i [2020-10-16 12:10:07,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d4571e979/b3533b135a2c4782abbedc331de84d44/FLAG1c8ee017f [2020-10-16 12:10:07,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d4571e979/b3533b135a2c4782abbedc331de84d44 [2020-10-16 12:10:07,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:10:07,689 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:10:07,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:10:07,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:10:07,695 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:10:07,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:07" (1/1) ... [2020-10-16 12:10:07,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0813b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:07, skipping insertion in model container [2020-10-16 12:10:07,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:10:07" (1/1) ... [2020-10-16 12:10:07,711 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:10:07,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:10:08,152 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:10:08,266 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:10:08,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:10:08,494 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:10:08,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08 WrapperNode [2020-10-16 12:10:08,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:10:08,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:10:08,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:10:08,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:10:08,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:10:08,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:10:08,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:10:08,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:10:08,588 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,593 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... [2020-10-16 12:10:08,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:10:08,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:10:08,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:10:08,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:10:08,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-16 12:10:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:10:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:10:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:10:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:10:08,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:10:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:10:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:10:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:10:08,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:10:08,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:10:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:10:08,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:10:08,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:10:08,701 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:10:11,024 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:10:11,024 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:10:11,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:11 BoogieIcfgContainer [2020-10-16 12:10:11,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:10:11,028 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:10:11,029 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:10:11,032 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:10:11,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:10:07" (1/3) ... [2020-10-16 12:10:11,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d92b48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:11, skipping insertion in model container [2020-10-16 12:10:11,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:10:08" (2/3) ... [2020-10-16 12:10:11,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d92b48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:10:11, skipping insertion in model container [2020-10-16 12:10:11,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:10:11" (3/3) ... [2020-10-16 12:10:11,036 INFO L111 eAbstractionObserver]: Analyzing ICFG safe021_power.opt.i [2020-10-16 12:10:11,048 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:10:11,048 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:10:11,056 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:10:11,057 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:10:11,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,088 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,089 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,092 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,092 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,094 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,096 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,097 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,097 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,097 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,098 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,099 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,104 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,104 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,105 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,105 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,106 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,115 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,115 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,118 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,119 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,120 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,121 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:10:11,123 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:10:11,138 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:10:11,160 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:10:11,160 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:10:11,160 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:10:11,160 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:10:11,161 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:10:11,161 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:10:11,161 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:10:11,161 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:10:11,175 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:10:11,176 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:10:11,179 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 93 transitions, 201 flow [2020-10-16 12:10:11,181 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 101 places, 93 transitions, 201 flow [2020-10-16 12:10:11,229 INFO L129 PetriNetUnfolder]: 2/90 cut-off events. [2020-10-16 12:10:11,229 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:10:11,235 INFO L80 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 90 events. 2/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:10:11,238 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 12:10:13,080 WARN L193 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 226 DAG size of output: 186 [2020-10-16 12:10:13,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-16 12:10:13,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:10:13,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2020-10-16 12:10:13,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:10:14,441 WARN L193 SmtUtils]: Spent 1.29 s on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2020-10-16 12:10:14,887 WARN L193 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:10:15,047 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-16 12:10:15,950 WARN L193 SmtUtils]: Spent 423.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 12:10:16,351 WARN L193 SmtUtils]: Spent 396.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-16 12:10:16,966 WARN L193 SmtUtils]: Spent 612.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 107 [2020-10-16 12:10:17,250 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2020-10-16 12:10:18,170 WARN L193 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 123 [2020-10-16 12:10:18,472 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-10-16 12:10:19,023 WARN L193 SmtUtils]: Spent 461.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2020-10-16 12:10:19,353 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:10:19,694 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2020-10-16 12:10:19,812 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2020-10-16 12:10:19,821 INFO L132 LiptonReduction]: Checked pairs total: 4710 [2020-10-16 12:10:19,821 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:10:19,828 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:10:19,893 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 12:10:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 12:10:19,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:10:19,902 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:19,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:10:19,903 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1003457510, now seen corresponding path program 1 times [2020-10-16 12:10:19,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:19,920 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076968973] [2020-10-16 12:10:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:20,160 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-16 12:10:20,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076968973] [2020-10-16 12:10:20,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:20,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:10:20,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558576302] [2020-10-16 12:10:20,169 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:10:20,170 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:10:20,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,188 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 12:10:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:20,308 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:10:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:10:20,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:10:20,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:20,335 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:10:20,335 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:10:20,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:10:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:10:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:10:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:10:20,429 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 12:10:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:20,430 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:10:20,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:10:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:10:20,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:10:20,432 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:20,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:20,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:10:20,433 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:20,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:20,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1922104647, now seen corresponding path program 1 times [2020-10-16 12:10:20,433 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:20,434 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839149369] [2020-10-16 12:10:20,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:20,564 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-16 12:10:20,567 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839149369] [2020-10-16 12:10:20,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:20,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:10:20,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954477621] [2020-10-16 12:10:20,571 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:10:20,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:20,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:10:20,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,572 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:10:20,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:20,630 INFO L93 Difference]: Finished difference Result 557 states and 1706 transitions. [2020-10-16 12:10:20,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:10:20,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:10:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:20,638 INFO L225 Difference]: With dead ends: 557 [2020-10-16 12:10:20,638 INFO L226 Difference]: Without dead ends: 557 [2020-10-16 12:10:20,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2020-10-16 12:10:20,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 557. [2020-10-16 12:10:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2020-10-16 12:10:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 1706 transitions. [2020-10-16 12:10:20,664 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 1706 transitions. Word has length 9 [2020-10-16 12:10:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:20,665 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 1706 transitions. [2020-10-16 12:10:20,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:10:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 1706 transitions. [2020-10-16 12:10:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:10:20,668 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:20,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:20,668 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:10:20,668 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:20,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1109692064, now seen corresponding path program 1 times [2020-10-16 12:10:20,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:20,669 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107538503] [2020-10-16 12:10:20,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:20,784 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-16 12:10:20,784 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107538503] [2020-10-16 12:10:20,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:20,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:10:20,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305185075] [2020-10-16 12:10:20,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:10:20,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:10:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,787 INFO L87 Difference]: Start difference. First operand 557 states and 1706 transitions. Second operand 3 states. [2020-10-16 12:10:20,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:20,798 INFO L93 Difference]: Finished difference Result 537 states and 1635 transitions. [2020-10-16 12:10:20,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:10:20,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:10:20,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:20,804 INFO L225 Difference]: With dead ends: 537 [2020-10-16 12:10:20,804 INFO L226 Difference]: Without dead ends: 537 [2020-10-16 12:10:20,805 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:10:20,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2020-10-16 12:10:20,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2020-10-16 12:10:20,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 537 states. [2020-10-16 12:10:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 1635 transitions. [2020-10-16 12:10:20,823 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 1635 transitions. Word has length 10 [2020-10-16 12:10:20,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:20,823 INFO L481 AbstractCegarLoop]: Abstraction has 537 states and 1635 transitions. [2020-10-16 12:10:20,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:10:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 1635 transitions. [2020-10-16 12:10:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:10:20,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:20,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:20,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:10:20,837 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:20,842 INFO L82 PathProgramCache]: Analyzing trace with hash -544331920, now seen corresponding path program 1 times [2020-10-16 12:10:20,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:20,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010468811] [2020-10-16 12:10:20,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:20,952 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-16 12:10:20,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010468811] [2020-10-16 12:10:20,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:20,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:10:20,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711074767] [2020-10-16 12:10:20,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:20,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:20,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:20,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:20,955 INFO L87 Difference]: Start difference. First operand 537 states and 1635 transitions. Second operand 4 states. [2020-10-16 12:10:20,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:20,988 INFO L93 Difference]: Finished difference Result 677 states and 2012 transitions. [2020-10-16 12:10:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:10:20,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 12:10:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:20,992 INFO L225 Difference]: With dead ends: 677 [2020-10-16 12:10:20,992 INFO L226 Difference]: Without dead ends: 377 [2020-10-16 12:10:20,993 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-16 12:10:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-10-16 12:10:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-10-16 12:10:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-10-16 12:10:21,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 1077 transitions. [2020-10-16 12:10:21,005 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 1077 transitions. Word has length 10 [2020-10-16 12:10:21,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,006 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 1077 transitions. [2020-10-16 12:10:21,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 1077 transitions. [2020-10-16 12:10:21,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:10:21,007 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:10:21,008 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,008 INFO L82 PathProgramCache]: Analyzing trace with hash -832412433, now seen corresponding path program 1 times [2020-10-16 12:10:21,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812048486] [2020-10-16 12:10:21,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:21,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:21,144 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-16 12:10:21,145 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812048486] [2020-10-16 12:10:21,145 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:21,145 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:10:21,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116371418] [2020-10-16 12:10:21,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:21,146 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:21,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:21,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:21,147 INFO L87 Difference]: Start difference. First operand 377 states and 1077 transitions. Second operand 4 states. [2020-10-16 12:10:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:21,249 INFO L93 Difference]: Finished difference Result 373 states and 1061 transitions. [2020-10-16 12:10:21,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:10:21,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:10:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:21,255 INFO L225 Difference]: With dead ends: 373 [2020-10-16 12:10:21,255 INFO L226 Difference]: Without dead ends: 373 [2020-10-16 12:10:21,256 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2020-10-16 12:10:21,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 373. [2020-10-16 12:10:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2020-10-16 12:10:21,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 1061 transitions. [2020-10-16 12:10:21,269 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 1061 transitions. Word has length 12 [2020-10-16 12:10:21,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,270 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 1061 transitions. [2020-10-16 12:10:21,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:21,270 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 1061 transitions. [2020-10-16 12:10:21,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:10:21,272 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,272 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:10:21,273 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1283342520, now seen corresponding path program 1 times [2020-10-16 12:10:21,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516292778] [2020-10-16 12:10:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:21,464 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-16 12:10:21,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516292778] [2020-10-16 12:10:21,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:21,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:10:21,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615858178] [2020-10-16 12:10:21,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:21,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:21,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:21,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:21,466 INFO L87 Difference]: Start difference. First operand 373 states and 1061 transitions. Second operand 4 states. [2020-10-16 12:10:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:21,503 INFO L93 Difference]: Finished difference Result 358 states and 905 transitions. [2020-10-16 12:10:21,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:10:21,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:10:21,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:21,506 INFO L225 Difference]: With dead ends: 358 [2020-10-16 12:10:21,506 INFO L226 Difference]: Without dead ends: 273 [2020-10-16 12:10:21,507 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:21,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2020-10-16 12:10:21,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2020-10-16 12:10:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2020-10-16 12:10:21,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 677 transitions. [2020-10-16 12:10:21,515 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 677 transitions. Word has length 13 [2020-10-16 12:10:21,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,515 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 677 transitions. [2020-10-16 12:10:21,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 677 transitions. [2020-10-16 12:10:21,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:10:21,516 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,517 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,517 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:10:21,517 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1780441106, now seen corresponding path program 1 times [2020-10-16 12:10:21,518 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868340073] [2020-10-16 12:10:21,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:21,607 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-16 12:10:21,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868340073] [2020-10-16 12:10:21,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:21,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:10:21,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360249175] [2020-10-16 12:10:21,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:10:21,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:21,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:10:21,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:21,610 INFO L87 Difference]: Start difference. First operand 273 states and 677 transitions. Second operand 5 states. [2020-10-16 12:10:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:21,661 INFO L93 Difference]: Finished difference Result 224 states and 509 transitions. [2020-10-16 12:10:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:10:21,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:10:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:21,664 INFO L225 Difference]: With dead ends: 224 [2020-10-16 12:10:21,664 INFO L226 Difference]: Without dead ends: 179 [2020-10-16 12:10:21,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:10:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2020-10-16 12:10:21,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2020-10-16 12:10:21,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2020-10-16 12:10:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 399 transitions. [2020-10-16 12:10:21,670 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 399 transitions. Word has length 14 [2020-10-16 12:10:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,670 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 399 transitions. [2020-10-16 12:10:21,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:10:21,670 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 399 transitions. [2020-10-16 12:10:21,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 12:10:21,671 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:10:21,672 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,672 INFO L82 PathProgramCache]: Analyzing trace with hash 368366191, now seen corresponding path program 1 times [2020-10-16 12:10:21,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394457945] [2020-10-16 12:10:21,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:21,777 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-16 12:10:21,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394457945] [2020-10-16 12:10:21,778 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:21,778 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:10:21,778 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067297589] [2020-10-16 12:10:21,779 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:10:21,779 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:10:21,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:10:21,780 INFO L87 Difference]: Start difference. First operand 179 states and 399 transitions. Second operand 6 states. [2020-10-16 12:10:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:21,837 INFO L93 Difference]: Finished difference Result 161 states and 361 transitions. [2020-10-16 12:10:21,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:10:21,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-16 12:10:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:21,839 INFO L225 Difference]: With dead ends: 161 [2020-10-16 12:10:21,839 INFO L226 Difference]: Without dead ends: 150 [2020-10-16 12:10:21,840 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:10:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2020-10-16 12:10:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2020-10-16 12:10:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-10-16 12:10:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 341 transitions. [2020-10-16 12:10:21,844 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 341 transitions. Word has length 17 [2020-10-16 12:10:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,845 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 341 transitions. [2020-10-16 12:10:21,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:10:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 341 transitions. [2020-10-16 12:10:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:10:21,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:10:21,846 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash 9332787, now seen corresponding path program 1 times [2020-10-16 12:10:21,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550428002] [2020-10-16 12:10:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:21,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:21,920 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-16 12:10:21,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550428002] [2020-10-16 12:10:21,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:21,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:10:21,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370624652] [2020-10-16 12:10:21,923 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:10:21,923 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:10:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:10:21,923 INFO L87 Difference]: Start difference. First operand 150 states and 341 transitions. Second operand 4 states. [2020-10-16 12:10:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:21,949 INFO L93 Difference]: Finished difference Result 188 states and 418 transitions. [2020-10-16 12:10:21,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:10:21,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-16 12:10:21,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:21,951 INFO L225 Difference]: With dead ends: 188 [2020-10-16 12:10:21,951 INFO L226 Difference]: Without dead ends: 70 [2020-10-16 12:10:21,952 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:10:21,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-16 12:10:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-16 12:10:21,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-16 12:10:21,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-16 12:10:21,959 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 21 [2020-10-16 12:10:21,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:21,959 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-16 12:10:21,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:10:21,959 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-16 12:10:21,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:10:21,960 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:21,960 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:21,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:10:21,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:21,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:21,961 INFO L82 PathProgramCache]: Analyzing trace with hash 702820371, now seen corresponding path program 2 times [2020-10-16 12:10:21,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:21,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989848213] [2020-10-16 12:10:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:22,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:10:22,244 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-16 12:10:22,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989848213] [2020-10-16 12:10:22,245 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:10:22,245 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 12:10:22,245 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029424] [2020-10-16 12:10:22,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 12:10:22,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:10:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 12:10:22,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:10:22,247 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 9 states. [2020-10-16 12:10:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:10:22,534 INFO L93 Difference]: Finished difference Result 113 states and 207 transitions. [2020-10-16 12:10:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-16 12:10:22,536 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-10-16 12:10:22,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:10:22,537 INFO L225 Difference]: With dead ends: 113 [2020-10-16 12:10:22,537 INFO L226 Difference]: Without dead ends: 73 [2020-10-16 12:10:22,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2020-10-16 12:10:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-10-16 12:10:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2020-10-16 12:10:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-10-16 12:10:22,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 105 transitions. [2020-10-16 12:10:22,540 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 105 transitions. Word has length 21 [2020-10-16 12:10:22,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:10:22,541 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 105 transitions. [2020-10-16 12:10:22,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 12:10:22,541 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 105 transitions. [2020-10-16 12:10:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:10:22,542 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:10:22,542 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:10:22,542 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:10:22,542 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:10:22,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:10:22,543 INFO L82 PathProgramCache]: Analyzing trace with hash -346290541, now seen corresponding path program 3 times [2020-10-16 12:10:22,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:10:22,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173322236] [2020-10-16 12:10:22,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:10:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:10:22,587 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:10:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:10:22,629 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:10:22,685 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:10:22,685 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:10:22,686 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:10:22,687 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:10:22,703 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L2-->L825: Formula: (let ((.cse7 (= (mod ~x$r_buff1_thd0~0_In484088679 256) 0)) (.cse6 (= (mod ~x$w_buff1_used~0_In484088679 256) 0)) (.cse8 (= (mod ~x$w_buff0_used~0_In484088679 256) 0)) (.cse9 (= (mod ~x$r_buff0_thd0~0_In484088679 256) 0))) (let ((.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse2 (or .cse8 .cse9)) (.cse3 (not .cse6)) (.cse4 (not .cse7)) (.cse5 (or .cse6 .cse7))) (and (= ~x$r_buff1_thd0~0_In484088679 ~x$r_buff1_thd0~0_Out484088679) (or (and .cse0 (= ~x~0_Out484088679 ~x$w_buff0~0_In484088679) .cse1) (and .cse2 (or (and .cse3 (= ~x~0_Out484088679 ~x$w_buff1~0_In484088679) .cse4) (and (= ~x~0_Out484088679 ~x~0_In484088679) .cse5)))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In484088679| ULTIMATE.start_assume_abort_if_not_~cond_Out484088679) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out484088679 0)) (or (and .cse0 (= ~x$w_buff0_used~0_Out484088679 0) .cse1) (and .cse2 (= ~x$w_buff0_used~0_Out484088679 ~x$w_buff0_used~0_In484088679))) (or (and .cse3 (= ~x$w_buff1_used~0_Out484088679 0) .cse4) (and .cse5 (= ~x$w_buff1_used~0_Out484088679 ~x$w_buff1_used~0_In484088679))) (= ~x$r_buff0_thd0~0_In484088679 ~x$r_buff0_thd0~0_Out484088679)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In484088679, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In484088679, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In484088679|, ~x$w_buff1~0=~x$w_buff1~0_In484088679, ~x$w_buff1_used~0=~x$w_buff1_used~0_In484088679, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In484088679, ~x~0=~x~0_In484088679, ~x$w_buff0_used~0=~x$w_buff0_used~0_In484088679} OutVars{~x$w_buff0~0=~x$w_buff0~0_In484088679, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out484088679, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out484088679|, ~x$w_buff1~0=~x$w_buff1~0_In484088679, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out484088679|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out484088679, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out484088679|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out484088679|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out484088679|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out484088679, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out484088679, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out484088679|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In484088679|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out484088679, ~x~0=~x~0_Out484088679} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:10:22,710 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-16 12:10:22,710 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,716 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-16 12:10:22,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,717 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-16 12:10:22,717 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,718 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-16 12:10:22,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,718 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-16 12:10:22,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,719 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-16 12:10:22,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,719 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-16 12:10:22,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,720 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-16 12:10:22,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,721 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-16 12:10:22,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,721 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-16 12:10:22,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,722 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-16 12:10:22,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,722 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-16 12:10:22,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,723 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-16 12:10:22,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,723 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-16 12:10:22,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,723 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-16 12:10:22,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,724 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-16 12:10:22,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,724 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-16 12:10:22,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,724 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-16 12:10:22,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,730 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-16 12:10:22,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,731 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-16 12:10:22,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,731 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-16 12:10:22,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,732 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-16 12:10:22,732 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,732 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-16 12:10:22,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,733 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-16 12:10:22,733 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,734 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-16 12:10:22,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,734 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-16 12:10:22,734 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,735 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-16 12:10:22,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,735 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-16 12:10:22,735 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,735 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-16 12:10:22,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,736 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-16 12:10:22,736 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,737 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-16 12:10:22,737 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:10:22,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:10:22 BasicIcfg [2020-10-16 12:10:22,799 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:10:22,800 INFO L168 Benchmark]: Toolchain (without parser) took 15112.58 ms. Allocated memory was 138.9 MB in the beginning and 375.9 MB in the end (delta: 237.0 MB). Free memory was 100.5 MB in the beginning and 120.5 MB in the end (delta: -20.0 MB). Peak memory consumption was 217.0 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,801 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:10:22,802 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.28 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 158.3 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,803 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.97 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,803 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,804 INFO L168 Benchmark]: RCFGBuilder took 2410.44 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 152.8 MB in the beginning and 176.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,805 INFO L168 Benchmark]: TraceAbstraction took 11770.30 ms. Allocated memory was 250.1 MB in the beginning and 375.9 MB in the end (delta: 125.8 MB). Free memory was 176.5 MB in the beginning and 120.5 MB in the end (delta: 56.0 MB). Peak memory consumption was 181.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:10:22,808 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.50 ms. Allocated memory is still 138.9 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.28 ms. Allocated memory was 138.9 MB in the beginning and 202.4 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 158.3 MB in the end (delta: -58.0 MB). Peak memory consumption was 29.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.97 ms. Allocated memory is still 202.4 MB. Free memory was 158.3 MB in the beginning and 155.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.90 ms. Allocated memory is still 202.4 MB. Free memory was 155.5 MB in the beginning and 152.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2410.44 ms. Allocated memory was 202.4 MB in the beginning and 250.1 MB in the end (delta: 47.7 MB). Free memory was 152.8 MB in the beginning and 176.5 MB in the end (delta: -23.7 MB). Peak memory consumption was 106.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11770.30 ms. Allocated memory was 250.1 MB in the beginning and 375.9 MB in the end (delta: 125.8 MB). Free memory was 176.5 MB in the beginning and 120.5 MB in the end (delta: 56.0 MB). Peak memory consumption was 181.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 850 VarBasedMoverChecksPositive, 33 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 72 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 101 PlacesBefore, 36 PlacesAfterwards, 93 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4710 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p2_EAX = 0; [L702] 0 int __unbuffered_p2_EBX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L726] 0 int z = 0; [L727] 0 _Bool weak$$choice0; [L728] 0 _Bool weak$$choice2; [L809] 0 pthread_t t2284; [L810] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L811] 0 pthread_t t2285; [L812] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L752] 2 x$w_buff1 = x$w_buff0 [L753] 2 x$w_buff0 = 2 [L754] 2 x$w_buff1_used = x$w_buff0_used [L755] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L757] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L758] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L759] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L760] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L761] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L764] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L813] 0 pthread_t t2286; [L814] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L781] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L784] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L732] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L770] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L776] 2 return 0; [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L787] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L788] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L789] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L790] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L791] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L791] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L794] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 3 return 0; [L816] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L828] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L829] 0 x$flush_delayed = weak$$choice2 [L830] 0 x$mem_tmp = x [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L831] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L832] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L832] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L833] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L834] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L834] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L836] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L836] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L839] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L839] 0 x = x$flush_delayed ? x$mem_tmp : x [L840] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 92 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 230 SDtfs, 230 SDslu, 387 SDs, 0 SdLazy, 210 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 12277 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...