/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 23:35:14,967 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 23:35:14,970 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 23:35:14,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 23:35:14,995 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 23:35:14,996 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 23:35:14,997 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 23:35:14,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 23:35:15,001 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 23:35:15,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 23:35:15,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 23:35:15,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 23:35:15,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 23:35:15,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 23:35:15,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 23:35:15,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 23:35:15,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 23:35:15,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 23:35:15,011 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 23:35:15,013 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 23:35:15,015 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 23:35:15,016 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 23:35:15,017 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 23:35:15,018 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 23:35:15,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 23:35:15,021 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 23:35:15,021 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 23:35:15,022 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 23:35:15,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 23:35:15,024 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 23:35:15,024 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 23:35:15,025 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 23:35:15,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 23:35:15,026 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 23:35:15,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 23:35:15,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 23:35:15,028 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 23:35:15,028 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 23:35:15,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 23:35:15,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 23:35:15,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 23:35:15,031 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-05 23:35:15,063 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 23:35:15,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 23:35:15,067 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 23:35:15,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 23:35:15,068 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 23:35:15,068 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 23:35:15,068 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 23:35:15,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 23:35:15,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 23:35:15,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 23:35:15,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 23:35:15,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 23:35:15,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 23:35:15,071 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 23:35:15,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 23:35:15,071 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 23:35:15,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 23:35:15,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 23:35:15,074 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 23:35:15,074 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 23:35:15,074 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 23:35:15,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 23:35:15,075 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 23:35:15,075 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-05 23:35:15,075 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 23:35:15,075 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 23:35:15,076 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 23:35:15,076 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-05 23:35:15,076 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 23:35:15,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 23:35:15,438 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 23:35:15,442 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 23:35:15,444 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 23:35:15,444 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 23:35:15,445 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2020-10-05 23:35:15,526 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c99f5cf2/d64ef9d235264df98a1f91f3cbb9b8ca/FLAG8da2d5d24 [2020-10-05 23:35:16,106 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 23:35:16,106 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2020-10-05 23:35:16,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c99f5cf2/d64ef9d235264df98a1f91f3cbb9b8ca/FLAG8da2d5d24 [2020-10-05 23:35:16,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c99f5cf2/d64ef9d235264df98a1f91f3cbb9b8ca [2020-10-05 23:35:16,528 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 23:35:16,530 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 23:35:16,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:16,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 23:35:16,534 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 23:35:16,535 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:16" (1/1) ... [2020-10-05 23:35:16,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486300a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:16, skipping insertion in model container [2020-10-05 23:35:16,538 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 11:35:16" (1/1) ... [2020-10-05 23:35:16,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 23:35:16,619 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 23:35:17,126 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:17,142 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 23:35:17,207 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 23:35:17,289 INFO L208 MainTranslator]: Completed translation [2020-10-05 23:35:17,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17 WrapperNode [2020-10-05 23:35:17,290 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 23:35:17,290 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:17,291 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 23:35:17,291 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 23:35:17,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,359 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 23:35:17,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 23:35:17,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 23:35:17,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 23:35:17,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,375 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (1/1) ... [2020-10-05 23:35:17,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 23:35:17,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 23:35:17,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 23:35:17,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 23:35:17,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (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-05 23:35:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 23:35:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 23:35:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 23:35:17,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 23:35:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 23:35:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 23:35:17,473 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 23:35:17,473 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 23:35:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 23:35:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 23:35:17,474 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 23:35:17,474 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 23:35:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 23:35:17,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 23:35:17,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 23:35:17,477 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 23:35:19,396 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 23:35:19,396 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 23:35:19,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:19 BoogieIcfgContainer [2020-10-05 23:35:19,399 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 23:35:19,400 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 23:35:19,400 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 23:35:19,404 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 23:35:19,404 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 11:35:16" (1/3) ... [2020-10-05 23:35:19,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a15244a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:19, skipping insertion in model container [2020-10-05 23:35:19,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 11:35:17" (2/3) ... [2020-10-05 23:35:19,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a15244a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 11:35:19, skipping insertion in model container [2020-10-05 23:35:19,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 11:35:19" (3/3) ... [2020-10-05 23:35:19,408 INFO L109 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2020-10-05 23:35:19,418 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 23:35:19,419 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-05 23:35:19,427 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 23:35:19,428 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 23:35:19,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,475 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,476 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,476 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,477 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,477 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,478 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,478 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,478 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,479 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,480 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,481 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,481 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,482 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,482 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,483 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,484 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,485 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,486 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,494 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,495 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,495 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,496 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,496 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,504 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,504 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,505 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,506 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,506 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,513 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,514 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,514 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,517 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,517 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,518 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,518 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 23:35:19,534 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 23:35:19,557 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 23:35:19,557 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 23:35:19,558 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-05 23:35:19,558 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 23:35:19,558 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 23:35:19,558 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 23:35:19,558 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 23:35:19,558 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 23:35:19,581 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 108 transitions, 236 flow [2020-10-05 23:35:19,583 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-05 23:35:19,655 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-05 23:35:19,656 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:19,662 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-05 23:35:19,668 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 119 places, 108 transitions, 236 flow [2020-10-05 23:35:19,711 INFO L129 PetriNetUnfolder]: 2/104 cut-off events. [2020-10-05 23:35:19,712 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 23:35:19,714 INFO L80 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 104 events. 2/104 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2020-10-05 23:35:19,716 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2352 [2020-10-05 23:35:19,717 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-05 23:35:21,837 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification. DAG size of input: 228 DAG size of output: 187 [2020-10-05 23:35:21,873 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 1] term [2020-10-05 23:35:21,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:21,877 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-05 23:35:21,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 23:35:22,814 WARN L193 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2020-10-05 23:35:23,462 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-05 23:35:23,603 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-10-05 23:35:24,422 WARN L193 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-05 23:35:24,799 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2020-10-05 23:35:25,175 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:35:25,550 WARN L193 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-05 23:35:26,507 WARN L193 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2020-10-05 23:35:26,802 WARN L193 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-10-05 23:35:28,006 WARN L193 SmtUtils]: Spent 772.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-10-05 23:35:28,406 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-10-05 23:35:28,725 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-05 23:35:28,866 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-05 23:35:28,874 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6167 [2020-10-05 23:35:28,875 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2020-10-05 23:35:28,878 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-10-05 23:35:29,044 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-10-05 23:35:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-10-05 23:35:29,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-05 23:35:29,056 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:29,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:29,058 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:29,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1341205228, now seen corresponding path program 1 times [2020-10-05 23:35:29,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:29,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049321262] [2020-10-05 23:35:29,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:29,352 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-05 23:35:29,352 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049321262] [2020-10-05 23:35:29,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:29,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:29,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085748629] [2020-10-05 23:35:29,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:29,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:29,380 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-10-05 23:35:29,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:29,524 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-10-05 23:35:29,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:29,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-05 23:35:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:29,561 INFO L225 Difference]: With dead ends: 2202 [2020-10-05 23:35:29,562 INFO L226 Difference]: Without dead ends: 1802 [2020-10-05 23:35:29,563 INFO L675 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-05 23:35:29,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-10-05 23:35:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-10-05 23:35:29,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-10-05 23:35:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-10-05 23:35:29,718 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-10-05 23:35:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:29,719 INFO L479 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-10-05 23:35:29,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-10-05 23:35:29,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 23:35:29,722 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:29,722 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:29,723 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 23:35:29,723 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:29,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:29,723 INFO L82 PathProgramCache]: Analyzing trace with hash 408129342, now seen corresponding path program 1 times [2020-10-05 23:35:29,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:29,724 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051362731] [2020-10-05 23:35:29,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:29,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:29,827 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-05 23:35:29,827 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051362731] [2020-10-05 23:35:29,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:29,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:29,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299346227] [2020-10-05 23:35:29,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:29,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:29,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:29,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:29,831 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-10-05 23:35:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:29,858 INFO L93 Difference]: Finished difference Result 1752 states and 6554 transitions. [2020-10-05 23:35:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:29,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 23:35:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:29,875 INFO L225 Difference]: With dead ends: 1752 [2020-10-05 23:35:29,876 INFO L226 Difference]: Without dead ends: 1752 [2020-10-05 23:35:29,876 INFO L675 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-05 23:35:29,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2020-10-05 23:35:29,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1752. [2020-10-05 23:35:29,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1752 states. [2020-10-05 23:35:29,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1752 states to 1752 states and 6554 transitions. [2020-10-05 23:35:29,947 INFO L78 Accepts]: Start accepts. Automaton has 1752 states and 6554 transitions. Word has length 11 [2020-10-05 23:35:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:29,947 INFO L479 AbstractCegarLoop]: Abstraction has 1752 states and 6554 transitions. [2020-10-05 23:35:29,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1752 states and 6554 transitions. [2020-10-05 23:35:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-05 23:35:29,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:29,951 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:29,951 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 23:35:29,951 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:29,952 INFO L82 PathProgramCache]: Analyzing trace with hash -671107810, now seen corresponding path program 1 times [2020-10-05 23:35:29,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:29,952 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200666568] [2020-10-05 23:35:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:30,085 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-05 23:35:30,085 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200666568] [2020-10-05 23:35:30,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:30,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 23:35:30,086 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345800068] [2020-10-05 23:35:30,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 23:35:30,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:30,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 23:35:30,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 23:35:30,088 INFO L87 Difference]: Start difference. First operand 1752 states and 6554 transitions. Second operand 3 states. [2020-10-05 23:35:30,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:30,161 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-10-05 23:35:30,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:30,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-05 23:35:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:30,177 INFO L225 Difference]: With dead ends: 1724 [2020-10-05 23:35:30,177 INFO L226 Difference]: Without dead ends: 1724 [2020-10-05 23:35:30,178 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-05 23:35:30,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-10-05 23:35:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-10-05 23:35:30,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-10-05 23:35:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-10-05 23:35:30,247 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-10-05 23:35:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:30,247 INFO L479 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-10-05 23:35:30,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 23:35:30,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-10-05 23:35:30,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 23:35:30,254 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:30,255 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:30,255 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 23:35:30,255 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:30,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:30,262 INFO L82 PathProgramCache]: Analyzing trace with hash 668508459, now seen corresponding path program 1 times [2020-10-05 23:35:30,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:30,262 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511719803] [2020-10-05 23:35:30,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:30,433 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-05 23:35:30,434 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511719803] [2020-10-05 23:35:30,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:30,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:30,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877048874] [2020-10-05 23:35:30,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:30,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:30,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:30,436 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 5 states. [2020-10-05 23:35:30,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:30,503 INFO L93 Difference]: Finished difference Result 1668 states and 6182 transitions. [2020-10-05 23:35:30,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 23:35:30,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-05 23:35:30,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:30,519 INFO L225 Difference]: With dead ends: 1668 [2020-10-05 23:35:30,519 INFO L226 Difference]: Without dead ends: 1668 [2020-10-05 23:35:30,519 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:30,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-10-05 23:35:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-10-05 23:35:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-10-05 23:35:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 6182 transitions. [2020-10-05 23:35:30,633 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 6182 transitions. Word has length 13 [2020-10-05 23:35:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:30,633 INFO L479 AbstractCegarLoop]: Abstraction has 1668 states and 6182 transitions. [2020-10-05 23:35:30,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 6182 transitions. [2020-10-05 23:35:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:35:30,636 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:30,636 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:30,637 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 23:35:30,637 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -689526251, now seen corresponding path program 1 times [2020-10-05 23:35:30,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:30,638 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676940933] [2020-10-05 23:35:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:30,695 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-05 23:35:30,696 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676940933] [2020-10-05 23:35:30,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:30,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:30,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235154208] [2020-10-05 23:35:30,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:30,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:30,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:30,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:30,698 INFO L87 Difference]: Start difference. First operand 1668 states and 6182 transitions. Second operand 4 states. [2020-10-05 23:35:30,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:30,762 INFO L93 Difference]: Finished difference Result 1684 states and 6238 transitions. [2020-10-05 23:35:30,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:30,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-05 23:35:30,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:30,777 INFO L225 Difference]: With dead ends: 1684 [2020-10-05 23:35:30,778 INFO L226 Difference]: Without dead ends: 1684 [2020-10-05 23:35:30,778 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:30,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2020-10-05 23:35:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2020-10-05 23:35:30,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-10-05 23:35:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 6238 transitions. [2020-10-05 23:35:30,846 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 6238 transitions. Word has length 14 [2020-10-05 23:35:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:30,847 INFO L479 AbstractCegarLoop]: Abstraction has 1684 states and 6238 transitions. [2020-10-05 23:35:30,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 6238 transitions. [2020-10-05 23:35:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-05 23:35:30,851 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:30,851 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:30,851 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 23:35:30,852 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:30,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:30,852 INFO L82 PathProgramCache]: Analyzing trace with hash -690440441, now seen corresponding path program 2 times [2020-10-05 23:35:30,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:30,853 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92967132] [2020-10-05 23:35:30,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:30,942 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-05 23:35:30,943 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92967132] [2020-10-05 23:35:30,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:30,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:30,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367820687] [2020-10-05 23:35:30,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:30,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:30,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:30,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:30,945 INFO L87 Difference]: Start difference. First operand 1684 states and 6238 transitions. Second operand 5 states. [2020-10-05 23:35:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:31,014 INFO L93 Difference]: Finished difference Result 1642 states and 6066 transitions. [2020-10-05 23:35:31,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:31,015 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-05 23:35:31,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:31,028 INFO L225 Difference]: With dead ends: 1642 [2020-10-05 23:35:31,028 INFO L226 Difference]: Without dead ends: 1642 [2020-10-05 23:35:31,029 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:31,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-10-05 23:35:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1626. [2020-10-05 23:35:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-10-05 23:35:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-10-05 23:35:31,083 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 14 [2020-10-05 23:35:31,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:31,083 INFO L479 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-10-05 23:35:31,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-10-05 23:35:31,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-05 23:35:31,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:31,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:31,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 23:35:31,087 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:31,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:31,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1890097590, now seen corresponding path program 1 times [2020-10-05 23:35:31,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:31,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745363894] [2020-10-05 23:35:31,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:31,197 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-05 23:35:31,198 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745363894] [2020-10-05 23:35:31,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:31,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 23:35:31,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932999913] [2020-10-05 23:35:31,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:31,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:31,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:31,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:31,204 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 4 states. [2020-10-05 23:35:31,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:31,269 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-10-05 23:35:31,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 23:35:31,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-05 23:35:31,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:31,280 INFO L225 Difference]: With dead ends: 1682 [2020-10-05 23:35:31,280 INFO L226 Difference]: Without dead ends: 1282 [2020-10-05 23:35:31,281 INFO L675 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-05 23:35:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-10-05 23:35:31,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-10-05 23:35:31,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-10-05 23:35:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-10-05 23:35:31,323 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-10-05 23:35:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:31,324 INFO L479 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-10-05 23:35:31,324 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-10-05 23:35:31,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 23:35:31,327 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:31,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:31,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 23:35:31,327 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:31,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:31,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1535573628, now seen corresponding path program 1 times [2020-10-05 23:35:31,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:31,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17688282] [2020-10-05 23:35:31,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:31,448 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-05 23:35:31,448 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17688282] [2020-10-05 23:35:31,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:31,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:31,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561715470] [2020-10-05 23:35:31,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 23:35:31,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:31,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 23:35:31,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 23:35:31,450 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-10-05 23:35:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:31,519 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-10-05 23:35:31,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:31,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 23:35:31,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:31,526 INFO L225 Difference]: With dead ends: 1105 [2020-10-05 23:35:31,526 INFO L226 Difference]: Without dead ends: 849 [2020-10-05 23:35:31,527 INFO L675 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-05 23:35:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-10-05 23:35:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-10-05 23:35:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-10-05 23:35:31,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-10-05 23:35:31,553 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-10-05 23:35:31,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:31,554 INFO L479 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-10-05 23:35:31,554 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 23:35:31,554 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-10-05 23:35:31,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:35:31,556 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:31,556 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:31,556 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 23:35:31,557 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:31,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:31,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1327185945, now seen corresponding path program 1 times [2020-10-05 23:35:31,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:31,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463534289] [2020-10-05 23:35:31,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:31,609 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-05 23:35:31,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463534289] [2020-10-05 23:35:31,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:31,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 23:35:31,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86502368] [2020-10-05 23:35:31,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 23:35:31,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:31,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 23:35:31,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:31,611 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 4 states. [2020-10-05 23:35:31,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:31,641 INFO L93 Difference]: Finished difference Result 1190 states and 3477 transitions. [2020-10-05 23:35:31,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 23:35:31,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-05 23:35:31,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:31,648 INFO L225 Difference]: With dead ends: 1190 [2020-10-05 23:35:31,649 INFO L226 Difference]: Without dead ends: 860 [2020-10-05 23:35:31,649 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-05 23:35:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-10-05 23:35:31,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 840. [2020-10-05 23:35:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2020-10-05 23:35:31,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2399 transitions. [2020-10-05 23:35:31,673 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2399 transitions. Word has length 18 [2020-10-05 23:35:31,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:31,674 INFO L479 AbstractCegarLoop]: Abstraction has 840 states and 2399 transitions. [2020-10-05 23:35:31,674 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 23:35:31,674 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2399 transitions. [2020-10-05 23:35:31,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-05 23:35:31,676 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:31,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:31,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 23:35:31,677 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:31,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:31,677 INFO L82 PathProgramCache]: Analyzing trace with hash 738469067, now seen corresponding path program 1 times [2020-10-05 23:35:31,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:31,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430405082] [2020-10-05 23:35:31,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:31,751 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-05 23:35:31,751 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430405082] [2020-10-05 23:35:31,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:31,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:31,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310217949] [2020-10-05 23:35:31,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:31,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:31,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:31,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:31,753 INFO L87 Difference]: Start difference. First operand 840 states and 2399 transitions. Second operand 6 states. [2020-10-05 23:35:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:31,868 INFO L93 Difference]: Finished difference Result 733 states and 2056 transitions. [2020-10-05 23:35:31,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:31,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-05 23:35:31,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:31,873 INFO L225 Difference]: With dead ends: 733 [2020-10-05 23:35:31,874 INFO L226 Difference]: Without dead ends: 645 [2020-10-05 23:35:31,874 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:31,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-10-05 23:35:31,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2020-10-05 23:35:31,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-10-05 23:35:31,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1834 transitions. [2020-10-05 23:35:31,892 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1834 transitions. Word has length 18 [2020-10-05 23:35:31,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:31,892 INFO L479 AbstractCegarLoop]: Abstraction has 645 states and 1834 transitions. [2020-10-05 23:35:31,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:31,892 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1834 transitions. [2020-10-05 23:35:31,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:35:31,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:31,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:31,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 23:35:31,895 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:31,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:31,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1256513490, now seen corresponding path program 1 times [2020-10-05 23:35:31,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:31,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388716124] [2020-10-05 23:35:31,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:31,978 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-05 23:35:31,979 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388716124] [2020-10-05 23:35:31,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:31,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 23:35:31,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313708001] [2020-10-05 23:35:31,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 23:35:31,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:31,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 23:35:31,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-05 23:35:31,980 INFO L87 Difference]: Start difference. First operand 645 states and 1834 transitions. Second operand 6 states. [2020-10-05 23:35:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:32,072 INFO L93 Difference]: Finished difference Result 915 states and 2538 transitions. [2020-10-05 23:35:32,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 23:35:32,074 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-10-05 23:35:32,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:32,076 INFO L225 Difference]: With dead ends: 915 [2020-10-05 23:35:32,077 INFO L226 Difference]: Without dead ends: 645 [2020-10-05 23:35:32,077 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:32,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-10-05 23:35:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 641. [2020-10-05 23:35:32,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-10-05 23:35:32,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1739 transitions. [2020-10-05 23:35:32,095 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1739 transitions. Word has length 21 [2020-10-05 23:35:32,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:32,095 INFO L479 AbstractCegarLoop]: Abstraction has 641 states and 1739 transitions. [2020-10-05 23:35:32,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 23:35:32,095 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1739 transitions. [2020-10-05 23:35:32,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-05 23:35:32,097 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:32,098 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:32,098 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 23:35:32,098 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:32,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:32,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1670045084, now seen corresponding path program 2 times [2020-10-05 23:35:32,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:32,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679390010] [2020-10-05 23:35:32,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:32,186 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-05 23:35:32,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679390010] [2020-10-05 23:35:32,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:32,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 23:35:32,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141148724] [2020-10-05 23:35:32,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:32,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:32,189 INFO L87 Difference]: Start difference. First operand 641 states and 1739 transitions. Second operand 7 states. [2020-10-05 23:35:32,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:32,268 INFO L93 Difference]: Finished difference Result 615 states and 1686 transitions. [2020-10-05 23:35:32,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-05 23:35:32,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-05 23:35:32,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:32,271 INFO L225 Difference]: With dead ends: 615 [2020-10-05 23:35:32,271 INFO L226 Difference]: Without dead ends: 224 [2020-10-05 23:35:32,271 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-05 23:35:32,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-10-05 23:35:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-10-05 23:35:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-10-05 23:35:32,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 586 transitions. [2020-10-05 23:35:32,277 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 586 transitions. Word has length 21 [2020-10-05 23:35:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:32,278 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 586 transitions. [2020-10-05 23:35:32,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:32,278 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 586 transitions. [2020-10-05 23:35:32,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:35:32,279 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:32,280 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:32,280 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 23:35:32,280 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1669800279, now seen corresponding path program 1 times [2020-10-05 23:35:32,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:32,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038374208] [2020-10-05 23:35:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:32,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 23:35:32,428 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-05 23:35:32,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038374208] [2020-10-05 23:35:32,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 23:35:32,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 23:35:32,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484590774] [2020-10-05 23:35:32,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 23:35:32,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 23:35:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 23:35:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-05 23:35:32,431 INFO L87 Difference]: Start difference. First operand 224 states and 586 transitions. Second operand 7 states. [2020-10-05 23:35:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 23:35:32,557 INFO L93 Difference]: Finished difference Result 286 states and 730 transitions. [2020-10-05 23:35:32,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 23:35:32,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-10-05 23:35:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 23:35:32,560 INFO L225 Difference]: With dead ends: 286 [2020-10-05 23:35:32,560 INFO L226 Difference]: Without dead ends: 184 [2020-10-05 23:35:32,560 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-05 23:35:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-05 23:35:32,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2020-10-05 23:35:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2020-10-05 23:35:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 458 transitions. [2020-10-05 23:35:32,566 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 458 transitions. Word has length 25 [2020-10-05 23:35:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 23:35:32,568 INFO L479 AbstractCegarLoop]: Abstraction has 184 states and 458 transitions. [2020-10-05 23:35:32,568 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 23:35:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 458 transitions. [2020-10-05 23:35:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-05 23:35:32,570 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 23:35:32,570 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 23:35:32,570 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 23:35:32,570 INFO L427 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 23:35:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 23:35:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash 2056310337, now seen corresponding path program 2 times [2020-10-05 23:35:32,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 23:35:32,571 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520046632] [2020-10-05 23:35:32,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 23:35:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:32,625 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:32,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 23:35:32,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 23:35:32,737 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 23:35:32,738 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 23:35:32,738 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-05 23:35:32,739 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 23:35:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L2-->L843: Formula: (let ((.cse7 (= (mod ~z$w_buff0_used~0_In574309543 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In574309543 256) 0)) (.cse9 (= (mod ~z$r_buff1_thd0~0_In574309543 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In574309543 256) 0))) (let ((.cse1 (or .cse9 .cse8)) (.cse2 (not .cse9)) (.cse3 (not .cse8)) (.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (or .cse6 .cse7))) (and (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out574309543 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out574309543 |ULTIMATE.start_assume_abort_if_not_#in~cond_In574309543|) (or (and .cse0 (or (and (= ~z~0_Out574309543 ~z~0_In574309543) .cse1) (and .cse2 .cse3 (= ~z~0_Out574309543 ~z$w_buff1~0_In574309543)))) (and .cse4 .cse5 (= ~z~0_Out574309543 ~z$w_buff0~0_In574309543))) (= ~z$r_buff0_thd0~0_Out574309543 ~z$r_buff0_thd0~0_In574309543) (or (and (= ~z$w_buff1_used~0_Out574309543 ~z$w_buff1_used~0_In574309543) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out574309543 0) .cse3)) (= ~z$r_buff1_thd0~0_Out574309543 ~z$r_buff1_thd0~0_In574309543) (or (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out574309543 0)) (and .cse0 (= ~z$w_buff0_used~0_Out574309543 ~z$w_buff0_used~0_In574309543)))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In574309543|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In574309543, ~z$w_buff0_used~0=~z$w_buff0_used~0_In574309543, ~z$w_buff0~0=~z$w_buff0~0_In574309543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In574309543, ~z$w_buff1_used~0=~z$w_buff1_used~0_In574309543, ~z$w_buff1~0=~z$w_buff1~0_In574309543, ~z~0=~z~0_In574309543} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out574309543, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out574309543|, ~z$w_buff0~0=~z$w_buff0~0_In574309543, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out574309543|, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out574309543, ~z$w_buff1~0=~z$w_buff1~0_In574309543, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out574309543|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out574309543|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out574309543|, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out574309543|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In574309543|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out574309543, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out574309543, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out574309543, ~z~0=~z~0_Out574309543} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ~z~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-05 23:35:32,763 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-05 23:35:32,763 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,765 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-05 23:35:32,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,765 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-05 23:35:32,765 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,766 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-05 23:35:32,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,766 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-05 23:35:32,766 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,766 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-05 23:35:32,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,767 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-05 23:35:32,767 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,768 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-05 23:35:32,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,768 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-05 23:35:32,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,768 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-05 23:35:32,768 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,768 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-05 23:35:32,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,769 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-05 23:35:32,769 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,770 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-05 23:35:32,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,770 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-05 23:35:32,770 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,770 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-05 23:35:32,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,771 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-05 23:35:32,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,771 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-05 23:35:32,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,771 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-05 23:35:32,771 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,772 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-05 23:35:32,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,772 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-05 23:35:32,772 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,772 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-05 23:35:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,773 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-05 23:35:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,773 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-05 23:35:32,773 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,773 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-05 23:35:32,774 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 23:35:32,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 11:35:32 BasicIcfg [2020-10-05 23:35:32,846 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 23:35:32,848 INFO L168 Benchmark]: Toolchain (without parser) took 16317.93 ms. Allocated memory was 140.5 MB in the beginning and 410.0 MB in the end (delta: 269.5 MB). Free memory was 102.1 MB in the beginning and 191.9 MB in the end (delta: -89.8 MB). Peak memory consumption was 179.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,848 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.95 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 101.9 MB in the beginning and 154.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,850 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,850 INFO L168 Benchmark]: Boogie Preprocessor took 40.56 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,851 INFO L168 Benchmark]: RCFGBuilder took 1998.54 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 148.9 MB in the beginning and 190.6 MB in the end (delta: -41.7 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,852 INFO L168 Benchmark]: TraceAbstraction took 13445.80 ms. Allocated memory was 249.0 MB in the beginning and 410.0 MB in the end (delta: 161.0 MB). Free memory was 190.6 MB in the beginning and 191.9 MB in the end (delta: -1.3 MB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. [2020-10-05 23:35:32,855 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 140.5 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 758.95 ms. Allocated memory was 140.5 MB in the beginning and 201.3 MB in the end (delta: 60.8 MB). Free memory was 101.9 MB in the beginning and 154.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.5 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.56 ms. Allocated memory is still 201.3 MB. Free memory was 151.5 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1998.54 ms. Allocated memory was 201.3 MB in the beginning and 249.0 MB in the end (delta: 47.7 MB). Free memory was 148.9 MB in the beginning and 190.6 MB in the end (delta: -41.7 MB). Peak memory consumption was 104.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13445.80 ms. Allocated memory was 249.0 MB in the beginning and 410.0 MB in the end (delta: 161.0 MB). Free memory was 190.6 MB in the beginning and 191.9 MB in the end (delta: -1.3 MB). Peak memory consumption was 159.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 9.2s, 119 ProgramPointsBefore, 44 ProgramPointsAfterwards, 108 TransitionsBefore, 31 TransitionsAfterwards, 2352 CoEnabledTransitionPairs, 8 FixpointIterations, 35 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 1211 VarBasedMoverChecksPositive, 40 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 6167 CheckedPairsTotal, 87 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p1_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L825] 0 pthread_t t1461; [L826] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 pthread_t t1462; [L828] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 pthread_t t1463; [L830] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 0 pthread_t t1464; [L832] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 4 z$w_buff1 = z$w_buff0 [L788] 4 z$w_buff0 = 2 [L789] 4 z$w_buff1_used = z$w_buff0_used [L790] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L792] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L793] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L794] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L795] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L796] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L797] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L803] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L804] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L804] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L805] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L805] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L806] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L806] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L807] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L807] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L810] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 4 return 0; [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L773] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L773] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L774] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L774] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L775] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L776] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L777] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L780] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L845] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L846] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L847] 0 z$flush_delayed = weak$$choice2 [L848] 0 z$mem_tmp = z [L849] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L849] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0 [L850] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L850] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L850] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L851] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L851] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L852] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L852] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L853] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L853] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L854] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0 [L855] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L855] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L855] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L856] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L857] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L857] 0 z = z$flush_delayed ? z$mem_tmp : z [L858] 0 z$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 107 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.1s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.4s, HoareTripleCheckerStatistics: 392 SDtfs, 434 SDslu, 635 SDs, 0 SdLazy, 308 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred 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.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 40 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 19871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...