/usr/bin/java -Xmx16000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:49:47,987 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:49:47,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:49:48,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:49:48,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:49:48,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:49:48,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:49:48,043 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:49:48,045 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:49:48,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:49:48,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:49:48,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:49:48,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:49:48,054 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:49:48,056 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:49:48,057 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:49:48,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:49:48,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:49:48,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:49:48,068 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:49:48,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:49:48,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:49:48,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:49:48,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:49:48,078 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:49:48,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:49:48,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:49:48,081 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:49:48,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:49:48,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:49:48,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:49:48,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:49:48,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:49:48,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:49:48,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:49:48,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:49:48,088 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:49:48,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:49:48,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:49:48,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:49:48,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:49:48,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:49:48,125 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:49:48,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:49:48,126 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:49:48,127 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:49:48,127 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:49:48,127 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:49:48,127 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:49:48,127 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:49:48,128 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:49:48,128 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:49:48,128 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:49:48,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:49:48,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:49:48,129 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:49:48,129 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:49:48,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:49:48,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:49:48,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:49:48,130 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:49:48,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:49:48,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:49:48,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:49:48,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:49:48,131 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:49:48,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:49:48,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:49:48,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:49:48,443 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:49:48,445 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:49:48,445 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:49:48,446 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2020-10-11 14:49:48,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f76b57b1/d54e86e8b492433c9683676a755536e4/FLAG5d6faeb61 [2020-10-11 14:49:48,945 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:49:48,946 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_tso.oepc.i [2020-10-11 14:49:48,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f76b57b1/d54e86e8b492433c9683676a755536e4/FLAG5d6faeb61 [2020-10-11 14:49:49,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f76b57b1/d54e86e8b492433c9683676a755536e4 [2020-10-11 14:49:49,255 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:49:49,257 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:49:49,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:49:49,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:49:49,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:49:49,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:49:49" (1/1) ... [2020-10-11 14:49:49,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23530ce5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:49, skipping insertion in model container [2020-10-11 14:49:49,269 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:49:49" (1/1) ... [2020-10-11 14:49:49,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:49:49,326 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:49:49,812 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:49:49,826 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:49:49,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:49:50,008 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:49:50,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50 WrapperNode [2020-10-11 14:49:50,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:49:50,010 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:49:50,010 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:49:50,010 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:49:50,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:49:50,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:49:50,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:49:50,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:49:50,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,081 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,081 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,102 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... [2020-10-11 14:49:50,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:49:50,113 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:49:50,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:49:50,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:49:50,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:49:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:49:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:49:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:49:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:49:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:49:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:49:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:49:50,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:49:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:49:50,182 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:49:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:49:50,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:49:50,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:49:50,184 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:49:51,992 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:49:51,992 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:49:51,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:49:51 BoogieIcfgContainer [2020-10-11 14:49:51,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:49:51,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:49:51,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:49:51,999 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:49:51,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:49:49" (1/3) ... [2020-10-11 14:49:52,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41308150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:49:52, skipping insertion in model container [2020-10-11 14:49:52,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:49:50" (2/3) ... [2020-10-11 14:49:52,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41308150 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:49:52, skipping insertion in model container [2020-10-11 14:49:52,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:49:51" (3/3) ... [2020-10-11 14:49:52,003 INFO L111 eAbstractionObserver]: Analyzing ICFG mix035_tso.oepc.i [2020-10-11 14:49:52,013 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:49:52,014 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:49:52,021 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:49:52,022 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:49:52,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,053 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,054 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,057 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,057 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,058 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,058 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,059 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,060 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,061 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,061 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,065 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,066 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,072 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,077 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,079 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,080 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,081 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,082 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,083 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,089 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,090 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,090 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,091 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,091 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,093 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,093 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,094 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,095 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:49:52,109 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-11 14:49:52,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:49:52,130 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:49:52,130 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:49:52,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:49:52,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:49:52,130 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:49:52,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:49:52,131 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:49:52,144 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:49:52,147 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 98 transitions, 211 flow [2020-10-11 14:49:52,149 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 98 transitions, 211 flow [2020-10-11 14:49:52,151 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 106 places, 98 transitions, 211 flow [2020-10-11 14:49:52,200 INFO L129 PetriNetUnfolder]: 2/95 cut-off events. [2020-10-11 14:49:52,201 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:49:52,206 INFO L80 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 95 events. 2/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-11 14:49:52,210 INFO L117 LiptonReduction]: Number of co-enabled transitions 1814 [2020-10-11 14:49:52,284 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,335 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,376 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,380 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,757 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:49:52,902 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,930 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,933 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,976 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:52,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:52,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:52,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:52,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,000 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,238 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,242 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,260 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,516 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2020-10-11 14:49:53,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,587 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,606 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,608 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,610 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,676 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:49:53,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,695 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,699 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,700 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,714 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,716 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,746 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,837 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,838 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,840 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,841 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,889 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,892 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,909 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:49:53,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:49:53,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:53,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:49:53,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:49:55,131 WARN L193 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-11 14:49:55,253 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-11 14:49:55,262 INFO L132 LiptonReduction]: Checked pairs total: 5402 [2020-10-11 14:49:55,262 INFO L134 LiptonReduction]: Total number of compositions: 79 [2020-10-11 14:49:55,268 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2020-10-11 14:49:55,334 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1154 states. [2020-10-11 14:49:55,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states. [2020-10-11 14:49:55,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 14:49:55,342 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:55,343 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 14:49:55,343 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:55,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:55,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1057971, now seen corresponding path program 1 times [2020-10-11 14:49:55,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:55,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861125480] [2020-10-11 14:49:55,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:55,555 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-11 14:49:55,555 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861125480] [2020-10-11 14:49:55,556 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:55,556 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:49:55,557 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686012307] [2020-10-11 14:49:55,562 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:49:55,562 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:49:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:49:55,579 INFO L87 Difference]: Start difference. First operand 1154 states. Second operand 3 states. [2020-10-11 14:49:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:55,663 INFO L93 Difference]: Finished difference Result 962 states and 3090 transitions. [2020-10-11 14:49:55,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:49:55,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 14:49:55,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:55,694 INFO L225 Difference]: With dead ends: 962 [2020-10-11 14:49:55,695 INFO L226 Difference]: Without dead ends: 812 [2020-10-11 14:49:55,696 INFO L673 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-11 14:49:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-10-11 14:49:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2020-10-11 14:49:55,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-10-11 14:49:55,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2020-10-11 14:49:55,817 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2020-10-11 14:49:55,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:55,818 INFO L481 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2020-10-11 14:49:55,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:49:55,818 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2020-10-11 14:49:55,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-11 14:49:55,820 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:55,820 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:55,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:49:55,821 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:55,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:55,821 INFO L82 PathProgramCache]: Analyzing trace with hash 924426136, now seen corresponding path program 1 times [2020-10-11 14:49:55,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:55,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639034584] [2020-10-11 14:49:55,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:55,960 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-11 14:49:55,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639034584] [2020-10-11 14:49:55,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:55,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:49:55,961 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579099502] [2020-10-11 14:49:55,962 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:49:55,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:55,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:49:55,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:49:55,963 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand 4 states. [2020-10-11 14:49:55,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:55,996 INFO L93 Difference]: Finished difference Result 862 states and 2630 transitions. [2020-10-11 14:49:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:49:55,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-11 14:49:55,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:56,002 INFO L225 Difference]: With dead ends: 862 [2020-10-11 14:49:56,002 INFO L226 Difference]: Without dead ends: 712 [2020-10-11 14:49:56,003 INFO L673 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-11 14:49:56,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2020-10-11 14:49:56,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 712. [2020-10-11 14:49:56,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2020-10-11 14:49:56,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 2215 transitions. [2020-10-11 14:49:56,031 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 2215 transitions. Word has length 10 [2020-10-11 14:49:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:56,034 INFO L481 AbstractCegarLoop]: Abstraction has 712 states and 2215 transitions. [2020-10-11 14:49:56,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:49:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 2215 transitions. [2020-10-11 14:49:56,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:49:56,045 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:56,045 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:56,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:49:56,046 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:56,046 INFO L82 PathProgramCache]: Analyzing trace with hash -787693994, now seen corresponding path program 1 times [2020-10-11 14:49:56,046 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:56,046 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712807168] [2020-10-11 14:49:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:56,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:56,190 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-11 14:49:56,191 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712807168] [2020-10-11 14:49:56,191 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:56,191 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:49:56,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172974506] [2020-10-11 14:49:56,192 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:49:56,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:49:56,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:49:56,192 INFO L87 Difference]: Start difference. First operand 712 states and 2215 transitions. Second operand 4 states. [2020-10-11 14:49:56,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:56,230 INFO L93 Difference]: Finished difference Result 606 states and 1636 transitions. [2020-10-11 14:49:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:49:56,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-11 14:49:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:56,233 INFO L225 Difference]: With dead ends: 606 [2020-10-11 14:49:56,233 INFO L226 Difference]: Without dead ends: 456 [2020-10-11 14:49:56,234 INFO L673 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-11 14:49:56,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2020-10-11 14:49:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2020-10-11 14:49:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-10-11 14:49:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1191 transitions. [2020-10-11 14:49:56,247 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1191 transitions. Word has length 12 [2020-10-11 14:49:56,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:56,248 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1191 transitions. [2020-10-11 14:49:56,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:49:56,248 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1191 transitions. [2020-10-11 14:49:56,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:49:56,249 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:56,249 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:56,249 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:49:56,250 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:56,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:56,250 INFO L82 PathProgramCache]: Analyzing trace with hash 813961416, now seen corresponding path program 1 times [2020-10-11 14:49:56,250 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:56,250 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660765973] [2020-10-11 14:49:56,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:56,414 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-11 14:49:56,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660765973] [2020-10-11 14:49:56,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:56,415 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:49:56,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569136319] [2020-10-11 14:49:56,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:49:56,416 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:56,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:49:56,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:49:56,416 INFO L87 Difference]: Start difference. First operand 456 states and 1191 transitions. Second operand 5 states. [2020-10-11 14:49:56,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:56,463 INFO L93 Difference]: Finished difference Result 334 states and 796 transitions. [2020-10-11 14:49:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:49:56,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-11 14:49:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:56,465 INFO L225 Difference]: With dead ends: 334 [2020-10-11 14:49:56,466 INFO L226 Difference]: Without dead ends: 264 [2020-10-11 14:49:56,466 INFO L673 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-11 14:49:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2020-10-11 14:49:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2020-10-11 14:49:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2020-10-11 14:49:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 615 transitions. [2020-10-11 14:49:56,473 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 615 transitions. Word has length 15 [2020-10-11 14:49:56,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:56,473 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 615 transitions. [2020-10-11 14:49:56,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:49:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 615 transitions. [2020-10-11 14:49:56,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:49:56,475 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:56,475 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:56,475 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:49:56,475 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:56,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1963294083, now seen corresponding path program 1 times [2020-10-11 14:49:56,476 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:56,476 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383973857] [2020-10-11 14:49:56,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:56,756 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-11 14:49:56,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383973857] [2020-10-11 14:49:56,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:56,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:49:56,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612197210] [2020-10-11 14:49:56,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:49:56,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:56,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:49:56,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:49:56,758 INFO L87 Difference]: Start difference. First operand 264 states and 615 transitions. Second operand 7 states. [2020-10-11 14:49:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:56,964 INFO L93 Difference]: Finished difference Result 421 states and 935 transitions. [2020-10-11 14:49:56,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:49:56,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-11 14:49:56,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:56,968 INFO L225 Difference]: With dead ends: 421 [2020-10-11 14:49:56,968 INFO L226 Difference]: Without dead ends: 350 [2020-10-11 14:49:56,969 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:49:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-11 14:49:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 307. [2020-10-11 14:49:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2020-10-11 14:49:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 703 transitions. [2020-10-11 14:49:56,983 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 703 transitions. Word has length 19 [2020-10-11 14:49:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:56,984 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 703 transitions. [2020-10-11 14:49:56,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:49:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 703 transitions. [2020-10-11 14:49:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:49:56,985 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:56,985 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:56,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:49:56,985 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:56,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 1228019295, now seen corresponding path program 2 times [2020-10-11 14:49:56,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:56,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632580970] [2020-10-11 14:49:56,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:57,195 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-11 14:49:57,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632580970] [2020-10-11 14:49:57,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:57,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:49:57,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553454074] [2020-10-11 14:49:57,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:49:57,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:57,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:49:57,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:49:57,198 INFO L87 Difference]: Start difference. First operand 307 states and 703 transitions. Second operand 6 states. [2020-10-11 14:49:57,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:57,256 INFO L93 Difference]: Finished difference Result 273 states and 630 transitions. [2020-10-11 14:49:57,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:49:57,256 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-11 14:49:57,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:57,259 INFO L225 Difference]: With dead ends: 273 [2020-10-11 14:49:57,259 INFO L226 Difference]: Without dead ends: 236 [2020-10-11 14:49:57,260 INFO L673 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-11 14:49:57,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2020-10-11 14:49:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2020-10-11 14:49:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-10-11 14:49:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 553 transitions. [2020-10-11 14:49:57,266 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 553 transitions. Word has length 19 [2020-10-11 14:49:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:57,266 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 553 transitions. [2020-10-11 14:49:57,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:49:57,266 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 553 transitions. [2020-10-11 14:49:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 14:49:57,267 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:57,268 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:57,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:49:57,268 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:57,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash -697152861, now seen corresponding path program 1 times [2020-10-11 14:49:57,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:57,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094952686] [2020-10-11 14:49:57,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:57,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:57,391 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-11 14:49:57,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094952686] [2020-10-11 14:49:57,392 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:57,392 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:49:57,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261578656] [2020-10-11 14:49:57,392 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:49:57,393 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:57,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:49:57,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:49:57,393 INFO L87 Difference]: Start difference. First operand 236 states and 553 transitions. Second operand 6 states. [2020-10-11 14:49:57,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:57,556 INFO L93 Difference]: Finished difference Result 370 states and 856 transitions. [2020-10-11 14:49:57,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:49:57,556 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-10-11 14:49:57,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:57,558 INFO L225 Difference]: With dead ends: 370 [2020-10-11 14:49:57,558 INFO L226 Difference]: Without dead ends: 204 [2020-10-11 14:49:57,558 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:49:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-10-11 14:49:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 186. [2020-10-11 14:49:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2020-10-11 14:49:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 417 transitions. [2020-10-11 14:49:57,564 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 417 transitions. Word has length 23 [2020-10-11 14:49:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:57,564 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 417 transitions. [2020-10-11 14:49:57,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:49:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 417 transitions. [2020-10-11 14:49:57,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 14:49:57,565 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:57,565 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:57,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:49:57,566 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:57,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:57,566 INFO L82 PathProgramCache]: Analyzing trace with hash 771170915, now seen corresponding path program 2 times [2020-10-11 14:49:57,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:57,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753763554] [2020-10-11 14:49:57,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:49:57,816 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-11 14:49:57,816 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753763554] [2020-10-11 14:49:57,817 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:49:57,817 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:49:57,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396223313] [2020-10-11 14:49:57,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:49:57,818 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:49:57,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:49:57,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:49:57,818 INFO L87 Difference]: Start difference. First operand 186 states and 417 transitions. Second operand 8 states. [2020-10-11 14:49:58,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:49:58,023 INFO L93 Difference]: Finished difference Result 201 states and 440 transitions. [2020-10-11 14:49:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:49:58,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-10-11 14:49:58,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:49:58,025 INFO L225 Difference]: With dead ends: 201 [2020-10-11 14:49:58,025 INFO L226 Difference]: Without dead ends: 140 [2020-10-11 14:49:58,025 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-10-11 14:49:58,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2020-10-11 14:49:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 120. [2020-10-11 14:49:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2020-10-11 14:49:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 259 transitions. [2020-10-11 14:49:58,030 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 259 transitions. Word has length 23 [2020-10-11 14:49:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:49:58,030 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 259 transitions. [2020-10-11 14:49:58,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:49:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 259 transitions. [2020-10-11 14:49:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-11 14:49:58,031 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:49:58,031 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:49:58,031 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:49:58,031 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:49:58,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:49:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1587453619, now seen corresponding path program 3 times [2020-10-11 14:49:58,033 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:49:58,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890064627] [2020-10-11 14:49:58,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:49:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:49:58,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:49:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:49:58,181 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:49:58,237 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:49:58,237 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:49:58,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:49:58,265 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-11 14:49:58,265 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,272 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-11 14:49:58,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,273 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-11 14:49:58,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,273 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-11 14:49:58,273 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,273 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-11 14:49:58,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,274 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-11 14:49:58,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,274 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-11 14:49:58,274 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,275 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-11 14:49:58,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,275 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-11 14:49:58,275 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,276 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-11 14:49:58,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,276 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-11 14:49:58,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,276 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-11 14:49:58,276 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,276 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-11 14:49:58,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,277 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-11 14:49:58,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,277 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-11 14:49:58,277 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,277 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-11 14:49:58,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,278 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-11 14:49:58,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,278 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-11 14:49:58,278 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,282 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-11 14:49:58,282 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,283 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-11 14:49:58,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,283 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-11 14:49:58,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,283 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-11 14:49:58,283 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,284 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-11 14:49:58,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,284 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-11 14:49:58,284 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,285 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-11 14:49:58,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,285 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-11 14:49:58,285 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,285 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-11 14:49:58,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,286 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-11 14:49:58,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,286 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-11 14:49:58,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,288 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-11 14:49:58,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,288 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-11 14:49:58,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,288 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-11 14:49:58,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,289 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-11 14:49:58,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,289 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-11 14:49:58,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:49:58,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:49:58 BasicIcfg [2020-10-11 14:49:58,367 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:49:58,369 INFO L168 Benchmark]: Toolchain (without parser) took 9112.07 ms. Allocated memory was 253.8 MB in the beginning and 518.0 MB in the end (delta: 264.2 MB). Free memory was 209.7 MB in the beginning and 239.9 MB in the end (delta: -30.2 MB). Peak memory consumption was 234.1 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,369 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:49:58,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 748.77 ms. Allocated memory was 253.8 MB in the beginning and 320.9 MB in the end (delta: 67.1 MB). Free memory was 209.7 MB in the beginning and 273.3 MB in the end (delta: -63.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.29 ms. Allocated memory is still 320.9 MB. Free memory was 273.3 MB in the beginning and 270.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,371 INFO L168 Benchmark]: Boogie Preprocessor took 47.23 ms. Allocated memory is still 320.9 MB. Free memory was 270.8 MB in the beginning and 268.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,372 INFO L168 Benchmark]: RCFGBuilder took 1881.76 ms. Allocated memory was 320.9 MB in the beginning and 361.2 MB in the end (delta: 40.4 MB). Free memory was 268.3 MB in the beginning and 195.4 MB in the end (delta: 72.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,373 INFO L168 Benchmark]: TraceAbstraction took 6371.29 ms. Allocated memory was 361.2 MB in the beginning and 518.0 MB in the end (delta: 156.8 MB). Free memory was 195.4 MB in the beginning and 239.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. [2020-10-11 14:49:58,377 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.21 ms. Allocated memory is still 253.8 MB. Free memory is still 230.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 748.77 ms. Allocated memory was 253.8 MB in the beginning and 320.9 MB in the end (delta: 67.1 MB). Free memory was 209.7 MB in the beginning and 273.3 MB in the end (delta: -63.6 MB). Peak memory consumption was 33.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 55.29 ms. Allocated memory is still 320.9 MB. Free memory was 273.3 MB in the beginning and 270.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 47.23 ms. Allocated memory is still 320.9 MB. Free memory was 270.8 MB in the beginning and 268.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1881.76 ms. Allocated memory was 320.9 MB in the beginning and 361.2 MB in the end (delta: 40.4 MB). Free memory was 268.3 MB in the beginning and 195.4 MB in the end (delta: 72.9 MB). Peak memory consumption was 113.3 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6371.29 ms. Allocated memory was 361.2 MB in the beginning and 518.0 MB in the end (delta: 156.8 MB). Free memory was 195.4 MB in the beginning and 239.9 MB in the end (delta: -44.5 MB). Peak memory consumption was 112.2 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1203 VarBasedMoverChecksPositive, 67 VarBasedMoverChecksNegative, 26 SemBasedMoverChecksPositive, 41 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 158 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.1s, 106 PlacesBefore, 38 PlacesAfterwards, 98 TransitionsBefore, 29 TransitionsAfterwards, 1814 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 79 TotalNumberOfCompositions, 5402 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_p0_EAX = 0; [L702] 0 int __unbuffered_p1_EAX = 0; [L704] 0 int __unbuffered_p2_EAX = 0; [L706] 0 int __unbuffered_p2_EBX = 0; [L708] 0 int a = 0; [L709] 0 _Bool a$flush_delayed; [L710] 0 int a$mem_tmp; [L711] 0 _Bool a$r_buff0_thd0; [L712] 0 _Bool a$r_buff0_thd1; [L713] 0 _Bool a$r_buff0_thd2; [L714] 0 _Bool a$r_buff0_thd3; [L715] 0 _Bool a$r_buff1_thd0; [L716] 0 _Bool a$r_buff1_thd1; [L717] 0 _Bool a$r_buff1_thd2; [L718] 0 _Bool a$r_buff1_thd3; [L719] 0 _Bool a$read_delayed; [L720] 0 int *a$read_delayed_var; [L721] 0 int a$w_buff0; [L722] 0 _Bool a$w_buff0_used; [L723] 0 int a$w_buff1; [L724] 0 _Bool a$w_buff1_used; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L834] 0 pthread_t t931; [L835] FCALL, FORK 0 pthread_create(&t931, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L738] 1 a$w_buff1 = a$w_buff0 [L739] 1 a$w_buff0 = 1 [L740] 1 a$w_buff1_used = a$w_buff0_used [L741] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L743] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L744] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L745] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L746] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L747] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L836] 0 pthread_t t932; [L750] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L837] FCALL, FORK 0 pthread_create(&t932, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L838] 0 pthread_t t933; [L839] FCALL, FORK 0 pthread_create(&t933, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L770] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 3 y = 1 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L793] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 a$flush_delayed = weak$$choice2 [L799] 3 a$mem_tmp = a [L800] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L800] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L801] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L801] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L801] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L801] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L802] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L802] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L803] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L803] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L803] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L803] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L804] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L804] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L805] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L805] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L806] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EBX = a [L808] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L808] 3 a = a$flush_delayed ? a$mem_tmp : a [L809] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L753] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L753] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L754] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L754] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L755] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L755] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L756] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L756] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L757] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L757] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L816] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L816] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L773] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L773] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L774] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L774] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L775] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L775] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L776] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L776] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L777] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L777] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L845] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L845] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L846] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L846] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L847] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L847] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L848] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L848] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L849] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L849] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L852] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.1s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 284 SDtfs, 318 SDslu, 679 SDs, 0 SdLazy, 318 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1154occurred 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, 8 MinimizatonAttempts, 81 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 13366 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...