/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 11:19:11,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 11:19:11,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 11:19:11,181 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 11:19:11,181 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 11:19:11,183 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 11:19:11,184 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 11:19:11,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 11:19:11,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 11:19:11,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 11:19:11,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 11:19:11,190 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 11:19:11,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 11:19:11,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 11:19:11,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 11:19:11,197 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 11:19:11,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 11:19:11,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 11:19:11,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 11:19:11,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 11:19:11,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 11:19:11,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 11:19:11,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 11:19:11,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 11:19:11,217 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 11:19:11,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 11:19:11,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 11:19:11,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 11:19:11,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 11:19:11,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 11:19:11,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 11:19:11,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 11:19:11,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 11:19:11,233 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 11:19:11,234 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 11:19:11,234 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 11:19:11,234 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 11:19:11,235 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 11:19:11,238 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 11:19:11,239 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 11:19:11,240 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 11:19:11,241 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-16 11:19:11,280 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 11:19:11,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 11:19:11,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 11:19:11,284 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 11:19:11,284 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 11:19:11,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 11:19:11,285 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 11:19:11,285 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 11:19:11,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 11:19:11,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 11:19:11,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 11:19:11,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 11:19:11,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 11:19:11,287 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 11:19:11,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 11:19:11,288 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 11:19:11,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 11:19:11,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 11:19:11,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 11:19:11,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 11:19:11,289 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 11:19:11,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:19:11,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 11:19:11,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-16 11:19:11,290 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 11:19:11,290 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 11:19:11,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 11:19:11,291 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 11:19:11,291 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-16 11:19:11,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-16 11:19:11,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 11:19:11,622 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 11:19:11,625 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 11:19:11,626 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 11:19:11,627 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 11:19:11,627 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2020-10-16 11:19:11,689 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a617bc2e/3add51e6037c4576af38aa5fccbdc001/FLAG2a85e7651 [2020-10-16 11:19:12,243 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 11:19:12,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe014_rmo.oepc.i [2020-10-16 11:19:12,264 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a617bc2e/3add51e6037c4576af38aa5fccbdc001/FLAG2a85e7651 [2020-10-16 11:19:12,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/8a617bc2e/3add51e6037c4576af38aa5fccbdc001 [2020-10-16 11:19:12,510 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 11:19:12,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 11:19:12,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 11:19:12,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 11:19:12,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 11:19:12,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:12" (1/1) ... [2020-10-16 11:19:12,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fc84367 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:12, skipping insertion in model container [2020-10-16 11:19:12,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 11:19:12" (1/1) ... [2020-10-16 11:19:12,527 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 11:19:12,574 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 11:19:13,149 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:19:13,162 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 11:19:13,218 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 11:19:13,297 INFO L208 MainTranslator]: Completed translation [2020-10-16 11:19:13,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13 WrapperNode [2020-10-16 11:19:13,298 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 11:19:13,299 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 11:19:13,299 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 11:19:13,299 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 11:19:13,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,328 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 11:19:13,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 11:19:13,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 11:19:13,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 11:19:13,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... [2020-10-16 11:19:13,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 11:19:13,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 11:19:13,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 11:19:13,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 11:19:13,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 11:19:13,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-16 11:19:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 11:19:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 11:19:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 11:19:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 11:19:13,465 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 11:19:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 11:19:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 11:19:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 11:19:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 11:19:13,466 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 11:19:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-16 11:19:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 11:19:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 11:19:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 11:19:13,469 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 11:19:15,486 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 11:19:15,486 INFO L298 CfgBuilder]: Removed 8 assume(true) statements. [2020-10-16 11:19:15,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:15 BoogieIcfgContainer [2020-10-16 11:19:15,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 11:19:15,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 11:19:15,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 11:19:15,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 11:19:15,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 11:19:12" (1/3) ... [2020-10-16 11:19:15,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de95952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:15, skipping insertion in model container [2020-10-16 11:19:15,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 11:19:13" (2/3) ... [2020-10-16 11:19:15,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2de95952 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 11:19:15, skipping insertion in model container [2020-10-16 11:19:15,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 11:19:15" (3/3) ... [2020-10-16 11:19:15,498 INFO L111 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2020-10-16 11:19:15,511 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 11:19:15,511 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-16 11:19:15,519 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-16 11:19:15,520 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 11:19:15,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,553 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,554 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,554 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,555 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,556 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,557 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,562 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,564 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,566 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,567 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,567 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,568 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,569 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,574 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,574 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~mem29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,575 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,575 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,576 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,582 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,583 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,583 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,584 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,584 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,585 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~mem27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,586 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,587 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,588 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,590 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,590 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,591 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 11:19:15,592 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 11:19:15,606 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-16 11:19:15,629 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 11:19:15,629 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 11:19:15,629 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-16 11:19:15,629 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 11:19:15,629 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 11:19:15,630 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 11:19:15,630 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 11:19:15,630 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 11:19:15,645 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-16 11:19:15,648 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 231 flow [2020-10-16 11:19:15,651 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 231 flow [2020-10-16 11:19:15,653 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2020-10-16 11:19:15,706 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2020-10-16 11:19:15,706 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 11:19:15,711 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 49 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2020-10-16 11:19:15,715 INFO L117 LiptonReduction]: Number of co-enabled transitions 1372 [2020-10-16 11:19:15,980 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:19:15,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:19:16,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:19:16,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:16,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:19:16,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:16,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,565 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 70 [2020-10-16 11:19:16,571 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:19:16,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,573 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:16,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,683 WARN L193 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2020-10-16 11:19:16,712 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:19:16,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:16,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,732 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-16 11:19:16,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:16,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:16,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:18,494 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 238 DAG size of output: 198 [2020-10-16 11:19:18,498 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:19:18,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,158 WARN L193 SmtUtils]: Spent 645.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 110 [2020-10-16 11:19:19,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:19:19,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,209 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-16 11:19:19,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,668 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 1] term [2020-10-16 11:19:19,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:19,670 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 2, 1] term [2020-10-16 11:19:19,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:19,689 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 3, 1] term [2020-10-16 11:19:19,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 4, 1] term [2020-10-16 11:19:19,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,821 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-16 11:19:19,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:19,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 11:19:19,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-16 11:19:19,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-10-16 11:19:19,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,009 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-16 11:19:20,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-16 11:19:20,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 2, 1] term [2020-10-16 11:19:20,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,015 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-16 11:19:20,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:19:20,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:19:20,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 3, 2, 3, 2, 1] term [2020-10-16 11:19:20,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 11:19:20,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:20,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-16 11:19:21,527 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2020-10-16 11:19:21,678 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2020-10-16 11:19:22,190 WARN L193 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 134 [2020-10-16 11:19:22,445 WARN L193 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2020-10-16 11:19:22,451 INFO L132 LiptonReduction]: Checked pairs total: 3497 [2020-10-16 11:19:22,451 INFO L134 LiptonReduction]: Total number of compositions: 93 [2020-10-16 11:19:22,458 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 25 transitions, 65 flow [2020-10-16 11:19:22,508 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-10-16 11:19:22,512 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-10-16 11:19:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-16 11:19:22,524 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:22,532 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:22,533 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash 720420691, now seen corresponding path program 1 times [2020-10-16 11:19:22,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:22,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83368772] [2020-10-16 11:19:22,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:22,778 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83368772] [2020-10-16 11:19:22,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:22,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:19:22,783 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013274802] [2020-10-16 11:19:22,787 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-16 11:19:22,787 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-16 11:19:22,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 11:19:22,804 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 2 states. [2020-10-16 11:19:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:22,841 INFO L93 Difference]: Finished difference Result 522 states and 1600 transitions. [2020-10-16 11:19:22,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-16 11:19:22,842 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2020-10-16 11:19:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:22,861 INFO L225 Difference]: With dead ends: 522 [2020-10-16 11:19:22,861 INFO L226 Difference]: Without dead ends: 442 [2020-10-16 11:19:22,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-16 11:19:22,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2020-10-16 11:19:22,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2020-10-16 11:19:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2020-10-16 11:19:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 1336 transitions. [2020-10-16 11:19:22,961 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 1336 transitions. Word has length 8 [2020-10-16 11:19:22,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:22,962 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 1336 transitions. [2020-10-16 11:19:22,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-16 11:19:22,963 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 1336 transitions. [2020-10-16 11:19:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 11:19:22,965 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:22,965 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:22,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 11:19:22,966 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:22,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:22,971 INFO L82 PathProgramCache]: Analyzing trace with hash 833303876, now seen corresponding path program 1 times [2020-10-16 11:19:22,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:22,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586275950] [2020-10-16 11:19:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:23,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:23,188 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586275950] [2020-10-16 11:19:23,188 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:23,188 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 11:19:23,189 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844172264] [2020-10-16 11:19:23,190 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:19:23,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:23,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:19:23,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:19:23,192 INFO L87 Difference]: Start difference. First operand 442 states and 1336 transitions. Second operand 4 states. [2020-10-16 11:19:23,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:23,255 INFO L93 Difference]: Finished difference Result 490 states and 1424 transitions. [2020-10-16 11:19:23,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:19:23,256 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-16 11:19:23,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:23,261 INFO L225 Difference]: With dead ends: 490 [2020-10-16 11:19:23,262 INFO L226 Difference]: Without dead ends: 410 [2020-10-16 11:19:23,263 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2020-10-16 11:19:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2020-10-16 11:19:23,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2020-10-16 11:19:23,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 1224 transitions. [2020-10-16 11:19:23,294 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 1224 transitions. Word has length 10 [2020-10-16 11:19:23,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:23,294 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 1224 transitions. [2020-10-16 11:19:23,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:19:23,295 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 1224 transitions. [2020-10-16 11:19:23,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 11:19:23,297 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:23,297 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:23,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 11:19:23,297 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:23,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:23,298 INFO L82 PathProgramCache]: Analyzing trace with hash 62176210, now seen corresponding path program 1 times [2020-10-16 11:19:23,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:23,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628157878] [2020-10-16 11:19:23,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:23,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628157878] [2020-10-16 11:19:23,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:23,504 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:19:23,504 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788009767] [2020-10-16 11:19:23,505 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:23,505 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:23,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:23,506 INFO L87 Difference]: Start difference. First operand 410 states and 1224 transitions. Second operand 5 states. [2020-10-16 11:19:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:23,698 INFO L93 Difference]: Finished difference Result 442 states and 1272 transitions. [2020-10-16 11:19:23,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:23,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-16 11:19:23,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:23,707 INFO L225 Difference]: With dead ends: 442 [2020-10-16 11:19:23,707 INFO L226 Difference]: Without dead ends: 378 [2020-10-16 11:19:23,707 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:19:23,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2020-10-16 11:19:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2020-10-16 11:19:23,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2020-10-16 11:19:23,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 1112 transitions. [2020-10-16 11:19:23,749 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 1112 transitions. Word has length 11 [2020-10-16 11:19:23,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:23,749 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 1112 transitions. [2020-10-16 11:19:23,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:23,750 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 1112 transitions. [2020-10-16 11:19:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 11:19:23,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:23,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:23,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 11:19:23,756 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1927052131, now seen corresponding path program 1 times [2020-10-16 11:19:23,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:23,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600125067] [2020-10-16 11:19:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:23,923 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600125067] [2020-10-16 11:19:23,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:23,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:19:23,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136456083] [2020-10-16 11:19:23,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:23,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:23,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:23,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:23,925 INFO L87 Difference]: Start difference. First operand 378 states and 1112 transitions. Second operand 5 states. [2020-10-16 11:19:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:24,025 INFO L93 Difference]: Finished difference Result 546 states and 1590 transitions. [2020-10-16 11:19:24,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:19:24,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 11:19:24,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:24,028 INFO L225 Difference]: With dead ends: 546 [2020-10-16 11:19:24,029 INFO L226 Difference]: Without dead ends: 306 [2020-10-16 11:19:24,029 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:19:24,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2020-10-16 11:19:24,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2020-10-16 11:19:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2020-10-16 11:19:24,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 866 transitions. [2020-10-16 11:19:24,040 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 866 transitions. Word has length 12 [2020-10-16 11:19:24,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:24,041 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 866 transitions. [2020-10-16 11:19:24,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:24,041 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 866 transitions. [2020-10-16 11:19:24,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 11:19:24,047 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:24,047 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:24,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 11:19:24,047 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:24,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:24,048 INFO L82 PathProgramCache]: Analyzing trace with hash 285169153, now seen corresponding path program 1 times [2020-10-16 11:19:24,048 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:24,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679450642] [2020-10-16 11:19:24,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:24,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679450642] [2020-10-16 11:19:24,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:24,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:19:24,130 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842962770] [2020-10-16 11:19:24,131 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:19:24,131 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:19:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:19:24,131 INFO L87 Difference]: Start difference. First operand 306 states and 866 transitions. Second operand 4 states. [2020-10-16 11:19:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:24,172 INFO L93 Difference]: Finished difference Result 318 states and 871 transitions. [2020-10-16 11:19:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:19:24,173 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 11:19:24,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:24,175 INFO L225 Difference]: With dead ends: 318 [2020-10-16 11:19:24,175 INFO L226 Difference]: Without dead ends: 282 [2020-10-16 11:19:24,176 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:24,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2020-10-16 11:19:24,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2020-10-16 11:19:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2020-10-16 11:19:24,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 784 transitions. [2020-10-16 11:19:24,185 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 784 transitions. Word has length 13 [2020-10-16 11:19:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:24,186 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 784 transitions. [2020-10-16 11:19:24,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:19:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 784 transitions. [2020-10-16 11:19:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 11:19:24,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:24,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:24,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 11:19:24,187 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1354257205, now seen corresponding path program 1 times [2020-10-16 11:19:24,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:24,188 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475944912] [2020-10-16 11:19:24,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:24,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-16 11:19:24,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475944912] [2020-10-16 11:19:24,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:24,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-16 11:19:24,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817385986] [2020-10-16 11:19:24,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-16 11:19:24,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:24,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-16 11:19:24,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:19:24,436 INFO L87 Difference]: Start difference. First operand 282 states and 784 transitions. Second operand 9 states. [2020-10-16 11:19:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:24,909 INFO L93 Difference]: Finished difference Result 375 states and 982 transitions. [2020-10-16 11:19:24,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-16 11:19:24,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-10-16 11:19:24,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:24,912 INFO L225 Difference]: With dead ends: 375 [2020-10-16 11:19:24,913 INFO L226 Difference]: Without dead ends: 351 [2020-10-16 11:19:24,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:19:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2020-10-16 11:19:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 317. [2020-10-16 11:19:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-16 11:19:24,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 858 transitions. [2020-10-16 11:19:24,924 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 858 transitions. Word has length 14 [2020-10-16 11:19:24,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:24,925 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 858 transitions. [2020-10-16 11:19:24,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-16 11:19:24,925 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 858 transitions. [2020-10-16 11:19:24,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:19:24,926 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:24,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:24,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 11:19:24,927 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:24,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:24,927 INFO L82 PathProgramCache]: Analyzing trace with hash 920189655, now seen corresponding path program 1 times [2020-10-16 11:19:24,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:24,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258709917] [2020-10-16 11:19:24,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:24,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:25,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:25,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258709917] [2020-10-16 11:19:25,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:25,059 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 11:19:25,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919448662] [2020-10-16 11:19:25,061 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 11:19:25,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:25,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 11:19:25,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 11:19:25,062 INFO L87 Difference]: Start difference. First operand 317 states and 858 transitions. Second operand 4 states. [2020-10-16 11:19:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:25,106 INFO L93 Difference]: Finished difference Result 319 states and 783 transitions. [2020-10-16 11:19:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:19:25,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 11:19:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:25,109 INFO L225 Difference]: With dead ends: 319 [2020-10-16 11:19:25,109 INFO L226 Difference]: Without dead ends: 255 [2020-10-16 11:19:25,110 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-10-16 11:19:25,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2020-10-16 11:19:25,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2020-10-16 11:19:25,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 616 transitions. [2020-10-16 11:19:25,121 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 616 transitions. Word has length 15 [2020-10-16 11:19:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:25,122 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 616 transitions. [2020-10-16 11:19:25,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 11:19:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 616 transitions. [2020-10-16 11:19:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 11:19:25,123 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:25,123 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:25,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 11:19:25,124 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:25,124 INFO L82 PathProgramCache]: Analyzing trace with hash 126025819, now seen corresponding path program 1 times [2020-10-16 11:19:25,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:25,125 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687539345] [2020-10-16 11:19:25,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:25,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:25,528 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687539345] [2020-10-16 11:19:25,529 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:25,529 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-16 11:19:25,529 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191274627] [2020-10-16 11:19:25,529 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-16 11:19:25,530 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:25,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-16 11:19:25,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2020-10-16 11:19:25,530 INFO L87 Difference]: Start difference. First operand 255 states and 616 transitions. Second operand 10 states. [2020-10-16 11:19:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:25,947 INFO L93 Difference]: Finished difference Result 325 states and 759 transitions. [2020-10-16 11:19:25,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-16 11:19:25,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2020-10-16 11:19:25,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:25,950 INFO L225 Difference]: With dead ends: 325 [2020-10-16 11:19:25,951 INFO L226 Difference]: Without dead ends: 309 [2020-10-16 11:19:25,951 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-10-16 11:19:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2020-10-16 11:19:25,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 242. [2020-10-16 11:19:25,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-10-16 11:19:25,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 576 transitions. [2020-10-16 11:19:25,960 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 576 transitions. Word has length 15 [2020-10-16 11:19:25,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:25,960 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 576 transitions. [2020-10-16 11:19:25,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-16 11:19:25,960 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 576 transitions. [2020-10-16 11:19:25,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 11:19:25,961 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:25,962 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:25,962 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 11:19:25,962 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:25,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:25,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1405767643, now seen corresponding path program 1 times [2020-10-16 11:19:25,963 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:25,965 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102410715] [2020-10-16 11:19:25,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:26,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102410715] [2020-10-16 11:19:26,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:26,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:19:26,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288472285] [2020-10-16 11:19:26,103 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:26,103 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:26,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:26,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:26,104 INFO L87 Difference]: Start difference. First operand 242 states and 576 transitions. Second operand 5 states. [2020-10-16 11:19:26,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:26,146 INFO L93 Difference]: Finished difference Result 204 states and 439 transitions. [2020-10-16 11:19:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:19:26,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 11:19:26,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:26,148 INFO L225 Difference]: With dead ends: 204 [2020-10-16 11:19:26,149 INFO L226 Difference]: Without dead ends: 160 [2020-10-16 11:19:26,149 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:19:26,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2020-10-16 11:19:26,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2020-10-16 11:19:26,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-10-16 11:19:26,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 334 transitions. [2020-10-16 11:19:26,154 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 334 transitions. Word has length 16 [2020-10-16 11:19:26,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:26,155 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 334 transitions. [2020-10-16 11:19:26,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 334 transitions. [2020-10-16 11:19:26,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-16 11:19:26,156 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:26,156 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 11:19:26,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 11:19:26,156 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:26,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:26,157 INFO L82 PathProgramCache]: Analyzing trace with hash -627970988, now seen corresponding path program 1 times [2020-10-16 11:19:26,157 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:26,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675486402] [2020-10-16 11:19:26,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:26,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675486402] [2020-10-16 11:19:26,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:26,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-16 11:19:26,356 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432865008] [2020-10-16 11:19:26,356 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-16 11:19:26,356 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:26,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-16 11:19:26,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 11:19:26,357 INFO L87 Difference]: Start difference. First operand 160 states and 334 transitions. Second operand 8 states. [2020-10-16 11:19:26,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:26,492 INFO L93 Difference]: Finished difference Result 162 states and 334 transitions. [2020-10-16 11:19:26,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:19:26,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-16 11:19:26,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:26,494 INFO L225 Difference]: With dead ends: 162 [2020-10-16 11:19:26,494 INFO L226 Difference]: Without dead ends: 158 [2020-10-16 11:19:26,495 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-16 11:19:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-10-16 11:19:26,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 138. [2020-10-16 11:19:26,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-10-16 11:19:26,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 296 transitions. [2020-10-16 11:19:26,500 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 296 transitions. Word has length 17 [2020-10-16 11:19:26,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:26,500 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 296 transitions. [2020-10-16 11:19:26,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-16 11:19:26,501 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 296 transitions. [2020-10-16 11:19:26,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 11:19:26,501 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:26,502 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-16 11:19:26,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 11:19:26,502 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:26,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:26,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1993389095, now seen corresponding path program 1 times [2020-10-16 11:19:26,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:26,503 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6508839] [2020-10-16 11:19:26,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:26,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6508839] [2020-10-16 11:19:26,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:26,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 11:19:26,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375928640] [2020-10-16 11:19:26,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 11:19:26,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:26,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 11:19:26,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 11:19:26,598 INFO L87 Difference]: Start difference. First operand 138 states and 296 transitions. Second operand 6 states. [2020-10-16 11:19:26,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:26,650 INFO L93 Difference]: Finished difference Result 120 states and 258 transitions. [2020-10-16 11:19:26,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 11:19:26,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 11:19:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:26,653 INFO L225 Difference]: With dead ends: 120 [2020-10-16 11:19:26,653 INFO L226 Difference]: Without dead ends: 110 [2020-10-16 11:19:26,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:19:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-16 11:19:26,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-16 11:19:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-16 11:19:26,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 240 transitions. [2020-10-16 11:19:26,660 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 240 transitions. Word has length 18 [2020-10-16 11:19:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:26,660 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 240 transitions. [2020-10-16 11:19:26,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 11:19:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 240 transitions. [2020-10-16 11:19:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:19:26,661 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:26,661 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-16 11:19:26,661 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 11:19:26,661 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:26,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:26,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1369745626, now seen corresponding path program 1 times [2020-10-16 11:19:26,662 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:26,663 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522070300] [2020-10-16 11:19:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:26,741 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522070300] [2020-10-16 11:19:26,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:26,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:19:26,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791353162] [2020-10-16 11:19:26,742 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:26,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:26,743 INFO L87 Difference]: Start difference. First operand 110 states and 240 transitions. Second operand 5 states. [2020-10-16 11:19:26,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:26,782 INFO L93 Difference]: Finished difference Result 141 states and 295 transitions. [2020-10-16 11:19:26,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 11:19:26,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-16 11:19:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:26,784 INFO L225 Difference]: With dead ends: 141 [2020-10-16 11:19:26,784 INFO L226 Difference]: Without dead ends: 82 [2020-10-16 11:19:26,784 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-16 11:19:26,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2020-10-16 11:19:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2020-10-16 11:19:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2020-10-16 11:19:26,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 160 transitions. [2020-10-16 11:19:26,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 160 transitions. Word has length 20 [2020-10-16 11:19:26,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:26,788 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 160 transitions. [2020-10-16 11:19:26,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 160 transitions. [2020-10-16 11:19:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:19:26,789 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:26,789 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-16 11:19:26,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 11:19:26,789 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:26,790 INFO L82 PathProgramCache]: Analyzing trace with hash -733600358, now seen corresponding path program 2 times [2020-10-16 11:19:26,790 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:26,790 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813709328] [2020-10-16 11:19:26,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:26,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:26,874 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813709328] [2020-10-16 11:19:26,874 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:26,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:19:26,875 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427872636] [2020-10-16 11:19:26,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:26,876 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:26,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:26,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:26,876 INFO L87 Difference]: Start difference. First operand 82 states and 160 transitions. Second operand 5 states. [2020-10-16 11:19:26,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:26,922 INFO L93 Difference]: Finished difference Result 101 states and 191 transitions. [2020-10-16 11:19:26,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:19:26,922 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-16 11:19:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:26,923 INFO L225 Difference]: With dead ends: 101 [2020-10-16 11:19:26,923 INFO L226 Difference]: Without dead ends: 66 [2020-10-16 11:19:26,924 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:19:26,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-16 11:19:26,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2020-10-16 11:19:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-16 11:19:26,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 124 transitions. [2020-10-16 11:19:26,927 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 124 transitions. Word has length 20 [2020-10-16 11:19:26,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:26,927 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 124 transitions. [2020-10-16 11:19:26,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 124 transitions. [2020-10-16 11:19:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:19:26,928 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:26,928 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-16 11:19:26,929 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 11:19:26,929 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:26,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:26,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1129184766, now seen corresponding path program 3 times [2020-10-16 11:19:26,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:26,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874236028] [2020-10-16 11:19:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:26,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 11:19:27,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 11:19:27,008 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874236028] [2020-10-16 11:19:27,009 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 11:19:27,009 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 11:19:27,009 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157413663] [2020-10-16 11:19:27,009 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 11:19:27,010 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 11:19:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 11:19:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-16 11:19:27,010 INFO L87 Difference]: Start difference. First operand 66 states and 124 transitions. Second operand 5 states. [2020-10-16 11:19:27,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 11:19:27,048 INFO L93 Difference]: Finished difference Result 103 states and 192 transitions. [2020-10-16 11:19:27,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 11:19:27,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-10-16 11:19:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 11:19:27,050 INFO L225 Difference]: With dead ends: 103 [2020-10-16 11:19:27,050 INFO L226 Difference]: Without dead ends: 60 [2020-10-16 11:19:27,050 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 11:19:27,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-10-16 11:19:27,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2020-10-16 11:19:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2020-10-16 11:19:27,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 108 transitions. [2020-10-16 11:19:27,053 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 108 transitions. Word has length 20 [2020-10-16 11:19:27,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 11:19:27,053 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 108 transitions. [2020-10-16 11:19:27,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 11:19:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 108 transitions. [2020-10-16 11:19:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-16 11:19:27,054 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 11:19:27,054 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-16 11:19:27,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 11:19:27,055 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 11:19:27,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 11:19:27,055 INFO L82 PathProgramCache]: Analyzing trace with hash 799683646, now seen corresponding path program 4 times [2020-10-16 11:19:27,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 11:19:27,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614900120] [2020-10-16 11:19:27,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 11:19:27,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:19:27,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:19:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 11:19:27,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 11:19:27,215 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 11:19:27,216 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 11:19:27,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 11:19:27,242 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,242 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,242 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,243 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,243 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,243 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,244 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,244 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,245 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,245 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,246 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,248 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,248 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,248 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,248 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,249 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,249 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,249 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,249 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,249 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,250 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,250 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,251 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,251 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,251 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,251 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,251 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,252 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,252 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 11:19:27,252 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 11:19:27,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 11:19:27 BasicIcfg [2020-10-16 11:19:27,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 11:19:27,335 INFO L168 Benchmark]: Toolchain (without parser) took 14824.35 ms. Allocated memory was 146.8 MB in the beginning and 393.2 MB in the end (delta: 246.4 MB). Free memory was 99.9 MB in the beginning and 318.3 MB in the end (delta: -218.4 MB). Peak memory consumption was 28.0 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,336 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.7 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,337 INFO L168 Benchmark]: CACSL2BoogieTranslator took 785.44 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 99.5 MB in the beginning and 156.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.02 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,338 INFO L168 Benchmark]: Boogie Preprocessor took 45.77 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,339 INFO L168 Benchmark]: RCFGBuilder took 2084.33 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 151.5 MB in the beginning and 196.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,340 INFO L168 Benchmark]: TraceAbstraction took 11843.22 ms. Allocated memory was 248.5 MB in the beginning and 393.2 MB in the end (delta: 144.7 MB). Free memory was 196.5 MB in the beginning and 318.3 MB in the end (delta: -121.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2020-10-16 11:19:27,344 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.22 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.7 MB in the end (delta: 419.6 kB). Peak memory consumption was 419.6 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 785.44 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 99.5 MB in the beginning and 156.3 MB in the end (delta: -56.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.02 ms. Allocated memory is still 202.4 MB. Free memory was 156.3 MB in the beginning and 154.4 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.77 ms. Allocated memory is still 202.4 MB. Free memory was 154.4 MB in the beginning and 151.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2084.33 ms. Allocated memory was 202.4 MB in the beginning and 248.5 MB in the end (delta: 46.1 MB). Free memory was 151.5 MB in the beginning and 196.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 104.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11843.22 ms. Allocated memory was 248.5 MB in the beginning and 393.2 MB in the end (delta: 144.7 MB). Free memory was 196.5 MB in the beginning and 318.3 MB in the end (delta: -121.8 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 850 VarBasedMoverChecksPositive, 42 VarBasedMoverChecksNegative, 10 SemBasedMoverChecksPositive, 32 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 73 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.8s, 116 PlacesBefore, 34 PlacesAfterwards, 108 TransitionsBefore, 25 TransitionsAfterwards, 1372 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 3497 MoverChecksTotal - CounterExampleResult [Line: 8]: 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_p0_EAX = 0; [L702] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L703] 0 int __unbuffered_p0_EAX$mem_tmp; [L704] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L705] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L706] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L707] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L708] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L709] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L710] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L711] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L712] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L713] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L714] 0 int __unbuffered_p0_EAX$w_buff0; [L715] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L716] 0 int __unbuffered_p0_EAX$w_buff1; [L717] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L719] 0 int __unbuffered_p0_EBX = 0; [L721] 0 int __unbuffered_p2_EAX = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L728] 0 _Bool y$flush_delayed; [L729] 0 int y$mem_tmp; [L730] 0 _Bool y$r_buff0_thd0; [L731] 0 _Bool y$r_buff0_thd1; [L732] 0 _Bool y$r_buff0_thd2; [L733] 0 _Bool y$r_buff0_thd3; [L734] 0 _Bool y$r_buff1_thd0; [L735] 0 _Bool y$r_buff1_thd1; [L736] 0 _Bool y$r_buff1_thd2; [L737] 0 _Bool y$r_buff1_thd3; [L738] 0 _Bool y$read_delayed; [L739] 0 int *y$read_delayed_var; [L740] 0 int y$w_buff0; [L741] 0 _Bool y$w_buff0_used; [L742] 0 int y$w_buff1; [L743] 0 _Bool y$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice1; [L746] 0 _Bool weak$$choice2; [L823] 0 pthread_t t2109; [L824] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 pthread_t t2110; [L826] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 pthread_t t2111; [L828] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L751] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L752] 1 y$flush_delayed = weak$$choice2 [L753] EXPR 1 \read(y) [L753] 1 y$mem_tmp = y [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1 [L754] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L754] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L755] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L755] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L756] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L756] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L757] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L757] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L758] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L759] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L760] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L761] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L762] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L763] EXPR 1 \read(y) [L763] 1 __unbuffered_p0_EAX = y [L764] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L764] 1 y = y$flush_delayed ? y$mem_tmp : y [L765] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=1, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 2 return 0; [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L795] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=1, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L830] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L4] COND FALSE 0 !(!cond) [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 \read(y) [L834] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L834] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L834] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L835] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L835] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L836] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L836] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L837] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L837] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L838] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L838] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L841] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L842] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L842] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L843] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=1, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={6:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=255, weak$$choice2=1, x=2, y={6:0}, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 107 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 341 SDtfs, 361 SDslu, 782 SDs, 0 SdLazy, 573 SolverSat, 89 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 121 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 23736 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...