/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-7bb8cbd [2020-10-15 18:38:20,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-15 18:38:20,240 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-15 18:38:20,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-15 18:38:20,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-15 18:38:20,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-15 18:38:20,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-15 18:38:20,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-15 18:38:20,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-15 18:38:20,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-15 18:38:20,271 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-15 18:38:20,272 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-15 18:38:20,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-15 18:38:20,273 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-15 18:38:20,274 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-15 18:38:20,275 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-15 18:38:20,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-15 18:38:20,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-15 18:38:20,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-15 18:38:20,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-15 18:38:20,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-15 18:38:20,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-15 18:38:20,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-15 18:38:20,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-15 18:38:20,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-15 18:38:20,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-15 18:38:20,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-15 18:38:20,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-15 18:38:20,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-15 18:38:20,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-15 18:38:20,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-15 18:38:20,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-15 18:38:20,292 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-15 18:38:20,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-15 18:38:20,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-15 18:38:20,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-15 18:38:20,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-15 18:38:20,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-15 18:38:20,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-15 18:38:20,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-15 18:38:20,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-15 18:38:20,297 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-15 18:38:20,319 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-15 18:38:20,319 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-15 18:38:20,321 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-15 18:38:20,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-15 18:38:20,321 INFO L138 SettingsManager]: * Use SBE=true [2020-10-15 18:38:20,322 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-15 18:38:20,322 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-15 18:38:20,322 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-15 18:38:20,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-15 18:38:20,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-15 18:38:20,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-15 18:38:20,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-15 18:38:20,323 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-15 18:38:20,323 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-15 18:38:20,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-15 18:38:20,324 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-15 18:38:20,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-15 18:38:20,327 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-15 18:38:20,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-15 18:38:20,328 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-15 18:38:20,328 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-15 18:38:20,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:38:20,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-15 18:38:20,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-15 18:38:20,329 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-15 18:38:20,332 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-15 18:38:20,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-15 18:38:20,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-15 18:38:20,333 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-15 18:38:20,333 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-15 18:38:20,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-15 18:38:20,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-15 18:38:20,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-15 18:38:20,683 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-15 18:38:20,685 INFO L275 PluginConnector]: CDTParser initialized [2020-10-15 18:38:20,686 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2020-10-15 18:38:20,767 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5484258/9020867b738b4e119a9faabab2a3aed5/FLAG81acddb5f [2020-10-15 18:38:21,324 INFO L306 CDTParser]: Found 1 translation units. [2020-10-15 18:38:21,325 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2020-10-15 18:38:21,341 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5484258/9020867b738b4e119a9faabab2a3aed5/FLAG81acddb5f [2020-10-15 18:38:21,620 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb5484258/9020867b738b4e119a9faabab2a3aed5 [2020-10-15 18:38:21,632 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-15 18:38:21,634 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-15 18:38:21,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-15 18:38:21,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-15 18:38:21,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-15 18:38:21,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:38:21" (1/1) ... [2020-10-15 18:38:21,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78a50daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:21, skipping insertion in model container [2020-10-15 18:38:21,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 06:38:21" (1/1) ... [2020-10-15 18:38:21,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-15 18:38:21,722 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-15 18:38:22,161 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:38:22,179 INFO L203 MainTranslator]: Completed pre-run [2020-10-15 18:38:22,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-15 18:38:22,371 INFO L208 MainTranslator]: Completed translation [2020-10-15 18:38:22,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22 WrapperNode [2020-10-15 18:38:22,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-15 18:38:22,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-15 18:38:22,373 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-15 18:38:22,373 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-15 18:38:22,382 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,402 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,442 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-15 18:38:22,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-15 18:38:22,443 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-15 18:38:22,443 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-15 18:38:22,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,454 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,458 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,458 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,467 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... [2020-10-15 18:38:22,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-15 18:38:22,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-15 18:38:22,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-15 18:38:22,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-15 18:38:22,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-15 18:38:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-15 18:38:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-15 18:38:22,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-15 18:38:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-15 18:38:22,559 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-15 18:38:22,559 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-15 18:38:22,560 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-15 18:38:22,560 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-15 18:38:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-15 18:38:22,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-15 18:38:22,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-15 18:38:22,564 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-15 18:38:24,418 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-15 18:38:24,418 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-15 18:38:24,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:38:24 BoogieIcfgContainer [2020-10-15 18:38:24,420 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-15 18:38:24,422 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-15 18:38:24,422 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-15 18:38:24,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-15 18:38:24,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 06:38:21" (1/3) ... [2020-10-15 18:38:24,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32493a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:38:24, skipping insertion in model container [2020-10-15 18:38:24,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 06:38:22" (2/3) ... [2020-10-15 18:38:24,427 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32493a1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 06:38:24, skipping insertion in model container [2020-10-15 18:38:24,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 06:38:24" (3/3) ... [2020-10-15 18:38:24,429 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2020-10-15 18:38:24,441 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-15 18:38:24,441 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-15 18:38:24,450 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-15 18:38:24,451 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-15 18:38:24,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,479 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,480 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,483 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,483 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,484 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,484 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,485 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,486 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,490 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,497 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-15 18:38:24,515 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-15 18:38:24,536 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-15 18:38:24,536 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-15 18:38:24,536 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-15 18:38:24,536 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-15 18:38:24,537 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-15 18:38:24,537 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-15 18:38:24,537 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-15 18:38:24,537 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-15 18:38:24,550 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-15 18:38:24,553 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:24,555 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:24,557 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-15 18:38:24,597 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-15 18:38:24,598 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-15 18:38:24,602 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-15 18:38:24,605 INFO L117 LiptonReduction]: Number of co-enabled transitions 896 [2020-10-15 18:38:24,707 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:24,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,710 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:24,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:24,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,752 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:24,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,860 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:24,868 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,885 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:24,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:24,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:24,907 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:24,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:24,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:24,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:25,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:25,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,369 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,370 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:25,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,374 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:25,378 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:25,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:25,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,427 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,436 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:25,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:25,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:38:25,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:25,574 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:25,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:25,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,593 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:25,595 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,598 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,600 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:25,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:25,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:25,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:25,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-15 18:38:25,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-15 18:38:25,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:26,024 WARN L193 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-15 18:38:26,144 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-15 18:38:26,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:26,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:26,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-15 18:38:26,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:26,200 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-10-15 18:38:26,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:26,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:26,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:27,427 WARN L193 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-15 18:38:27,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-15 18:38:27,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:27,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-15 18:38:27,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:28,199 WARN L193 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-15 18:38:28,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,272 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,383 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,431 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:28,434 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:28,520 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,523 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:28,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:28,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,537 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:28,539 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:28,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:28,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:28,572 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:38:28,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,123 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,227 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:29,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,231 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,233 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,236 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 3, 4, 3, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:29,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-15 18:38:29,263 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-15 18:38:29,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-15 18:38:29,672 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 18:38:30,044 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 18:38:30,648 WARN L193 SmtUtils]: Spent 602.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 121 [2020-10-15 18:38:30,940 WARN L193 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-10-15 18:38:31,498 WARN L193 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 106 [2020-10-15 18:38:32,041 WARN L193 SmtUtils]: Spent 539.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2020-10-15 18:38:32,193 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-15 18:38:32,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:32,875 WARN L193 SmtUtils]: Spent 648.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 123 [2020-10-15 18:38:33,236 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-15 18:38:33,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,418 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,470 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,471 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,473 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,497 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-15 18:38:33,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-15 18:38:33,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,501 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-15 18:38:33,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-15 18:38:33,748 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-15 18:38:33,842 INFO L132 LiptonReduction]: Checked pairs total: 2235 [2020-10-15 18:38:33,842 INFO L134 LiptonReduction]: Total number of compositions: 66 [2020-10-15 18:38:33,849 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-15 18:38:33,866 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-15 18:38:33,869 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-15 18:38:33,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-15 18:38:33,874 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:33,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-15 18:38:33,875 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:33,881 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-15 18:38:33,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:33,891 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117288632] [2020-10-15 18:38:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:34,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117288632] [2020-10-15 18:38:34,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:34,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:38:34,110 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039751565] [2020-10-15 18:38:34,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:34,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:34,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:34,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,133 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-15 18:38:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:34,215 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-15 18:38:34,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:34,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-15 18:38:34,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:34,230 INFO L225 Difference]: With dead ends: 137 [2020-10-15 18:38:34,231 INFO L226 Difference]: Without dead ends: 112 [2020-10-15 18:38:34,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-15 18:38:34,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-15 18:38:34,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-15 18:38:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-15 18:38:34,283 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-15 18:38:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:34,284 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-15 18:38:34,284 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-15 18:38:34,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-15 18:38:34,285 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:34,285 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:34,285 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-15 18:38:34,285 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:34,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:34,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1857466431, now seen corresponding path program 1 times [2020-10-15 18:38:34,286 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:34,286 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543585885] [2020-10-15 18:38:34,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:34,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:34,409 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543585885] [2020-10-15 18:38:34,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:34,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:38:34,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159289132] [2020-10-15 18:38:34,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:34,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:34,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:34,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,412 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-15 18:38:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:34,425 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-15 18:38:34,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:34,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-15 18:38:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:34,428 INFO L225 Difference]: With dead ends: 110 [2020-10-15 18:38:34,428 INFO L226 Difference]: Without dead ends: 110 [2020-10-15 18:38:34,429 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-15 18:38:34,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-15 18:38:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-15 18:38:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-15 18:38:34,441 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-15 18:38:34,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:34,442 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-15 18:38:34,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-15 18:38:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-15 18:38:34,443 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:34,443 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:34,443 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-15 18:38:34,443 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:34,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:34,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1746918336, now seen corresponding path program 1 times [2020-10-15 18:38:34,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:34,444 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583759935] [2020-10-15 18:38:34,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:34,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:34,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583759935] [2020-10-15 18:38:34,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:34,568 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-15 18:38:34,568 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277973201] [2020-10-15 18:38:34,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-15 18:38:34,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:34,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-15 18:38:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,570 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 3 states. [2020-10-15 18:38:34,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:34,601 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-15 18:38:34,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-15 18:38:34,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-15 18:38:34,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:34,603 INFO L225 Difference]: With dead ends: 109 [2020-10-15 18:38:34,603 INFO L226 Difference]: Without dead ends: 109 [2020-10-15 18:38:34,604 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-15 18:38:34,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-15 18:38:34,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-15 18:38:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-15 18:38:34,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-15 18:38:34,615 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-15 18:38:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:34,615 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-15 18:38:34,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-15 18:38:34,616 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-15 18:38:34,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:34,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:34,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:34,617 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-15 18:38:34,617 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:34,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:34,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1273980600, now seen corresponding path program 1 times [2020-10-15 18:38:34,618 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:34,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648431118] [2020-10-15 18:38:34,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:34,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:34,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:34,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648431118] [2020-10-15 18:38:34,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:34,689 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:34,689 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207629579] [2020-10-15 18:38:34,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:34,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:34,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:34,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:34,690 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 5 states. [2020-10-15 18:38:34,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:34,765 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-15 18:38:34,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:38:34,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 18:38:34,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:34,767 INFO L225 Difference]: With dead ends: 154 [2020-10-15 18:38:34,767 INFO L226 Difference]: Without dead ends: 118 [2020-10-15 18:38:34,768 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-15 18:38:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-15 18:38:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-15 18:38:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-15 18:38:34,777 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-15 18:38:34,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:34,778 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-15 18:38:34,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:34,778 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-15 18:38:34,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:34,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:34,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:34,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-15 18:38:34,780 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:34,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:34,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1565096682, now seen corresponding path program 1 times [2020-10-15 18:38:34,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:34,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213138570] [2020-10-15 18:38:34,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:35,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:35,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213138570] [2020-10-15 18:38:35,023 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:35,023 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:35,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937045385] [2020-10-15 18:38:35,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:35,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:35,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:35,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:35,024 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-15 18:38:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:35,102 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-15 18:38:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:38:35,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 18:38:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:35,110 INFO L225 Difference]: With dead ends: 104 [2020-10-15 18:38:35,110 INFO L226 Difference]: Without dead ends: 104 [2020-10-15 18:38:35,111 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-15 18:38:35,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-15 18:38:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-15 18:38:35,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-15 18:38:35,120 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-15 18:38:35,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:35,120 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-15 18:38:35,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:35,120 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-15 18:38:35,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-15 18:38:35,121 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:35,122 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:35,122 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-15 18:38:35,122 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:35,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:35,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046662, now seen corresponding path program 1 times [2020-10-15 18:38:35,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:35,123 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593718681] [2020-10-15 18:38:35,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:35,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:35,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593718681] [2020-10-15 18:38:35,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:35,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:35,217 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595449485] [2020-10-15 18:38:35,217 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:35,218 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:35,218 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 5 states. [2020-10-15 18:38:35,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:35,286 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-15 18:38:35,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-15 18:38:35,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-15 18:38:35,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:35,289 INFO L225 Difference]: With dead ends: 102 [2020-10-15 18:38:35,289 INFO L226 Difference]: Without dead ends: 102 [2020-10-15 18:38:35,290 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:35,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-15 18:38:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-15 18:38:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-15 18:38:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-15 18:38:35,296 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-15 18:38:35,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:35,297 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-15 18:38:35,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-15 18:38:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-15 18:38:35,298 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:35,298 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:35,298 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-15 18:38:35,299 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:35,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:35,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1273416656, now seen corresponding path program 1 times [2020-10-15 18:38:35,299 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:35,299 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876457557] [2020-10-15 18:38:35,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:35,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876457557] [2020-10-15 18:38:35,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:35,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:38:35,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155046475] [2020-10-15 18:38:35,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-15 18:38:35,508 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:35,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-15 18:38:35,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:35,508 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 6 states. [2020-10-15 18:38:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:35,647 INFO L93 Difference]: Finished difference Result 113 states and 229 transitions. [2020-10-15 18:38:35,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:35,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-15 18:38:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:35,649 INFO L225 Difference]: With dead ends: 113 [2020-10-15 18:38:35,649 INFO L226 Difference]: Without dead ends: 101 [2020-10-15 18:38:35,650 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:38:35,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-10-15 18:38:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2020-10-15 18:38:35,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2020-10-15 18:38:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 203 transitions. [2020-10-15 18:38:35,656 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 203 transitions. Word has length 10 [2020-10-15 18:38:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:35,656 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 203 transitions. [2020-10-15 18:38:35,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-15 18:38:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 203 transitions. [2020-10-15 18:38:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-15 18:38:35,657 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:35,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:35,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-15 18:38:35,658 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1066818889, now seen corresponding path program 1 times [2020-10-15 18:38:35,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:35,659 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133193108] [2020-10-15 18:38:35,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:35,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:35,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133193108] [2020-10-15 18:38:35,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:35,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-15 18:38:35,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189418872] [2020-10-15 18:38:35,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-15 18:38:35,770 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-15 18:38:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-15 18:38:35,770 INFO L87 Difference]: Start difference. First operand 99 states and 203 transitions. Second operand 4 states. [2020-10-15 18:38:35,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:35,802 INFO L93 Difference]: Finished difference Result 87 states and 151 transitions. [2020-10-15 18:38:35,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-15 18:38:35,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-15 18:38:35,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:35,803 INFO L225 Difference]: With dead ends: 87 [2020-10-15 18:38:35,803 INFO L226 Difference]: Without dead ends: 62 [2020-10-15 18:38:35,804 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:35,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-15 18:38:35,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-15 18:38:35,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-15 18:38:35,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 100 transitions. [2020-10-15 18:38:35,813 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 100 transitions. Word has length 11 [2020-10-15 18:38:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:35,813 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 100 transitions. [2020-10-15 18:38:35,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-15 18:38:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 100 transitions. [2020-10-15 18:38:35,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-15 18:38:35,818 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:35,818 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:35,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-15 18:38:35,819 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:35,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:35,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1846496223, now seen corresponding path program 1 times [2020-10-15 18:38:35,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:35,820 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462848017] [2020-10-15 18:38:35,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:35,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:35,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462848017] [2020-10-15 18:38:35,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:35,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-15 18:38:35,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877313712] [2020-10-15 18:38:35,916 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-15 18:38:35,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:35,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-15 18:38:35,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-15 18:38:35,916 INFO L87 Difference]: Start difference. First operand 62 states and 100 transitions. Second operand 5 states. [2020-10-15 18:38:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:35,950 INFO L93 Difference]: Finished difference Result 49 states and 73 transitions. [2020-10-15 18:38:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-15 18:38:35,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-15 18:38:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:35,952 INFO L225 Difference]: With dead ends: 49 [2020-10-15 18:38:35,952 INFO L226 Difference]: Without dead ends: 34 [2020-10-15 18:38:35,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-15 18:38:35,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-15 18:38:35,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-15 18:38:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-15 18:38:35,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-15 18:38:35,955 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 12 [2020-10-15 18:38:35,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:35,955 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-15 18:38:35,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-15 18:38:35,955 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-15 18:38:35,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:38:35,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:35,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:35,956 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-15 18:38:35,957 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:35,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:35,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1949389069, now seen corresponding path program 1 times [2020-10-15 18:38:35,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:35,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047898283] [2020-10-15 18:38:35,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-15 18:38:36,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-15 18:38:36,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047898283] [2020-10-15 18:38:36,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-15 18:38:36,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-15 18:38:36,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236439392] [2020-10-15 18:38:36,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-15 18:38:36,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-15 18:38:36,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-15 18:38:36,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-15 18:38:36,565 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 8 states. [2020-10-15 18:38:36,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-15 18:38:36,809 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-10-15 18:38:36,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-15 18:38:36,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-10-15 18:38:36,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-15 18:38:36,810 INFO L225 Difference]: With dead ends: 40 [2020-10-15 18:38:36,811 INFO L226 Difference]: Without dead ends: 24 [2020-10-15 18:38:36,811 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-15 18:38:36,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-15 18:38:36,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-15 18:38:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-15 18:38:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-15 18:38:36,813 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-10-15 18:38:36,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-15 18:38:36,813 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-15 18:38:36,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-15 18:38:36,814 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-15 18:38:36,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-15 18:38:36,814 INFO L414 BasicCegarLoop]: Found error trace [2020-10-15 18:38:36,814 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-15 18:38:36,815 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-15 18:38:36,815 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-15 18:38:36,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-15 18:38:36,815 INFO L82 PathProgramCache]: Analyzing trace with hash -152137539, now seen corresponding path program 2 times [2020-10-15 18:38:36,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-15 18:38:36,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50864549] [2020-10-15 18:38:36,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-15 18:38:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:38:36,856 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:38:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-15 18:38:36,900 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-15 18:38:36,930 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-15 18:38:36,930 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-15 18:38:36,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-15 18:38:36,931 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-15 18:38:36,938 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse8 (= (mod ~y$r_buff1_thd0~0_In1867315100 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In1867315100 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In1867315100 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd0~0_In1867315100 256) 0))) (let ((.cse5 (or .cse7 .cse6)) (.cse0 (or .cse8 .cse9)) (.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1867315100 0)) (or (and .cse0 (= ~y$w_buff1_used~0_Out1867315100 ~y$w_buff1_used~0_In1867315100)) (and (= ~y$w_buff1_used~0_Out1867315100 0) .cse1 .cse2)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1867315100 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1867315100|) (or (and .cse3 (= ~y$w_buff0_used~0_Out1867315100 0) .cse4) (and .cse5 (= ~y$w_buff0_used~0_In1867315100 ~y$w_buff0_used~0_Out1867315100))) (or (and .cse5 (or (and .cse0 (= ~y~0_Out1867315100 ~y~0_In1867315100)) (and .cse1 .cse2 (= ~y~0_Out1867315100 ~y$w_buff1~0_In1867315100)))) (and .cse3 (= ~y~0_Out1867315100 ~y$w_buff0~0_In1867315100) .cse4)) (= ~y$r_buff1_thd0~0_Out1867315100 ~y$r_buff1_thd0~0_In1867315100) (= ~y$r_buff0_thd0~0_In1867315100 ~y$r_buff0_thd0~0_Out1867315100)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1867315100|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1867315100, ~y$w_buff1~0=~y$w_buff1~0_In1867315100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1867315100, ~y$w_buff0~0=~y$w_buff0~0_In1867315100, ~y~0=~y~0_In1867315100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1867315100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1867315100} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1867315100, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out1867315100|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out1867315100|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1867315100|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out1867315100|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out1867315100|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1867315100|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1867315100|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1867315100, ~y$w_buff1~0=~y$w_buff1~0_In1867315100, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out1867315100, ~y$w_buff0~0=~y$w_buff0~0_In1867315100, ~y~0=~y~0_Out1867315100, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1867315100, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1867315100} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-15 18:38:36,942 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,942 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,944 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,944 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,945 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,945 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,946 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,946 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,946 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,947 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,947 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,948 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,948 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,949 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,949 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,950 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,950 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,951 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,951 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,952 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,952 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:36,953 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-15 18:38:36,953 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-15 18:38:37,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 06:38:37 BasicIcfg [2020-10-15 18:38:37,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-15 18:38:37,007 INFO L168 Benchmark]: Toolchain (without parser) took 15373.44 ms. Allocated memory was 248.5 MB in the beginning and 554.7 MB in the end (delta: 306.2 MB). Free memory was 203.8 MB in the beginning and 353.6 MB in the end (delta: -149.8 MB). Peak memory consumption was 156.3 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,010 INFO L168 Benchmark]: CDTParser took 1.46 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,011 INFO L168 Benchmark]: CACSL2BoogieTranslator took 737.65 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 202.9 MB in the beginning and 258.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,014 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 306.2 MB. Free memory was 258.9 MB in the beginning and 255.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,014 INFO L168 Benchmark]: Boogie Preprocessor took 39.24 ms. Allocated memory is still 306.2 MB. Free memory was 255.5 MB in the beginning and 253.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,015 INFO L168 Benchmark]: RCFGBuilder took 1935.91 ms. Allocated memory was 306.2 MB in the beginning and 354.9 MB in the end (delta: 48.8 MB). Free memory was 252.9 MB in the beginning and 211.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 100.9 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,016 INFO L168 Benchmark]: TraceAbstraction took 12583.06 ms. Allocated memory was 354.9 MB in the beginning and 554.7 MB in the end (delta: 199.8 MB). Free memory was 211.4 MB in the beginning and 353.6 MB in the end (delta: -142.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 14.2 GB. [2020-10-15 18:38:37,025 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.46 ms. Allocated memory is still 248.5 MB. Free memory was 226.6 MB in the beginning and 225.7 MB in the end (delta: 839.0 kB). Peak memory consumption was 839.0 kB. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 737.65 ms. Allocated memory was 248.5 MB in the beginning and 306.2 MB in the end (delta: 57.7 MB). Free memory was 202.9 MB in the beginning and 258.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 32.5 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 69.51 ms. Allocated memory is still 306.2 MB. Free memory was 258.9 MB in the beginning and 255.5 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 39.24 ms. Allocated memory is still 306.2 MB. Free memory was 255.5 MB in the beginning and 253.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1935.91 ms. Allocated memory was 306.2 MB in the beginning and 354.9 MB in the end (delta: 48.8 MB). Free memory was 252.9 MB in the beginning and 211.4 MB in the end (delta: 41.6 MB). Peak memory consumption was 100.9 MB. Max. memory is 14.2 GB. * TraceAbstraction took 12583.06 ms. Allocated memory was 354.9 MB in the beginning and 554.7 MB in the end (delta: 199.8 MB). Free memory was 211.4 MB in the beginning and 353.6 MB in the end (delta: -142.3 MB). Peak memory consumption was 57.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 591 VarBasedMoverChecksPositive, 44 VarBasedMoverChecksNegative, 2 SemBasedMoverChecksPositive, 42 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 50 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.2s, 79 PlacesBefore, 26 PlacesAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 6 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 66 TotalNumberOfCompositions, 2235 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2477; [L780] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2478; [L782] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.3s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 142 SDtfs, 136 SDslu, 216 SDs, 0 SdLazy, 186 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 108 NumberOfCodeBlocks, 108 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 11892 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...