/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/mix040_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:19:57,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:19:57,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:19:57,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:19:57,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:19:57,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:19:57,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:19:57,091 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:19:57,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:19:57,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:19:57,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:19:57,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:19:57,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:19:57,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:19:57,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:19:57,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:19:57,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:19:57,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:19:57,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:19:57,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:19:57,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:19:57,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:19:57,110 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:19:57,111 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:19:57,118 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:19:57,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:19:57,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:19:57,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:19:57,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:19:57,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:19:57,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:19:57,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:19:57,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:19:57,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:19:57,128 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:19:57,128 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:19:57,129 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:19:57,129 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:19:57,129 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:19:57,130 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:19:57,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:19:57,141 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-15 18:19:57,181 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:19:57,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:19:57,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:19:57,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:19:57,184 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:19:57,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:19:57,185 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:19:57,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:19:57,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:19:57,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:19:57,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:19:57,187 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:19:57,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:19:57,187 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:19:57,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:19:57,189 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:19:57,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:19:57,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:19:57,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:19:57,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:19:57,190 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:19:57,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:19:57,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:19:57,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:19:57,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:19:57,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:19:57,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:19:57,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:19:57,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:19:57,191 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:19:57,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:19:57,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:19:57,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:19:57,534 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:19:57,536 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:19:57,537 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2020-10-15 18:19:57,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8048bbe3c/72f433f5424f4a5da1df5ca7de191397/FLAG677653e01 [2020-10-15 18:19:58,085 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:19:58,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040_tso.opt.i [2020-10-15 18:19:58,105 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8048bbe3c/72f433f5424f4a5da1df5ca7de191397/FLAG677653e01 [2020-10-15 18:19:58,430 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8048bbe3c/72f433f5424f4a5da1df5ca7de191397 [2020-10-15 18:19:58,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:19:58,440 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:19:58,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:19:58,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:19:58,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:19:58,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:19:58" (1/1) ... [2020-10-15 18:19:58,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa613b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:58, skipping insertion in model container [2020-10-15 18:19:58,457 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:19:58" (1/1) ... [2020-10-15 18:19:58,467 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:19:58,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:19:59,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:19:59,087 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:19:59,150 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:19:59,249 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:19:59,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59 WrapperNode [2020-10-15 18:19:59,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:19:59,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:19:59,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:19:59,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:19:59,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,288 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,321 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:19:59,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:19:59,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:19:59,321 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:19:59,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,338 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,338 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,359 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,373 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (1/1) ... [2020-10-15 18:19:59,379 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:19:59,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:19:59,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:19:59,380 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:19:59,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (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-15 18:19:59,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:19:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:19:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:19:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:19:59,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:19:59,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:19:59,454 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:19:59,455 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:19:59,455 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-15 18:19:59,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-15 18:19:59,456 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-15 18:19:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-15 18:19:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:19:59,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:19:59,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:19:59,459 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:20:01,167 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:20:01,167 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:20:01,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:20:01 BoogieIcfgContainer [2020-10-15 18:20:01,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:20:01,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:20:01,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:20:01,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:20:01,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:19:58" (1/3) ... [2020-10-15 18:20:01,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5949c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:20:01, skipping insertion in model container [2020-10-15 18:20:01,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:19:59" (2/3) ... [2020-10-15 18:20:01,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5949c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:20:01, skipping insertion in model container [2020-10-15 18:20:01,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:20:01" (3/3) ... [2020-10-15 18:20:01,179 INFO L111 eAbstractionObserver]: Analyzing ICFG mix040_tso.opt.i [2020-10-15 18:20:01,190 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:20:01,191 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:20:01,199 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:20:01,200 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:20:01,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,232 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,233 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,233 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,234 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,234 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,235 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,236 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,236 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,237 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,238 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,239 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,240 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,241 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,242 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,244 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,245 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,245 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,246 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,246 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,247 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,248 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,249 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,253 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,267 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,267 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,268 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,268 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,269 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,269 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,271 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,272 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:20:01,286 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-15 18:20:01,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:20:01,308 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:20:01,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:20:01,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:20:01,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:20:01,309 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:20:01,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:20:01,309 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:20:01,324 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:20:01,327 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-15 18:20:01,330 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 111 transitions, 242 flow [2020-10-15 18:20:01,332 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 122 places, 111 transitions, 242 flow [2020-10-15 18:20:01,383 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2020-10-15 18:20:01,384 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:20:01,389 INFO L80 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 75 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2020-10-15 18:20:01,393 INFO L117 LiptonReduction]: Number of co-enabled transitions 2432 [2020-10-15 18:20:01,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:20:01,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:20:01,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:01,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:01,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:01,656 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:01,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:01,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:01,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:20:01,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:01,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:01,671 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:01,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:02,156 WARN L193 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:20:02,261 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 18:20:02,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:20:02,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:02,493 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:02,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:02,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:02,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:20:02,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:20:02,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:20:02,522 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:20:02,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:02,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:02,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:02,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:02,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:20:02,529 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:20:02,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:20:02,666 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:20:02,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:03,195 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-15 18:20:03,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:20:03,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:20:03,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:20:03,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:03,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,267 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,270 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:20:03,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,564 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:20:03,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,565 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,566 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,750 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:20:03,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:20:03,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:20:03,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:20:03,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:03,803 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:20:03,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:20:03,806 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:20:03,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:04,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:20:04,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:04,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:20:04,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:04,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-15 18:20:04,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:20:04,951 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-15 18:20:05,089 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-15 18:20:05,100 INFO L132 LiptonReduction]: Checked pairs total: 5758 [2020-10-15 18:20:05,100 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-15 18:20:05,107 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 33 transitions, 86 flow [2020-10-15 18:20:05,282 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2858 states. [2020-10-15 18:20:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states. [2020-10-15 18:20:05,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:20:05,293 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:05,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:05,294 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:05,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:05,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1119963166, now seen corresponding path program 1 times [2020-10-15 18:20:05,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:05,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735001469] [2020-10-15 18:20:05,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:05,584 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-15 18:20:05,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735001469] [2020-10-15 18:20:05,587 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:05,587 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:20:05,588 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505158119] [2020-10-15 18:20:05,593 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:20:05,594 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:20:05,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:20:05,613 INFO L87 Difference]: Start difference. First operand 2858 states. Second operand 3 states. [2020-10-15 18:20:05,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:05,789 INFO L93 Difference]: Finished difference Result 2474 states and 9536 transitions. [2020-10-15 18:20:05,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:20:05,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-15 18:20:05,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:05,831 INFO L225 Difference]: With dead ends: 2474 [2020-10-15 18:20:05,831 INFO L226 Difference]: Without dead ends: 2090 [2020-10-15 18:20:05,833 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:20:05,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2020-10-15 18:20:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2020-10-15 18:20:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2090 states. [2020-10-15 18:20:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7968 transitions. [2020-10-15 18:20:05,994 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7968 transitions. Word has length 9 [2020-10-15 18:20:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:05,996 INFO L481 AbstractCegarLoop]: Abstraction has 2090 states and 7968 transitions. [2020-10-15 18:20:05,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:20:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7968 transitions. [2020-10-15 18:20:05,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:20:05,999 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:06,000 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:06,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:20:06,000 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:06,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:06,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1515313116, now seen corresponding path program 1 times [2020-10-15 18:20:06,001 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:06,001 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293343864] [2020-10-15 18:20:06,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:06,173 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-15 18:20:06,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293343864] [2020-10-15 18:20:06,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:06,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:20:06,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121573850] [2020-10-15 18:20:06,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:06,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:06,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:06,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:06,177 INFO L87 Difference]: Start difference. First operand 2090 states and 7968 transitions. Second operand 4 states. [2020-10-15 18:20:06,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:06,238 INFO L93 Difference]: Finished difference Result 2378 states and 8760 transitions. [2020-10-15 18:20:06,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:06,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-15 18:20:06,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:06,258 INFO L225 Difference]: With dead ends: 2378 [2020-10-15 18:20:06,258 INFO L226 Difference]: Without dead ends: 1994 [2020-10-15 18:20:06,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:06,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1994 states. [2020-10-15 18:20:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1994 to 1994. [2020-10-15 18:20:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1994 states. [2020-10-15 18:20:06,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 7528 transitions. [2020-10-15 18:20:06,342 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 7528 transitions. Word has length 12 [2020-10-15 18:20:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:06,342 INFO L481 AbstractCegarLoop]: Abstraction has 1994 states and 7528 transitions. [2020-10-15 18:20:06,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:06,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 7528 transitions. [2020-10-15 18:20:06,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-15 18:20:06,345 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:06,345 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:06,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:20:06,346 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:06,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:06,346 INFO L82 PathProgramCache]: Analyzing trace with hash -211490932, now seen corresponding path program 1 times [2020-10-15 18:20:06,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:06,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273674475] [2020-10-15 18:20:06,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:06,467 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-15 18:20:06,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273674475] [2020-10-15 18:20:06,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:06,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:20:06,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613283675] [2020-10-15 18:20:06,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:06,470 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:06,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:06,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:06,472 INFO L87 Difference]: Start difference. First operand 1994 states and 7528 transitions. Second operand 4 states. [2020-10-15 18:20:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:06,539 INFO L93 Difference]: Finished difference Result 2210 states and 8104 transitions. [2020-10-15 18:20:06,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:06,540 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-15 18:20:06,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:06,559 INFO L225 Difference]: With dead ends: 2210 [2020-10-15 18:20:06,560 INFO L226 Difference]: Without dead ends: 1922 [2020-10-15 18:20:06,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1922 states. [2020-10-15 18:20:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1922 to 1922. [2020-10-15 18:20:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2020-10-15 18:20:06,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 7204 transitions. [2020-10-15 18:20:06,636 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 7204 transitions. Word has length 13 [2020-10-15 18:20:06,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:06,636 INFO L481 AbstractCegarLoop]: Abstraction has 1922 states and 7204 transitions. [2020-10-15 18:20:06,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:06,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 7204 transitions. [2020-10-15 18:20:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-15 18:20:06,639 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:06,639 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:06,639 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:20:06,640 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:06,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2033806667, now seen corresponding path program 1 times [2020-10-15 18:20:06,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:06,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538973404] [2020-10-15 18:20:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:06,762 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-15 18:20:06,763 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538973404] [2020-10-15 18:20:06,763 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:06,763 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-15 18:20:06,764 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976487101] [2020-10-15 18:20:06,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:06,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:06,765 INFO L87 Difference]: Start difference. First operand 1922 states and 7204 transitions. Second operand 4 states. [2020-10-15 18:20:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:06,803 INFO L93 Difference]: Finished difference Result 2022 states and 7366 transitions. [2020-10-15 18:20:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:06,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-15 18:20:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:06,820 INFO L225 Difference]: With dead ends: 2022 [2020-10-15 18:20:06,821 INFO L226 Difference]: Without dead ends: 1722 [2020-10-15 18:20:06,821 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2020-10-15 18:20:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1722. [2020-10-15 18:20:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2020-10-15 18:20:06,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 6380 transitions. [2020-10-15 18:20:06,890 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 6380 transitions. Word has length 14 [2020-10-15 18:20:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:06,890 INFO L481 AbstractCegarLoop]: Abstraction has 1722 states and 6380 transitions. [2020-10-15 18:20:06,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 6380 transitions. [2020-10-15 18:20:06,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-15 18:20:06,894 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:06,894 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:06,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:20:06,895 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:06,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:06,895 INFO L82 PathProgramCache]: Analyzing trace with hash 302507353, now seen corresponding path program 1 times [2020-10-15 18:20:06,895 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:06,896 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240864774] [2020-10-15 18:20:06,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:06,976 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-15 18:20:06,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240864774] [2020-10-15 18:20:06,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:06,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:20:06,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648835371] [2020-10-15 18:20:06,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:06,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:06,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:06,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:06,979 INFO L87 Difference]: Start difference. First operand 1722 states and 6380 transitions. Second operand 4 states. [2020-10-15 18:20:07,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:07,032 INFO L93 Difference]: Finished difference Result 1734 states and 5839 transitions. [2020-10-15 18:20:07,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:07,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-15 18:20:07,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:07,044 INFO L225 Difference]: With dead ends: 1734 [2020-10-15 18:20:07,044 INFO L226 Difference]: Without dead ends: 1350 [2020-10-15 18:20:07,044 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:07,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-10-15 18:20:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1350. [2020-10-15 18:20:07,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2020-10-15 18:20:07,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 4520 transitions. [2020-10-15 18:20:07,089 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 4520 transitions. Word has length 16 [2020-10-15 18:20:07,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:07,089 INFO L481 AbstractCegarLoop]: Abstraction has 1350 states and 4520 transitions. [2020-10-15 18:20:07,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:07,089 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 4520 transitions. [2020-10-15 18:20:07,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-15 18:20:07,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:07,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:07,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:20:07,093 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:07,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:07,094 INFO L82 PathProgramCache]: Analyzing trace with hash -263809405, now seen corresponding path program 1 times [2020-10-15 18:20:07,094 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:07,094 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250735340] [2020-10-15 18:20:07,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:07,155 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-15 18:20:07,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250735340] [2020-10-15 18:20:07,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:07,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:20:07,156 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970590219] [2020-10-15 18:20:07,156 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:07,156 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:07,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:07,157 INFO L87 Difference]: Start difference. First operand 1350 states and 4520 transitions. Second operand 4 states. [2020-10-15 18:20:07,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:07,194 INFO L93 Difference]: Finished difference Result 2014 states and 6492 transitions. [2020-10-15 18:20:07,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:07,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-15 18:20:07,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:07,206 INFO L225 Difference]: With dead ends: 2014 [2020-10-15 18:20:07,206 INFO L226 Difference]: Without dead ends: 1424 [2020-10-15 18:20:07,207 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:07,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-10-15 18:20:07,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 1304. [2020-10-15 18:20:07,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1304 states. [2020-10-15 18:20:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 4174 transitions. [2020-10-15 18:20:07,254 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 4174 transitions. Word has length 17 [2020-10-15 18:20:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:07,254 INFO L481 AbstractCegarLoop]: Abstraction has 1304 states and 4174 transitions. [2020-10-15 18:20:07,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 4174 transitions. [2020-10-15 18:20:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-15 18:20:07,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:07,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:07,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:20:07,258 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash -2129023803, now seen corresponding path program 1 times [2020-10-15 18:20:07,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:07,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083490899] [2020-10-15 18:20:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:07,422 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-15 18:20:07,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083490899] [2020-10-15 18:20:07,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:07,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:20:07,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561134940] [2020-10-15 18:20:07,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:20:07,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:07,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:20:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:07,424 INFO L87 Difference]: Start difference. First operand 1304 states and 4174 transitions. Second operand 5 states. [2020-10-15 18:20:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:07,497 INFO L93 Difference]: Finished difference Result 1087 states and 3136 transitions. [2020-10-15 18:20:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:20:07,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-10-15 18:20:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:07,505 INFO L225 Difference]: With dead ends: 1087 [2020-10-15 18:20:07,505 INFO L226 Difference]: Without dead ends: 838 [2020-10-15 18:20:07,506 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:20:07,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2020-10-15 18:20:07,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2020-10-15 18:20:07,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2020-10-15 18:20:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 2372 transitions. [2020-10-15 18:20:07,530 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 2372 transitions. Word has length 18 [2020-10-15 18:20:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:07,530 INFO L481 AbstractCegarLoop]: Abstraction has 838 states and 2372 transitions. [2020-10-15 18:20:07,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:20:07,531 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 2372 transitions. [2020-10-15 18:20:07,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:20:07,535 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:07,535 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:07,535 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:20:07,536 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:07,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:07,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1324875424, now seen corresponding path program 1 times [2020-10-15 18:20:07,536 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:07,537 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269573842] [2020-10-15 18:20:07,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:07,634 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-15 18:20:07,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269573842] [2020-10-15 18:20:07,635 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:07,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:20:07,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233913388] [2020-10-15 18:20:07,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:20:07,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:07,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:20:07,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:20:07,636 INFO L87 Difference]: Start difference. First operand 838 states and 2372 transitions. Second operand 4 states. [2020-10-15 18:20:07,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:07,668 INFO L93 Difference]: Finished difference Result 1226 states and 3318 transitions. [2020-10-15 18:20:07,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:07,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-15 18:20:07,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:07,674 INFO L225 Difference]: With dead ends: 1226 [2020-10-15 18:20:07,674 INFO L226 Difference]: Without dead ends: 856 [2020-10-15 18:20:07,675 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2020-10-15 18:20:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 824. [2020-10-15 18:20:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 824 states. [2020-10-15 18:20:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2208 transitions. [2020-10-15 18:20:07,695 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2208 transitions. Word has length 20 [2020-10-15 18:20:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:07,696 INFO L481 AbstractCegarLoop]: Abstraction has 824 states and 2208 transitions. [2020-10-15 18:20:07,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:20:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2208 transitions. [2020-10-15 18:20:07,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-15 18:20:07,698 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:07,698 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:07,698 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:20:07,699 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:07,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:07,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1544069227, now seen corresponding path program 1 times [2020-10-15 18:20:07,699 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:07,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258849899] [2020-10-15 18:20:07,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:07,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:07,802 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-15 18:20:07,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258849899] [2020-10-15 18:20:07,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:07,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:20:07,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501770006] [2020-10-15 18:20:07,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:20:07,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:07,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:20:07,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:20:07,805 INFO L87 Difference]: Start difference. First operand 824 states and 2208 transitions. Second operand 6 states. [2020-10-15 18:20:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:07,880 INFO L93 Difference]: Finished difference Result 693 states and 1802 transitions. [2020-10-15 18:20:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:20:07,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-10-15 18:20:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:07,885 INFO L225 Difference]: With dead ends: 693 [2020-10-15 18:20:07,885 INFO L226 Difference]: Without dead ends: 558 [2020-10-15 18:20:07,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:20:07,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2020-10-15 18:20:07,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 558. [2020-10-15 18:20:07,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2020-10-15 18:20:07,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 1432 transitions. [2020-10-15 18:20:07,899 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 1432 transitions. Word has length 20 [2020-10-15 18:20:07,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:07,901 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 1432 transitions. [2020-10-15 18:20:07,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:20:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 1432 transitions. [2020-10-15 18:20:07,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-15 18:20:07,903 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:07,903 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:07,903 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:20:07,904 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:07,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:07,904 INFO L82 PathProgramCache]: Analyzing trace with hash 913348123, now seen corresponding path program 1 times [2020-10-15 18:20:07,904 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:07,905 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146854068] [2020-10-15 18:20:07,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:08,051 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-15 18:20:08,051 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146854068] [2020-10-15 18:20:08,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:08,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:20:08,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88735281] [2020-10-15 18:20:08,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-15 18:20:08,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-15 18:20:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:20:08,053 INFO L87 Difference]: Start difference. First operand 558 states and 1432 transitions. Second operand 7 states. [2020-10-15 18:20:08,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:08,122 INFO L93 Difference]: Finished difference Result 525 states and 1366 transitions. [2020-10-15 18:20:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-15 18:20:08,124 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-15 18:20:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:08,126 INFO L225 Difference]: With dead ends: 525 [2020-10-15 18:20:08,127 INFO L226 Difference]: Without dead ends: 210 [2020-10-15 18:20:08,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:20:08,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2020-10-15 18:20:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2020-10-15 18:20:08,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2020-10-15 18:20:08,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 506 transitions. [2020-10-15 18:20:08,132 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 506 transitions. Word has length 23 [2020-10-15 18:20:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:08,133 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 506 transitions. [2020-10-15 18:20:08,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-15 18:20:08,133 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 506 transitions. [2020-10-15 18:20:08,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:20:08,134 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:08,134 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:08,134 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:20:08,135 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:08,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:08,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1499132745, now seen corresponding path program 1 times [2020-10-15 18:20:08,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:08,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387335010] [2020-10-15 18:20:08,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:08,204 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-15 18:20:08,205 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387335010] [2020-10-15 18:20:08,205 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:08,205 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:20:08,206 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886553363] [2020-10-15 18:20:08,206 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:20:08,206 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:08,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:20:08,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:20:08,207 INFO L87 Difference]: Start difference. First operand 210 states and 506 transitions. Second operand 5 states. [2020-10-15 18:20:08,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:08,233 INFO L93 Difference]: Finished difference Result 276 states and 656 transitions. [2020-10-15 18:20:08,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:20:08,233 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-10-15 18:20:08,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:08,234 INFO L225 Difference]: With dead ends: 276 [2020-10-15 18:20:08,234 INFO L226 Difference]: Without dead ends: 81 [2020-10-15 18:20:08,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-15 18:20:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-10-15 18:20:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2020-10-15 18:20:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2020-10-15 18:20:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 167 transitions. [2020-10-15 18:20:08,237 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 167 transitions. Word has length 26 [2020-10-15 18:20:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:08,238 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 167 transitions. [2020-10-15 18:20:08,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:20:08,238 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 167 transitions. [2020-10-15 18:20:08,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:20:08,238 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:08,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:08,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:20:08,239 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:08,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:08,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1092784959, now seen corresponding path program 2 times [2020-10-15 18:20:08,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:08,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24321091] [2020-10-15 18:20:08,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:20:08,432 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-15 18:20:08,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24321091] [2020-10-15 18:20:08,432 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:20:08,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-15 18:20:08,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234339987] [2020-10-15 18:20:08,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:20:08,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:20:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:20:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:20:08,434 INFO L87 Difference]: Start difference. First operand 81 states and 167 transitions. Second operand 6 states. [2020-10-15 18:20:08,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:20:08,535 INFO L93 Difference]: Finished difference Result 100 states and 202 transitions. [2020-10-15 18:20:08,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:20:08,536 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2020-10-15 18:20:08,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:20:08,537 INFO L225 Difference]: With dead ends: 100 [2020-10-15 18:20:08,537 INFO L226 Difference]: Without dead ends: 53 [2020-10-15 18:20:08,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:20:08,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-15 18:20:08,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2020-10-15 18:20:08,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-15 18:20:08,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 91 transitions. [2020-10-15 18:20:08,540 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 91 transitions. Word has length 26 [2020-10-15 18:20:08,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:20:08,541 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 91 transitions. [2020-10-15 18:20:08,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:20:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 91 transitions. [2020-10-15 18:20:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-15 18:20:08,544 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:20:08,544 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:20:08,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-15 18:20:08,544 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:20:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:20:08,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1325537017, now seen corresponding path program 3 times [2020-10-15 18:20:08,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:20:08,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312012012] [2020-10-15 18:20:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:20:08,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:20:08,645 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:20:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:20:08,677 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:20:08,718 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:20:08,718 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:20:08,719 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-15 18:20:08,747 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,747 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,749 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,749 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,749 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,750 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,750 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,751 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,751 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,752 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,752 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,753 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,753 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,754 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:20:08,754 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,755 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-15 18:20:08,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,755 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-15 18:20:08,755 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,756 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-15 18:20:08,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,756 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-15 18:20:08,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,756 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-15 18:20:08,756 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,757 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-15 18:20:08,757 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,757 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-15 18:20:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,758 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-15 18:20:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,758 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-15 18:20:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,758 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-15 18:20:08,758 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,759 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-15 18:20:08,759 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:20:08,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:20:08 BasicIcfg [2020-10-15 18:20:08,837 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:20:08,839 INFO L168 Benchmark]: Toolchain (without parser) took 10399.59 ms. Allocated memory was 256.9 MB in the beginning and 497.5 MB in the end (delta: 240.6 MB). Free memory was 212.0 MB in the beginning and 221.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 230.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,840 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 256.9 MB. Free memory was 235.0 MB in the beginning and 234.1 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 810.55 ms. Allocated memory was 256.9 MB in the beginning and 327.7 MB in the end (delta: 70.8 MB). Free memory was 212.0 MB in the beginning and 278.3 MB in the end (delta: -66.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 327.7 MB. Free memory was 278.3 MB in the beginning and 275.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,842 INFO L168 Benchmark]: Boogie Preprocessor took 57.64 ms. Allocated memory is still 327.7 MB. Free memory was 275.8 MB in the beginning and 273.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,843 INFO L168 Benchmark]: RCFGBuilder took 1790.87 ms. Allocated memory was 327.7 MB in the beginning and 366.0 MB in the end (delta: 38.3 MB). Free memory was 273.3 MB in the beginning and 239.9 MB in the end (delta: 33.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,844 INFO L168 Benchmark]: TraceAbstraction took 7666.07 ms. Allocated memory was 366.0 MB in the beginning and 497.5 MB in the end (delta: 131.6 MB). Free memory was 237.8 MB in the beginning and 221.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 147.6 MB. Max. memory is 14.2 GB. [2020-10-15 18:20:08,848 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.51 ms. Allocated memory is still 256.9 MB. Free memory was 235.0 MB in the beginning and 234.1 MB in the end (delta: 839.2 kB). Peak memory consumption was 839.2 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 810.55 ms. Allocated memory was 256.9 MB in the beginning and 327.7 MB in the end (delta: 70.8 MB). Free memory was 212.0 MB in the beginning and 278.3 MB in the end (delta: -66.3 MB). Peak memory consumption was 30.9 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 68.49 ms. Allocated memory is still 327.7 MB. Free memory was 278.3 MB in the beginning and 275.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 57.64 ms. Allocated memory is still 327.7 MB. Free memory was 275.8 MB in the beginning and 273.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1790.87 ms. Allocated memory was 327.7 MB in the beginning and 366.0 MB in the end (delta: 38.3 MB). Free memory was 273.3 MB in the beginning and 239.9 MB in the end (delta: 33.4 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 7666.07 ms. Allocated memory was 366.0 MB in the beginning and 497.5 MB in the end (delta: 131.6 MB). Free memory was 237.8 MB in the beginning and 221.7 MB in the end (delta: 16.0 MB). Peak memory consumption was 147.6 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1520 VarBasedMoverChecksPositive, 60 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 40 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 184 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.7s, 122 PlacesBefore, 45 PlacesAfterwards, 111 TransitionsBefore, 33 TransitionsAfterwards, 2432 CoEnabledTransitionPairs, 6 FixpointIterations, 37 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 5758 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int __unbuffered_p3_EBX = 0; [L707] 0 int a = 0; [L709] 0 int b = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff0_thd4; [L725] 0 _Bool z$r_buff1_thd0; [L726] 0 _Bool z$r_buff1_thd1; [L727] 0 _Bool z$r_buff1_thd2; [L728] 0 _Bool z$r_buff1_thd3; [L729] 0 _Bool z$r_buff1_thd4; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1085; [L844] FCALL, FORK 0 pthread_create(&t1085, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t1086; [L846] FCALL, FORK 0 pthread_create(&t1086, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t1087; [L848] FCALL, FORK 0 pthread_create(&t1087, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] 0 pthread_t t1088; [L850] FCALL, FORK 0 pthread_create(&t1088, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 4 z$w_buff1 = z$w_buff0 [L800] 4 z$w_buff0 = 1 [L801] 4 z$w_buff1_used = z$w_buff0_used [L802] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 [L812] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L756] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L778] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L779] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0 [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L779] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L780] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L781] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L783] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L785] 3 __unbuffered_p2_EAX = z [L786] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L786] 3 z = z$flush_delayed ? z$mem_tmp : z [L787] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L821] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L821] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L822] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L822] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L823] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L824] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L825] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 4 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 110 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.4s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 445 SDtfs, 439 SDslu, 822 SDs, 0 SdLazy, 241 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2858occurred 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.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 152 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 202 ConstructedInterpolants, 0 QuantifiedInterpolants, 13799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...