/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-keepdead.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-aa1e80b [2020-12-17 23:59:35,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-17 23:59:35,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-17 23:59:35,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-17 23:59:35,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-17 23:59:35,309 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-17 23:59:35,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-17 23:59:35,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-17 23:59:35,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-17 23:59:35,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-17 23:59:35,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-17 23:59:35,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-17 23:59:35,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-17 23:59:35,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-17 23:59:35,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-17 23:59:35,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-17 23:59:35,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-17 23:59:35,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-17 23:59:35,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-17 23:59:35,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-17 23:59:35,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-17 23:59:35,369 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-17 23:59:35,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-17 23:59:35,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-17 23:59:35,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-17 23:59:35,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-17 23:59:35,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-17 23:59:35,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-17 23:59:35,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-17 23:59:35,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-17 23:59:35,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-17 23:59:35,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-17 23:59:35,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-17 23:59:35,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-17 23:59:35,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-17 23:59:35,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-17 23:59:35,393 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-17 23:59:35,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-17 23:59:35,394 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-17 23:59:35,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-17 23:59:35,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-17 23:59:35,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-keepdead.epf [2020-12-17 23:59:35,442 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-17 23:59:35,442 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-17 23:59:35,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-17 23:59:35,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-17 23:59:35,444 INFO L138 SettingsManager]: * Use SBE=true [2020-12-17 23:59:35,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-17 23:59:35,445 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-17 23:59:35,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-17 23:59:35,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-17 23:59:35,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-17 23:59:35,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-17 23:59:35,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-17 23:59:35,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-17 23:59:35,446 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-17 23:59:35,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-17 23:59:35,447 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-17 23:59:35,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-17 23:59:35,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-17 23:59:35,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-17 23:59:35,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-17 23:59:35,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-17 23:59:35,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-17 23:59:35,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-17 23:59:35,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-17 23:59:35,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-17 23:59:35,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-17 23:59:35,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-17 23:59:35,449 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-12-17 23:59:35,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-17 23:59:35,450 INFO L138 SettingsManager]: * Remove dead ends from automaton=false [2020-12-17 23:59:35,450 INFO L138 SettingsManager]: * Minimization of abstraction=NONE [2020-12-17 23:59:35,450 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-17 23:59:35,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-17 23:59:35,876 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-17 23:59:35,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-17 23:59:35,881 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-17 23:59:35,882 INFO L275 PluginConnector]: CDTParser initialized [2020-12-17 23:59:35,883 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-12-17 23:59:35,973 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9057ace1/c1f7552927144eebb7fb92501506b3ce/FLAG450a0b1e5 [2020-12-17 23:59:36,797 INFO L306 CDTParser]: Found 1 translation units. [2020-12-17 23:59:36,798 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_rmo.opt.i [2020-12-17 23:59:36,815 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9057ace1/c1f7552927144eebb7fb92501506b3ce/FLAG450a0b1e5 [2020-12-17 23:59:37,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9057ace1/c1f7552927144eebb7fb92501506b3ce [2020-12-17 23:59:37,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-17 23:59:37,040 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-12-17 23:59:37,046 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-17 23:59:37,046 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-17 23:59:37,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-17 23:59:37,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@609756a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37, skipping insertion in model container [2020-12-17 23:59:37,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-17 23:59:37,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-17 23:59:37,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:59:37,611 INFO L203 MainTranslator]: Completed pre-run [2020-12-17 23:59:37,691 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:59:37,815 INFO L208 MainTranslator]: Completed translation [2020-12-17 23:59:37,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37 WrapperNode [2020-12-17 23:59:37,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-17 23:59:37,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-17 23:59:37,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-17 23:59:37,820 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-17 23:59:37,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,955 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-17 23:59:37,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-17 23:59:37,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-17 23:59:37,956 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-17 23:59:37,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,966 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,971 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,982 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,991 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (1/1) ... [2020-12-17 23:59:37,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-17 23:59:37,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-17 23:59:37,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-17 23:59:37,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-17 23:59:37,999 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (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-12-17 23:59:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-17 23:59:38,097 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-17 23:59:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-17 23:59:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-17 23:59:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-17 23:59:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-17 23:59:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-17 23:59:38,098 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-17 23:59:38,098 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-17 23:59:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-17 23:59:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-17 23:59:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-17 23:59:38,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-17 23:59:38,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-17 23:59:38,101 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-17 23:59:40,427 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-17 23:59:40,428 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-17 23:59:40,430 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:59:40 BoogieIcfgContainer [2020-12-17 23:59:40,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-17 23:59:40,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-17 23:59:40,433 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-17 23:59:40,436 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-17 23:59:40,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:59:37" (1/3) ... [2020-12-17 23:59:40,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc82a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:59:40, skipping insertion in model container [2020-12-17 23:59:40,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:59:37" (2/3) ... [2020-12-17 23:59:40,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dc82a60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:59:40, skipping insertion in model container [2020-12-17 23:59:40,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:59:40" (3/3) ... [2020-12-17 23:59:40,440 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_rmo.opt.i [2020-12-17 23:59:40,457 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-17 23:59:40,457 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-17 23:59:40,461 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-17 23:59:40,462 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-17 23:59:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,503 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,503 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,504 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,504 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,505 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,506 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,507 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,507 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,508 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,510 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,515 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,516 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,516 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,517 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,517 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,518 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,518 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,519 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,520 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,521 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,522 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,523 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,524 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,526 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,526 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,527 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,527 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,528 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,528 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,529 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,538 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,538 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:59:40,542 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-17 23:59:40,556 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-17 23:59:40,581 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-17 23:59:40,581 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-17 23:59:40,581 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-17 23:59:40,582 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-17 23:59:40,582 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-17 23:59:40,582 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-17 23:59:40,582 INFO L383 AbstractCegarLoop]: Minimize is NONE [2020-12-17 23:59:40,582 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-17 23:59:40,596 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 99 transitions, 213 flow [2020-12-17 23:59:42,032 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14904 states, 14900 states have (on average 3.6666442953020133) internal successors, (54633), 14903 states have internal predecessors, (54633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 14904 states, 14900 states have (on average 3.6666442953020133) internal successors, (54633), 14903 states have internal predecessors, (54633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:42,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-17 23:59:42,179 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:42,182 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:42,183 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:42,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:42,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1152573343, now seen corresponding path program 1 times [2020-12-17 23:59:42,203 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:42,203 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852351883] [2020-12-17 23:59:42,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:42,541 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852351883] [2020-12-17 23:59:42,542 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:42,542 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-17 23:59:42,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664911010] [2020-12-17 23:59:42,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-17 23:59:42,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:42,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-17 23:59:42,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-17 23:59:42,606 INFO L87 Difference]: Start difference. First operand has 14904 states, 14900 states have (on average 3.6666442953020133) internal successors, (54633), 14903 states have internal predecessors, (54633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:42,919 INFO L93 Difference]: Finished difference Result 12384 states and 43884 transitions. [2020-12-17 23:59:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-17 23:59:42,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2020-12-17 23:59:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:42,924 INFO L763 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-12-17 23:59:42,924 INFO L78 Accepts]: Start accepts. Automaton has 12384 states and 43884 transitions. Word has length 46 [2020-12-17 23:59:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:42,926 INFO L481 AbstractCegarLoop]: Abstraction has 12384 states and 43884 transitions. [2020-12-17 23:59:42,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:42,927 INFO L276 IsEmpty]: Start isEmpty. Operand 12384 states and 43884 transitions. [2020-12-17 23:59:42,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-17 23:59:42,952 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:42,952 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:42,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-17 23:59:42,953 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:42,954 INFO L82 PathProgramCache]: Analyzing trace with hash -501562515, now seen corresponding path program 1 times [2020-12-17 23:59:42,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:42,954 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832691668] [2020-12-17 23:59:42,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:43,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-12-17 23:59:43,434 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832691668] [2020-12-17 23:59:43,434 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:43,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:59:43,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138674243] [2020-12-17 23:59:43,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:59:43,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:43,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:59:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:59:43,442 INFO L87 Difference]: Start difference. First operand 12384 states and 43884 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:43,911 INFO L93 Difference]: Finished difference Result 17792 states and 62760 transitions. [2020-12-17 23:59:43,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:59:43,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2020-12-17 23:59:43,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:43,914 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:43,914 INFO L78 Accepts]: Start accepts. Automaton has 17792 states and 62760 transitions. Word has length 59 [2020-12-17 23:59:43,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:43,915 INFO L481 AbstractCegarLoop]: Abstraction has 17792 states and 62760 transitions. [2020-12-17 23:59:43,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:43,915 INFO L276 IsEmpty]: Start isEmpty. Operand 17792 states and 62760 transitions. [2020-12-17 23:59:43,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-17 23:59:43,954 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:43,955 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:43,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-17 23:59:43,955 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1954561844, now seen corresponding path program 1 times [2020-12-17 23:59:43,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:43,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127306859] [2020-12-17 23:59:43,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:44,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:44,277 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127306859] [2020-12-17 23:59:44,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:44,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:59:44,277 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751419045] [2020-12-17 23:59:44,278 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:59:44,278 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:59:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:59:44,280 INFO L87 Difference]: Start difference. First operand 17792 states and 62760 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:44,496 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2020-12-17 23:59:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:44,884 INFO L93 Difference]: Finished difference Result 27448 states and 96368 transitions. [2020-12-17 23:59:44,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:59:44,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2020-12-17 23:59:44,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:44,890 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:44,890 INFO L78 Accepts]: Start accepts. Automaton has 27448 states and 96368 transitions. Word has length 61 [2020-12-17 23:59:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:44,891 INFO L481 AbstractCegarLoop]: Abstraction has 27448 states and 96368 transitions. [2020-12-17 23:59:44,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:44,891 INFO L276 IsEmpty]: Start isEmpty. Operand 27448 states and 96368 transitions. [2020-12-17 23:59:44,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-12-17 23:59:44,914 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:44,914 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:44,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-17 23:59:44,915 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:44,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:44,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1529867780, now seen corresponding path program 1 times [2020-12-17 23:59:44,916 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:44,916 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922187093] [2020-12-17 23:59:44,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:45,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:45,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:45,216 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922187093] [2020-12-17 23:59:45,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:45,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:59:45,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191861388] [2020-12-17 23:59:45,218 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:59:45,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:45,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:59:45,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:59:45,220 INFO L87 Difference]: Start difference. First operand 27448 states and 96368 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:45,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:45,762 INFO L93 Difference]: Finished difference Result 43224 states and 149840 transitions. [2020-12-17 23:59:45,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:59:45,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2020-12-17 23:59:45,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:45,764 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:45,764 INFO L78 Accepts]: Start accepts. Automaton has 43224 states and 149840 transitions. Word has length 62 [2020-12-17 23:59:45,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:45,765 INFO L481 AbstractCegarLoop]: Abstraction has 43224 states and 149840 transitions. [2020-12-17 23:59:45,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:45,765 INFO L276 IsEmpty]: Start isEmpty. Operand 43224 states and 149840 transitions. [2020-12-17 23:59:45,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-17 23:59:45,793 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:45,794 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:45,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-17 23:59:45,794 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:45,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:45,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1407637931, now seen corresponding path program 1 times [2020-12-17 23:59:45,795 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:45,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363584180] [2020-12-17 23:59:45,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:46,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363584180] [2020-12-17 23:59:46,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:46,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-17 23:59:46,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209706537] [2020-12-17 23:59:46,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-17 23:59:46,291 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-17 23:59:46,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:46,292 INFO L87 Difference]: Start difference. First operand 43224 states and 149840 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:47,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:47,352 INFO L93 Difference]: Finished difference Result 62084 states and 213776 transitions. [2020-12-17 23:59:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-17 23:59:47,357 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2020-12-17 23:59:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:47,359 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=231, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:59:47,359 INFO L78 Accepts]: Start accepts. Automaton has 62084 states and 213776 transitions. Word has length 63 [2020-12-17 23:59:47,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:47,360 INFO L481 AbstractCegarLoop]: Abstraction has 62084 states and 213776 transitions. [2020-12-17 23:59:47,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:47,360 INFO L276 IsEmpty]: Start isEmpty. Operand 62084 states and 213776 transitions. [2020-12-17 23:59:47,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-17 23:59:47,424 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:47,427 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:47,427 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-17 23:59:47,428 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:47,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2132165629, now seen corresponding path program 1 times [2020-12-17 23:59:47,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:47,430 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593705291] [2020-12-17 23:59:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:47,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593705291] [2020-12-17 23:59:47,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:47,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:59:47,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585273958] [2020-12-17 23:59:47,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:59:47,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:47,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:59:47,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:59:47,734 INFO L87 Difference]: Start difference. First operand 62084 states and 213776 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:48,135 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-12-17 23:59:48,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:48,955 INFO L93 Difference]: Finished difference Result 72652 states and 249536 transitions. [2020-12-17 23:59:48,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-17 23:59:48,961 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2020-12-17 23:59:48,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:48,962 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:59:48,963 INFO L78 Accepts]: Start accepts. Automaton has 72652 states and 249536 transitions. Word has length 64 [2020-12-17 23:59:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:48,963 INFO L481 AbstractCegarLoop]: Abstraction has 72652 states and 249536 transitions. [2020-12-17 23:59:48,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 72652 states and 249536 transitions. [2020-12-17 23:59:49,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-17 23:59:49,053 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:49,053 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:49,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-17 23:59:49,054 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1079631498, now seen corresponding path program 1 times [2020-12-17 23:59:49,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:49,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281585403] [2020-12-17 23:59:49,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:49,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:49,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281585403] [2020-12-17 23:59:49,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:49,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-12-17 23:59:49,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353979381] [2020-12-17 23:59:49,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-17 23:59:49,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:49,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-17 23:59:49,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-12-17 23:59:49,399 INFO L87 Difference]: Start difference. First operand 72652 states and 249536 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:50,466 INFO L93 Difference]: Finished difference Result 79106 states and 270860 transitions. [2020-12-17 23:59:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-17 23:59:50,472 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-12-17 23:59:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:50,473 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-12-17 23:59:50,473 INFO L78 Accepts]: Start accepts. Automaton has 79106 states and 270860 transitions. Word has length 65 [2020-12-17 23:59:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:50,479 INFO L481 AbstractCegarLoop]: Abstraction has 79106 states and 270860 transitions. [2020-12-17 23:59:50,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 9 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:50,480 INFO L276 IsEmpty]: Start isEmpty. Operand 79106 states and 270860 transitions. [2020-12-17 23:59:50,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-17 23:59:50,557 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:50,566 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:50,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-17 23:59:50,567 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:50,572 INFO L82 PathProgramCache]: Analyzing trace with hash -874613752, now seen corresponding path program 1 times [2020-12-17 23:59:50,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:50,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848153077] [2020-12-17 23:59:50,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:50,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:50,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848153077] [2020-12-17 23:59:50,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:50,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:59:50,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765158685] [2020-12-17 23:59:50,710 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:59:50,710 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:50,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:59:50,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:59:50,711 INFO L87 Difference]: Start difference. First operand 79106 states and 270860 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:52,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:52,087 INFO L93 Difference]: Finished difference Result 145892 states and 494136 transitions. [2020-12-17 23:59:52,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:59:52,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2020-12-17 23:59:52,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:52,090 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:52,090 INFO L78 Accepts]: Start accepts. Automaton has 145892 states and 494136 transitions. Word has length 65 [2020-12-17 23:59:52,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:52,091 INFO L481 AbstractCegarLoop]: Abstraction has 145892 states and 494136 transitions. [2020-12-17 23:59:52,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:52,091 INFO L276 IsEmpty]: Start isEmpty. Operand 145892 states and 494136 transitions. [2020-12-17 23:59:52,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:59:52,221 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:52,221 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:52,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-17 23:59:52,222 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:52,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:52,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1872757919, now seen corresponding path program 1 times [2020-12-17 23:59:52,228 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:52,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245034752] [2020-12-17 23:59:52,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:52,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:52,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:52,568 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245034752] [2020-12-17 23:59:52,568 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:52,569 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:59:52,569 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622938470] [2020-12-17 23:59:52,569 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:59:52,569 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:59:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:59:52,570 INFO L87 Difference]: Start difference. First operand 145892 states and 494136 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:54,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:54,416 INFO L93 Difference]: Finished difference Result 180757 states and 611898 transitions. [2020-12-17 23:59:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-17 23:59:54,417 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-12-17 23:59:54,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:54,418 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-12-17 23:59:54,418 INFO L78 Accepts]: Start accepts. Automaton has 180757 states and 611898 transitions. Word has length 66 [2020-12-17 23:59:54,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:54,418 INFO L481 AbstractCegarLoop]: Abstraction has 180757 states and 611898 transitions. [2020-12-17 23:59:54,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 180757 states and 611898 transitions. [2020-12-17 23:59:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:59:54,507 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:54,508 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:54,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-17 23:59:54,509 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:54,511 INFO L82 PathProgramCache]: Analyzing trace with hash -768337751, now seen corresponding path program 2 times [2020-12-17 23:59:54,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:54,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475511780] [2020-12-17 23:59:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:55,483 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475511780] [2020-12-17 23:59:55,483 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:55,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-17 23:59:55,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156006119] [2020-12-17 23:59:55,484 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-17 23:59:55,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-17 23:59:55,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:59:55,485 INFO L87 Difference]: Start difference. First operand 180757 states and 611898 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:59:57,789 INFO L93 Difference]: Finished difference Result 201084 states and 679781 transitions. [2020-12-17 23:59:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-17 23:59:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-12-17 23:59:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:59:57,791 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2020-12-17 23:59:57,791 INFO L78 Accepts]: Start accepts. Automaton has 201084 states and 679781 transitions. Word has length 66 [2020-12-17 23:59:57,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:59:57,792 INFO L481 AbstractCegarLoop]: Abstraction has 201084 states and 679781 transitions. [2020-12-17 23:59:57,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:59:57,792 INFO L276 IsEmpty]: Start isEmpty. Operand 201084 states and 679781 transitions. [2020-12-17 23:59:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:59:57,872 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:59:57,872 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-17 23:59:57,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-17 23:59:57,872 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:59:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:59:57,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1784905911, now seen corresponding path program 3 times [2020-12-17 23:59:57,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:59:57,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657905538] [2020-12-17 23:59:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:59:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:59:58,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:59:58,062 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657905538] [2020-12-17 23:59:58,062 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:59:58,062 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:59:58,063 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919930693] [2020-12-17 23:59:58,063 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:59:58,063 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:59:58,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:59:58,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:59:58,064 INFO L87 Difference]: Start difference. First operand 201084 states and 679781 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:00,825 INFO L93 Difference]: Finished difference Result 231768 states and 783031 transitions. [2020-12-18 00:00:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-18 00:00:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2020-12-18 00:00:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:00,827 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-12-18 00:00:00,827 INFO L78 Accepts]: Start accepts. Automaton has 231768 states and 783031 transitions. Word has length 66 [2020-12-18 00:00:00,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:00,827 INFO L481 AbstractCegarLoop]: Abstraction has 231768 states and 783031 transitions. [2020-12-18 00:00:00,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:00,828 INFO L276 IsEmpty]: Start isEmpty. Operand 231768 states and 783031 transitions. [2020-12-18 00:00:00,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-18 00:00:00,967 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:00,967 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:00,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-18 00:00:00,967 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash -295227412, now seen corresponding path program 1 times [2020-12-18 00:00:00,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:00,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912314234] [2020-12-18 00:00:00,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:01,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912314234] [2020-12-18 00:00:01,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:01,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-12-18 00:00:01,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317790029] [2020-12-18 00:00:01,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-18 00:00:01,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:01,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-18 00:00:01,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-12-18 00:00:01,365 INFO L87 Difference]: Start difference. First operand 231768 states and 783031 transitions. Second operand has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:03,712 INFO L93 Difference]: Finished difference Result 254556 states and 859290 transitions. [2020-12-18 00:00:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-12-18 00:00:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-12-18 00:00:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:03,714 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2020-12-18 00:00:03,714 INFO L78 Accepts]: Start accepts. Automaton has 254556 states and 859290 transitions. Word has length 67 [2020-12-18 00:00:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:03,714 INFO L481 AbstractCegarLoop]: Abstraction has 254556 states and 859290 transitions. [2020-12-18 00:00:03,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:03,714 INFO L276 IsEmpty]: Start isEmpty. Operand 254556 states and 859290 transitions. [2020-12-18 00:00:03,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-18 00:00:03,831 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:03,831 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:03,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-18 00:00:03,831 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:03,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:03,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1358644214, now seen corresponding path program 2 times [2020-12-18 00:00:03,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:03,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078997538] [2020-12-18 00:00:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:05,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:05,286 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078997538] [2020-12-18 00:00:05,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:05,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-18 00:00:05,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766146078] [2020-12-18 00:00:05,287 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-18 00:00:05,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:05,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-18 00:00:05,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2020-12-18 00:00:05,291 INFO L87 Difference]: Start difference. First operand 254556 states and 859290 transitions. Second operand has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:08,367 INFO L93 Difference]: Finished difference Result 312899 states and 1049146 transitions. [2020-12-18 00:00:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2020-12-18 00:00:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-12-18 00:00:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:08,369 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=617, Unknown=0, NotChecked=0, Total=870 [2020-12-18 00:00:08,369 INFO L78 Accepts]: Start accepts. Automaton has 312899 states and 1049146 transitions. Word has length 67 [2020-12-18 00:00:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:08,369 INFO L481 AbstractCegarLoop]: Abstraction has 312899 states and 1049146 transitions. [2020-12-18 00:00:08,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:08,370 INFO L276 IsEmpty]: Start isEmpty. Operand 312899 states and 1049146 transitions. [2020-12-18 00:00:09,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-18 00:00:09,396 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:09,396 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:09,396 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-18 00:00:09,397 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:09,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:09,397 INFO L82 PathProgramCache]: Analyzing trace with hash 198205582, now seen corresponding path program 3 times [2020-12-18 00:00:09,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:09,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410246559] [2020-12-18 00:00:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:09,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:09,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:09,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410246559] [2020-12-18 00:00:09,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:09,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-18 00:00:09,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028561275] [2020-12-18 00:00:09,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-18 00:00:09,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:09,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-18 00:00:09,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-12-18 00:00:09,799 INFO L87 Difference]: Start difference. First operand 312899 states and 1049146 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:12,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:12,698 INFO L93 Difference]: Finished difference Result 334387 states and 1118118 transitions. [2020-12-18 00:00:12,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-18 00:00:12,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-12-18 00:00:12,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:12,699 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-12-18 00:00:12,699 INFO L78 Accepts]: Start accepts. Automaton has 334387 states and 1118118 transitions. Word has length 67 [2020-12-18 00:00:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:12,699 INFO L481 AbstractCegarLoop]: Abstraction has 334387 states and 1118118 transitions. [2020-12-18 00:00:12,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 334387 states and 1118118 transitions. [2020-12-18 00:00:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-18 00:00:12,852 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:12,852 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:12,852 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-18 00:00:12,852 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:12,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:12,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1808064816, now seen corresponding path program 1 times [2020-12-18 00:00:12,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:12,853 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224182132] [2020-12-18 00:00:12,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:12,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:12,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224182132] [2020-12-18 00:00:12,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:12,966 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-18 00:00:12,966 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819179489] [2020-12-18 00:00:12,967 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-18 00:00:12,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:12,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-18 00:00:12,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-18 00:00:12,970 INFO L87 Difference]: Start difference. First operand 334387 states and 1118118 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:14,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:14,799 INFO L93 Difference]: Finished difference Result 164560 states and 534618 transitions. [2020-12-18 00:00:14,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-18 00:00:14,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-12-18 00:00:14,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:14,800 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-18 00:00:14,800 INFO L78 Accepts]: Start accepts. Automaton has 164560 states and 534618 transitions. Word has length 67 [2020-12-18 00:00:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:14,801 INFO L481 AbstractCegarLoop]: Abstraction has 164560 states and 534618 transitions. [2020-12-18 00:00:14,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 164560 states and 534618 transitions. [2020-12-18 00:00:14,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-18 00:00:14,881 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:14,881 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:14,881 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-18 00:00:14,881 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:14,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:14,881 INFO L82 PathProgramCache]: Analyzing trace with hash -901901798, now seen corresponding path program 1 times [2020-12-18 00:00:14,882 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:14,882 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807130016] [2020-12-18 00:00:14,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:14,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807130016] [2020-12-18 00:00:15,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:15,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-18 00:00:15,001 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631063323] [2020-12-18 00:00:15,002 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-18 00:00:15,003 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:15,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-18 00:00:15,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-18 00:00:15,003 INFO L87 Difference]: Start difference. First operand 164560 states and 534618 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:16,277 INFO L93 Difference]: Finished difference Result 54382 states and 172236 transitions. [2020-12-18 00:00:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-18 00:00:16,277 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2020-12-18 00:00:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:16,280 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-18 00:00:16,280 INFO L78 Accepts]: Start accepts. Automaton has 54382 states and 172236 transitions. Word has length 68 [2020-12-18 00:00:16,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:16,281 INFO L481 AbstractCegarLoop]: Abstraction has 54382 states and 172236 transitions. [2020-12-18 00:00:16,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:16,281 INFO L276 IsEmpty]: Start isEmpty. Operand 54382 states and 172236 transitions. [2020-12-18 00:00:16,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-18 00:00:16,341 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:16,341 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:16,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-18 00:00:16,341 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:16,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:16,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1257087163, now seen corresponding path program 1 times [2020-12-18 00:00:16,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:16,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017738687] [2020-12-18 00:00:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-18 00:00:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-18 00:00:16,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017738687] [2020-12-18 00:00:16,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-18 00:00:16,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-18 00:00:16,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119281826] [2020-12-18 00:00:16,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-18 00:00:16,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-18 00:00:16,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-18 00:00:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-18 00:00:16,566 INFO L87 Difference]: Start difference. First operand 54382 states and 172236 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-18 00:00:16,974 INFO L93 Difference]: Finished difference Result 25978 states and 82650 transitions. [2020-12-18 00:00:16,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-18 00:00:16,974 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2020-12-18 00:00:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-18 00:00:16,975 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2020-12-18 00:00:16,975 INFO L78 Accepts]: Start accepts. Automaton has 25978 states and 82650 transitions. Word has length 70 [2020-12-18 00:00:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-18 00:00:16,976 INFO L481 AbstractCegarLoop]: Abstraction has 25978 states and 82650 transitions. [2020-12-18 00:00:16,976 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-18 00:00:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 25978 states and 82650 transitions. [2020-12-18 00:00:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-18 00:00:17,018 INFO L496 BasicCegarLoop]: Found error trace [2020-12-18 00:00:17,018 INFO L504 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-18 00:00:17,018 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-18 00:00:17,018 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-18 00:00:17,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-18 00:00:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash -2146085244, now seen corresponding path program 1 times [2020-12-18 00:00:17,019 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-18 00:00:17,019 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459533770] [2020-12-18 00:00:17,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-18 00:00:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-18 00:00:17,063 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-18 00:00:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-18 00:00:17,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-18 00:00:17,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-18 00:00:17,214 INFO L605 BasicCegarLoop]: Counterexample might be feasible [2020-12-18 00:00:17,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-18 00:00:17,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:00:17 BasicIcfg [2020-12-18 00:00:17,429 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-18 00:00:17,433 INFO L168 Benchmark]: Toolchain (without parser) took 40392.96 ms. Allocated memory was 308.3 MB in the beginning and 13.8 GB in the end (delta: 13.5 GB). Free memory was 283.7 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,435 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 308.3 MB. Free memory is still 278.1 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-12-18 00:00:17,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.29 ms. Allocated memory is still 308.3 MB. Free memory was 283.5 MB in the beginning and 249.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.24 ms. Allocated memory is still 308.3 MB. Free memory was 249.5 MB in the beginning and 288.6 MB in the end (delta: -39.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,437 INFO L168 Benchmark]: Boogie Preprocessor took 40.86 ms. Allocated memory is still 308.3 MB. Free memory was 288.6 MB in the beginning and 286.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,440 INFO L168 Benchmark]: RCFGBuilder took 2432.83 ms. Allocated memory was 308.3 MB in the beginning and 371.2 MB in the end (delta: 62.9 MB). Free memory was 286.5 MB in the beginning and 319.6 MB in the end (delta: -33.1 MB). Peak memory consumption was 179.8 MB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,441 INFO L168 Benchmark]: TraceAbstraction took 36996.91 ms. Allocated memory was 371.2 MB in the beginning and 13.8 GB in the end (delta: 13.4 GB). Free memory was 318.5 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. [2020-12-18 00:00:17,447 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 308.3 MB. Free memory is still 278.1 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 771.29 ms. Allocated memory is still 308.3 MB. Free memory was 283.5 MB in the beginning and 249.5 MB in the end (delta: 34.0 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 137.24 ms. Allocated memory is still 308.3 MB. Free memory was 249.5 MB in the beginning and 288.6 MB in the end (delta: -39.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.86 ms. Allocated memory is still 308.3 MB. Free memory was 288.6 MB in the beginning and 286.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2432.83 ms. Allocated memory was 308.3 MB in the beginning and 371.2 MB in the end (delta: 62.9 MB). Free memory was 286.5 MB in the beginning and 319.6 MB in the end (delta: -33.1 MB). Peak memory consumption was 179.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 36996.91 ms. Allocated memory was 371.2 MB in the beginning and 13.8 GB in the end (delta: 13.4 GB). Free memory was 318.5 MB in the beginning and 10.0 GB in the end (delta: -9.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L717] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L718] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L719] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L720] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L721] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L722] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L733] 0 int z = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2504; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2504, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2505; VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2505, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2506; VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2506, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, 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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L834] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L836] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L837] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L838] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L17] 0 __assert_fail ("0", "safe030_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 36.6s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 2828 SDtfs, 5923 SDslu, 11507 SDs, 0 SdLazy, 1709 SolverSat, 350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 5.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334387occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 1162 NumberOfCodeBlocks, 1162 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1072 ConstructedInterpolants, 0 QuantifiedInterpolants, 375865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...