/usr/bin/java -Xmx8000000000 -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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 12:35:14,304 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 12:35:14,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 12:35:14,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 12:35:14,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 12:35:14,343 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 12:35:14,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 12:35:14,348 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 12:35:14,350 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 12:35:14,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 12:35:14,353 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 12:35:14,355 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 12:35:14,355 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 12:35:14,357 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 12:35:14,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 12:35:14,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 12:35:14,361 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 12:35:14,362 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 12:35:14,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 12:35:14,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 12:35:14,369 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 12:35:14,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 12:35:14,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 12:35:14,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 12:35:14,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 12:35:14,378 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 12:35:14,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 12:35:14,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 12:35:14,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 12:35:14,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 12:35:14,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 12:35:14,383 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 12:35:14,384 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 12:35:14,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 12:35:14,387 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 12:35:14,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 12:35:14,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 12:35:14,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 12:35:14,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 12:35:14,406 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 12:35:14,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 12:35:14,408 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-09 12:35:14,437 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 12:35:14,437 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 12:35:14,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 12:35:14,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 12:35:14,439 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 12:35:14,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 12:35:14,440 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 12:35:14,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 12:35:14,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 12:35:14,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 12:35:14,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 12:35:14,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 12:35:14,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 12:35:14,442 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 12:35:14,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 12:35:14,443 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 12:35:14,443 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 12:35:14,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 12:35:14,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 12:35:14,444 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 12:35:14,444 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 12:35:14,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 12:35:14,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 12:35:14,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-09 12:35:14,445 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 12:35:14,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 12:35:14,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 12:35:14,446 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 12:35:14,446 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-09 12:35:14,447 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-11-09 12:35:14,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 12:35:14,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 12:35:14,955 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 12:35:14,956 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 12:35:14,957 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 12:35:14,958 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2020-11-09 12:35:15,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d37f41a/41eb4cb8eae046b089ca8a45b99bbaa1/FLAGfbce9775d [2020-11-09 12:35:15,885 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 12:35:15,886 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix055_power.opt.i [2020-11-09 12:35:15,906 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d37f41a/41eb4cb8eae046b089ca8a45b99bbaa1/FLAGfbce9775d [2020-11-09 12:35:16,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d37f41a/41eb4cb8eae046b089ca8a45b99bbaa1 [2020-11-09 12:35:16,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 12:35:16,159 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 12:35:16,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 12:35:16,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 12:35:16,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 12:35:16,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,169 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3faf5dcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16, skipping insertion in model container [2020-11-09 12:35:16,169 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 12:35:16,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 12:35:16,633 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:35:16,650 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 12:35:16,740 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 12:35:16,869 INFO L208 MainTranslator]: Completed translation [2020-11-09 12:35:16,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16 WrapperNode [2020-11-09 12:35:16,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 12:35:16,872 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 12:35:16,872 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 12:35:16,875 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 12:35:16,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,930 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 12:35:16,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 12:35:16,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 12:35:16,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 12:35:16,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,989 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:16,989 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:17,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:17,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:17,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (1/1) ... [2020-11-09 12:35:17,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 12:35:17,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 12:35:17,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 12:35:17,042 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 12:35:17,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (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-11-09 12:35:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 12:35:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 12:35:17,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 12:35:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 12:35:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 12:35:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 12:35:17,119 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 12:35:17,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 12:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 12:35:17,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 12:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 12:35:17,120 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 12:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 12:35:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 12:35:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 12:35:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 12:35:17,123 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 12:35:19,463 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 12:35:19,464 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 12:35:19,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:19 BoogieIcfgContainer [2020-11-09 12:35:19,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 12:35:19,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 12:35:19,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 12:35:19,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 12:35:19,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 12:35:16" (1/3) ... [2020-11-09 12:35:19,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f08fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:19, skipping insertion in model container [2020-11-09 12:35:19,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 12:35:16" (2/3) ... [2020-11-09 12:35:19,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e5f08fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 12:35:19, skipping insertion in model container [2020-11-09 12:35:19,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 12:35:19" (3/3) ... [2020-11-09 12:35:19,475 INFO L111 eAbstractionObserver]: Analyzing ICFG mix055_power.opt.i [2020-11-09 12:35:19,493 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 12:35:19,493 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-09 12:35:19,497 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 12:35:19,498 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 12:35:19,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,539 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,542 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,543 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,544 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,545 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,546 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,547 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,547 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,548 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,549 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,550 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,551 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,553 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,554 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,555 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,556 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,558 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,558 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,559 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,559 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,560 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,560 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,561 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,565 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,566 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,566 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,566 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,568 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,568 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 12:35:19,573 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 12:35:19,585 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 12:35:19,608 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 12:35:19,608 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 12:35:19,608 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-09 12:35:19,608 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-09 12:35:19,609 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 12:35:19,609 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 12:35:19,609 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 12:35:19,609 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 12:35:19,623 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-09 12:35:19,625 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-09 12:35:19,627 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 117 transitions, 254 flow [2020-11-09 12:35:19,629 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 127 places, 117 transitions, 254 flow [2020-11-09 12:35:19,685 INFO L129 PetriNetUnfolder]: 3/113 cut-off events. [2020-11-09 12:35:19,685 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 12:35:19,690 INFO L84 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 87 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2020-11-09 12:35:19,698 INFO L116 LiptonReduction]: Number of co-enabled transitions 2622 [2020-11-09 12:35:20,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:35:20,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:20,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:35:20,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:20,571 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 12:35:20,728 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 12:35:20,923 WARN L194 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 12:35:21,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:35:21,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:21,172 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:35:21,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:21,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-11-09 12:35:21,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:21,191 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:35:21,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:22,503 WARN L194 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-09 12:35:22,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 12:35:22,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:22,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 12:35:22,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:23,619 WARN L194 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-09 12:35:26,219 WARN L194 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 312 DAG size of output: 268 [2020-11-09 12:35:26,225 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:35:26,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 12:35:26,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 12:35:26,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:35:26,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,274 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 12:35:26,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,290 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,295 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:35:26,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,318 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-11-09 12:35:26,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 3, 2, 1] term [2020-11-09 12:35:26,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 12:35:26,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,332 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 12:35:26,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:26,334 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 1] term [2020-11-09 12:35:26,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,336 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 12:35:26,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:26,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:35:26,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,392 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:26,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 12:35:26,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:26,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 12:35:26,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:29,529 WARN L194 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 380 DAG size of output: 283 [2020-11-09 12:35:29,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:35:29,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:31,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:31,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:31,130 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:31,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:31,134 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:31,134 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:31,137 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:31,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:31,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:31,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:31,171 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:31,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:31,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:31,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:31,189 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:31,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:31,753 WARN L194 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 12:35:31,886 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:35:32,496 WARN L194 SmtUtils]: Spent 608.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-11-09 12:35:32,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 12:35:32,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,003 WARN L194 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-11-09 12:35:33,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:33,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:33,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:33,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:33,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:33,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:33,156 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:33,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:33,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:33,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:33,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-09 12:35:33,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 12:35:33,375 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 12:35:33,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:33,574 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 12:35:33,744 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 12:35:34,329 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:35:34,460 WARN L194 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 12:35:34,672 WARN L194 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 12:35:34,898 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-11-09 12:35:35,914 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-11-09 12:35:36,954 WARN L194 SmtUtils]: Spent 836.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-11-09 12:35:37,341 WARN L194 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2020-11-09 12:35:40,299 WARN L194 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 269 DAG size of output: 221 [2020-11-09 12:35:41,261 WARN L194 SmtUtils]: Spent 956.00 ms on a formula simplification that was a NOOP. DAG size: 220 [2020-11-09 12:35:42,064 WARN L194 SmtUtils]: Spent 801.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 109 [2020-11-09 12:35:42,780 WARN L194 SmtUtils]: Spent 713.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 105 [2020-11-09 12:35:44,914 WARN L194 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 269 DAG size of output: 222 [2020-11-09 12:35:45,971 WARN L194 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 221 [2020-11-09 12:35:46,095 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:35:46,226 WARN L194 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:35:46,343 WARN L194 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:35:46,462 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 12:35:46,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-09 12:35:46,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-09 12:35:46,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,540 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,546 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,550 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,553 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,557 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:35:46,591 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,751 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-09 12:35:46,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-09 12:35:46,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,757 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,760 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,766 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,769 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,771 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:35:46,794 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:35:46,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-09 12:35:46,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,853 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-09 12:35:46,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,856 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:46,858 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,859 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,860 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,862 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:46,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,865 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:46,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:46,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:47,891 WARN L194 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 135 [2020-11-09 12:35:48,322 WARN L194 SmtUtils]: Spent 428.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2020-11-09 12:35:51,187 WARN L194 SmtUtils]: Spent 2.86 s on a formula simplification. DAG size of input: 285 DAG size of output: 270 [2020-11-09 12:35:52,574 WARN L194 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 269 [2020-11-09 12:35:52,585 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:52,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 12:35:52,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:52,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:52,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 7, 2, 2, 1] term [2020-11-09 12:35:52,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:52,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 3, 2, 1] term [2020-11-09 12:35:52,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:52,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:52,627 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 12:35:52,633 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:52,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:52,642 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 7, 3, 7, 3, 2, 2, 1] term [2020-11-09 12:35:52,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:52,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:52,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 7, 3, 7, 3, 7, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-09 12:35:52,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 12:35:53,345 WARN L194 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 12:35:53,669 WARN L194 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 12:35:54,324 WARN L194 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 120 [2020-11-09 12:35:54,652 WARN L194 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-11-09 12:35:54,881 INFO L131 LiptonReduction]: Checked pairs total: 6769 [2020-11-09 12:35:54,881 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-09 12:35:54,888 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 44 places, 31 transitions, 82 flow [2020-11-09 12:35:55,056 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2602 states. [2020-11-09 12:35:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states. [2020-11-09 12:35:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 12:35:55,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:55,070 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:55,071 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:55,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:55,081 INFO L82 PathProgramCache]: Analyzing trace with hash 172921797, now seen corresponding path program 1 times [2020-11-09 12:35:55,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:55,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389826336] [2020-11-09 12:35:55,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:55,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389826336] [2020-11-09 12:35:55,509 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:55,509 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:35:55,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459813766] [2020-11-09 12:35:55,515 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:35:55,515 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:55,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:35:55,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:35:55,538 INFO L87 Difference]: Start difference. First operand 2602 states. Second operand 3 states. [2020-11-09 12:35:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:55,704 INFO L93 Difference]: Finished difference Result 2202 states and 8424 transitions. [2020-11-09 12:35:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:35:55,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-09 12:35:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:55,757 INFO L225 Difference]: With dead ends: 2202 [2020-11-09 12:35:55,758 INFO L226 Difference]: Without dead ends: 1802 [2020-11-09 12:35:55,759 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:35:55,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2020-11-09 12:35:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1802. [2020-11-09 12:35:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1802 states. [2020-11-09 12:35:55,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 6784 transitions. [2020-11-09 12:35:55,946 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 6784 transitions. Word has length 9 [2020-11-09 12:35:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:55,947 INFO L481 AbstractCegarLoop]: Abstraction has 1802 states and 6784 transitions. [2020-11-09 12:35:55,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:35:55,947 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 6784 transitions. [2020-11-09 12:35:55,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 12:35:55,952 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:55,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:55,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 12:35:55,953 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:55,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:55,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1325818042, now seen corresponding path program 1 times [2020-11-09 12:35:55,957 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:55,957 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298704515] [2020-11-09 12:35:55,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:56,153 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298704515] [2020-11-09 12:35:56,153 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:56,153 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 12:35:56,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427301023] [2020-11-09 12:35:56,154 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:35:56,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:56,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:35:56,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:35:56,155 INFO L87 Difference]: Start difference. First operand 1802 states and 6784 transitions. Second operand 3 states. [2020-11-09 12:35:56,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:56,228 INFO L93 Difference]: Finished difference Result 1792 states and 6736 transitions. [2020-11-09 12:35:56,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:35:56,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 12:35:56,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:56,249 INFO L225 Difference]: With dead ends: 1792 [2020-11-09 12:35:56,250 INFO L226 Difference]: Without dead ends: 1792 [2020-11-09 12:35:56,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:35:56,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2020-11-09 12:35:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1792. [2020-11-09 12:35:56,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1792 states. [2020-11-09 12:35:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1792 states to 1792 states and 6736 transitions. [2020-11-09 12:35:56,330 INFO L78 Accepts]: Start accepts. Automaton has 1792 states and 6736 transitions. Word has length 11 [2020-11-09 12:35:56,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:56,331 INFO L481 AbstractCegarLoop]: Abstraction has 1792 states and 6736 transitions. [2020-11-09 12:35:56,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:35:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1792 states and 6736 transitions. [2020-11-09 12:35:56,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:35:56,340 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:56,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:56,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 12:35:56,340 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:56,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1861488477, now seen corresponding path program 1 times [2020-11-09 12:35:56,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:56,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55915248] [2020-11-09 12:35:56,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:56,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55915248] [2020-11-09 12:35:56,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:56,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:35:56,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239521154] [2020-11-09 12:35:56,499 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:35:56,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:56,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:35:56,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:35:56,501 INFO L87 Difference]: Start difference. First operand 1792 states and 6736 transitions. Second operand 4 states. [2020-11-09 12:35:56,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:56,587 INFO L93 Difference]: Finished difference Result 1764 states and 6612 transitions. [2020-11-09 12:35:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:35:56,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 12:35:56,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:56,641 INFO L225 Difference]: With dead ends: 1764 [2020-11-09 12:35:56,641 INFO L226 Difference]: Without dead ends: 1764 [2020-11-09 12:35:56,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:35:56,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2020-11-09 12:35:56,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1764. [2020-11-09 12:35:56,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1764 states. [2020-11-09 12:35:56,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1764 states to 1764 states and 6612 transitions. [2020-11-09 12:35:56,725 INFO L78 Accepts]: Start accepts. Automaton has 1764 states and 6612 transitions. Word has length 12 [2020-11-09 12:35:56,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:56,726 INFO L481 AbstractCegarLoop]: Abstraction has 1764 states and 6612 transitions. [2020-11-09 12:35:56,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:35:56,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1764 states and 6612 transitions. [2020-11-09 12:35:56,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 12:35:56,728 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:56,728 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:56,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 12:35:56,728 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:56,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:56,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1849246298, now seen corresponding path program 1 times [2020-11-09 12:35:56,730 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:56,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150077723] [2020-11-09 12:35:56,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:56,846 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150077723] [2020-11-09 12:35:56,846 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:56,846 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:35:56,847 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194146904] [2020-11-09 12:35:56,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:35:56,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:56,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:35:56,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:35:56,851 INFO L87 Difference]: Start difference. First operand 1764 states and 6612 transitions. Second operand 4 states. [2020-11-09 12:35:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:56,959 INFO L93 Difference]: Finished difference Result 1724 states and 6430 transitions. [2020-11-09 12:35:56,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:35:56,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-09 12:35:56,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:56,980 INFO L225 Difference]: With dead ends: 1724 [2020-11-09 12:35:56,980 INFO L226 Difference]: Without dead ends: 1724 [2020-11-09 12:35:56,981 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2020-11-09 12:35:57,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2020-11-09 12:35:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2020-11-09 12:35:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 6430 transitions. [2020-11-09 12:35:57,057 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 6430 transitions. Word has length 12 [2020-11-09 12:35:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:57,057 INFO L481 AbstractCegarLoop]: Abstraction has 1724 states and 6430 transitions. [2020-11-09 12:35:57,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:35:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 6430 transitions. [2020-11-09 12:35:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 12:35:57,060 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:57,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:57,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 12:35:57,060 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:57,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:57,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1871500579, now seen corresponding path program 1 times [2020-11-09 12:35:57,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:57,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104163241] [2020-11-09 12:35:57,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:57,365 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104163241] [2020-11-09 12:35:57,365 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:57,365 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:35:57,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646216702] [2020-11-09 12:35:57,366 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:35:57,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:57,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:35:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:57,367 INFO L87 Difference]: Start difference. First operand 1724 states and 6430 transitions. Second operand 5 states. [2020-11-09 12:35:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:57,497 INFO L93 Difference]: Finished difference Result 1668 states and 6182 transitions. [2020-11-09 12:35:57,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:35:57,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-11-09 12:35:57,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:57,515 INFO L225 Difference]: With dead ends: 1668 [2020-11-09 12:35:57,515 INFO L226 Difference]: Without dead ends: 1668 [2020-11-09 12:35:57,516 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:35:57,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2020-11-09 12:35:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1668. [2020-11-09 12:35:57,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2020-11-09 12:35:57,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 6182 transitions. [2020-11-09 12:35:57,585 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 6182 transitions. Word has length 13 [2020-11-09 12:35:57,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:57,585 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 6182 transitions. [2020-11-09 12:35:57,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:35:57,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 6182 transitions. [2020-11-09 12:35:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:35:57,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:57,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:57,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 12:35:57,588 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash -2110987523, now seen corresponding path program 1 times [2020-11-09 12:35:57,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:57,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417024483] [2020-11-09 12:35:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:57,780 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417024483] [2020-11-09 12:35:57,780 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:57,780 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:35:57,781 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370455660] [2020-11-09 12:35:57,781 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:35:57,781 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:57,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:35:57,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:57,783 INFO L87 Difference]: Start difference. First operand 1668 states and 6182 transitions. Second operand 5 states. [2020-11-09 12:35:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:57,897 INFO L93 Difference]: Finished difference Result 1684 states and 6238 transitions. [2020-11-09 12:35:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:35:57,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 12:35:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:57,915 INFO L225 Difference]: With dead ends: 1684 [2020-11-09 12:35:57,915 INFO L226 Difference]: Without dead ends: 1684 [2020-11-09 12:35:57,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:35:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2020-11-09 12:35:57,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 1684. [2020-11-09 12:35:57,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1684 states. [2020-11-09 12:35:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1684 states to 1684 states and 6238 transitions. [2020-11-09 12:35:57,988 INFO L78 Accepts]: Start accepts. Automaton has 1684 states and 6238 transitions. Word has length 14 [2020-11-09 12:35:57,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:57,988 INFO L481 AbstractCegarLoop]: Abstraction has 1684 states and 6238 transitions. [2020-11-09 12:35:57,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:35:57,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1684 states and 6238 transitions. [2020-11-09 12:35:57,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 12:35:57,991 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:57,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:57,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 12:35:57,992 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:57,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:57,992 INFO L82 PathProgramCache]: Analyzing trace with hash -2113368323, now seen corresponding path program 2 times [2020-11-09 12:35:57,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:57,993 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873060084] [2020-11-09 12:35:57,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:58,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:58,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873060084] [2020-11-09 12:35:58,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:58,136 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:35:58,136 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605081131] [2020-11-09 12:35:58,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:35:58,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:35:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:58,137 INFO L87 Difference]: Start difference. First operand 1684 states and 6238 transitions. Second operand 5 states. [2020-11-09 12:35:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:58,276 INFO L93 Difference]: Finished difference Result 1642 states and 6066 transitions. [2020-11-09 12:35:58,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 12:35:58,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-11-09 12:35:58,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:58,293 INFO L225 Difference]: With dead ends: 1642 [2020-11-09 12:35:58,293 INFO L226 Difference]: Without dead ends: 1642 [2020-11-09 12:35:58,294 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:35:58,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1642 states. [2020-11-09 12:35:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1642 to 1626. [2020-11-09 12:35:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1626 states. [2020-11-09 12:35:58,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1626 states to 1626 states and 6010 transitions. [2020-11-09 12:35:58,357 INFO L78 Accepts]: Start accepts. Automaton has 1626 states and 6010 transitions. Word has length 14 [2020-11-09 12:35:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:58,357 INFO L481 AbstractCegarLoop]: Abstraction has 1626 states and 6010 transitions. [2020-11-09 12:35:58,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:35:58,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1626 states and 6010 transitions. [2020-11-09 12:35:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 12:35:58,361 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:58,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:58,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 12:35:58,361 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:58,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:58,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1082379228, now seen corresponding path program 1 times [2020-11-09 12:35:58,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:58,363 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927639615] [2020-11-09 12:35:58,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:58,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927639615] [2020-11-09 12:35:58,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:58,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 12:35:58,486 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024583980] [2020-11-09 12:35:58,487 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 12:35:58,487 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:58,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 12:35:58,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 12:35:58,488 INFO L87 Difference]: Start difference. First operand 1626 states and 6010 transitions. Second operand 4 states. [2020-11-09 12:35:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:58,559 INFO L93 Difference]: Finished difference Result 1682 states and 5674 transitions. [2020-11-09 12:35:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 12:35:58,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-09 12:35:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:58,571 INFO L225 Difference]: With dead ends: 1682 [2020-11-09 12:35:58,571 INFO L226 Difference]: Without dead ends: 1282 [2020-11-09 12:35:58,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2020-11-09 12:35:58,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1282. [2020-11-09 12:35:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-11-09 12:35:58,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 4290 transitions. [2020-11-09 12:35:58,644 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 4290 transitions. Word has length 15 [2020-11-09 12:35:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:58,645 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 4290 transitions. [2020-11-09 12:35:58,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 12:35:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 4290 transitions. [2020-11-09 12:35:58,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 12:35:58,648 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:58,648 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:58,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 12:35:58,649 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:58,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:58,649 INFO L82 PathProgramCache]: Analyzing trace with hash -75162851, now seen corresponding path program 1 times [2020-11-09 12:35:58,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:58,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32546819] [2020-11-09 12:35:58,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:58,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32546819] [2020-11-09 12:35:58,748 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:58,748 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:35:58,748 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444323061] [2020-11-09 12:35:58,748 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 12:35:58,749 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:58,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 12:35:58,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 12:35:58,750 INFO L87 Difference]: Start difference. First operand 1282 states and 4290 transitions. Second operand 5 states. [2020-11-09 12:35:58,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:58,840 INFO L93 Difference]: Finished difference Result 1105 states and 3390 transitions. [2020-11-09 12:35:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:35:58,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 12:35:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:58,847 INFO L225 Difference]: With dead ends: 1105 [2020-11-09 12:35:58,848 INFO L226 Difference]: Without dead ends: 849 [2020-11-09 12:35:58,848 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:35:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2020-11-09 12:35:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 849. [2020-11-09 12:35:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 849 states. [2020-11-09 12:35:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 849 states to 849 states and 2558 transitions. [2020-11-09 12:35:58,875 INFO L78 Accepts]: Start accepts. Automaton has 849 states and 2558 transitions. Word has length 16 [2020-11-09 12:35:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:58,875 INFO L481 AbstractCegarLoop]: Abstraction has 849 states and 2558 transitions. [2020-11-09 12:35:58,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 12:35:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 2558 transitions. [2020-11-09 12:35:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:35:58,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:58,878 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:58,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 12:35:58,878 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash 679643642, now seen corresponding path program 1 times [2020-11-09 12:35:58,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:58,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411507464] [2020-11-09 12:35:58,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:58,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:58,928 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411507464] [2020-11-09 12:35:58,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:58,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 12:35:58,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691989514] [2020-11-09 12:35:58,929 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 12:35:58,929 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:58,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 12:35:58,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 12:35:58,930 INFO L87 Difference]: Start difference. First operand 849 states and 2558 transitions. Second operand 3 states. [2020-11-09 12:35:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:58,949 INFO L93 Difference]: Finished difference Result 1190 states and 3477 transitions. [2020-11-09 12:35:58,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 12:35:58,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-09 12:35:58,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:58,955 INFO L225 Difference]: With dead ends: 1190 [2020-11-09 12:35:58,955 INFO L226 Difference]: Without dead ends: 860 [2020-11-09 12:35:58,955 INFO L677 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-11-09 12:35:58,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2020-11-09 12:35:58,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 840. [2020-11-09 12:35:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2020-11-09 12:35:58,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 2399 transitions. [2020-11-09 12:35:58,982 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 2399 transitions. Word has length 18 [2020-11-09 12:35:58,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:58,982 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 2399 transitions. [2020-11-09 12:35:58,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 12:35:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 2399 transitions. [2020-11-09 12:35:58,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-09 12:35:58,985 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:58,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:58,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 12:35:58,986 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:58,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:58,986 INFO L82 PathProgramCache]: Analyzing trace with hash -555388612, now seen corresponding path program 1 times [2020-11-09 12:35:58,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:58,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050814520] [2020-11-09 12:35:58,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:59,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:59,083 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050814520] [2020-11-09 12:35:59,083 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:59,084 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 12:35:59,084 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269841842] [2020-11-09 12:35:59,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:35:59,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:59,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:35:59,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:35:59,085 INFO L87 Difference]: Start difference. First operand 840 states and 2399 transitions. Second operand 6 states. [2020-11-09 12:35:59,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:59,204 INFO L93 Difference]: Finished difference Result 733 states and 2056 transitions. [2020-11-09 12:35:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 12:35:59,206 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-09 12:35:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:59,209 INFO L225 Difference]: With dead ends: 733 [2020-11-09 12:35:59,209 INFO L226 Difference]: Without dead ends: 645 [2020-11-09 12:35:59,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:35:59,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2020-11-09 12:35:59,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 645. [2020-11-09 12:35:59,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-11-09 12:35:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1834 transitions. [2020-11-09 12:35:59,228 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1834 transitions. Word has length 18 [2020-11-09 12:35:59,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:59,229 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1834 transitions. [2020-11-09 12:35:59,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:35:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1834 transitions. [2020-11-09 12:35:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:35:59,231 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:59,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:59,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 12:35:59,232 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1261416120, now seen corresponding path program 1 times [2020-11-09 12:35:59,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:59,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82722569] [2020-11-09 12:35:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:59,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:59,389 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82722569] [2020-11-09 12:35:59,389 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:59,389 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 12:35:59,389 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631964310] [2020-11-09 12:35:59,389 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 12:35:59,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:59,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 12:35:59,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-11-09 12:35:59,391 INFO L87 Difference]: Start difference. First operand 645 states and 1834 transitions. Second operand 9 states. [2020-11-09 12:35:59,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:35:59,723 INFO L93 Difference]: Finished difference Result 991 states and 2662 transitions. [2020-11-09 12:35:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-09 12:35:59,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-11-09 12:35:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:35:59,727 INFO L225 Difference]: With dead ends: 991 [2020-11-09 12:35:59,727 INFO L226 Difference]: Without dead ends: 721 [2020-11-09 12:35:59,727 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-11-09 12:35:59,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2020-11-09 12:35:59,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 641. [2020-11-09 12:35:59,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2020-11-09 12:35:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1708 transitions. [2020-11-09 12:35:59,750 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1708 transitions. Word has length 21 [2020-11-09 12:35:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:35:59,750 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 1708 transitions. [2020-11-09 12:35:59,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 12:35:59,751 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1708 transitions. [2020-11-09 12:35:59,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-09 12:35:59,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:35:59,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:35:59,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 12:35:59,753 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:35:59,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:35:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1821973568, now seen corresponding path program 2 times [2020-11-09 12:35:59,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:35:59,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053606791] [2020-11-09 12:35:59,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:35:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:35:59,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:35:59,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053606791] [2020-11-09 12:35:59,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:35:59,909 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:35:59,909 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174352521] [2020-11-09 12:35:59,910 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 12:35:59,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:35:59,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 12:35:59,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:35:59,911 INFO L87 Difference]: Start difference. First operand 641 states and 1708 transitions. Second operand 7 states. [2020-11-09 12:36:00,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:36:00,035 INFO L93 Difference]: Finished difference Result 616 states and 1657 transitions. [2020-11-09 12:36:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 12:36:00,037 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-11-09 12:36:00,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:36:00,039 INFO L225 Difference]: With dead ends: 616 [2020-11-09 12:36:00,039 INFO L226 Difference]: Without dead ends: 415 [2020-11-09 12:36:00,039 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:36:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2020-11-09 12:36:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2020-11-09 12:36:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2020-11-09 12:36:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 1095 transitions. [2020-11-09 12:36:00,052 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 1095 transitions. Word has length 21 [2020-11-09 12:36:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:36:00,053 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 1095 transitions. [2020-11-09 12:36:00,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 12:36:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 1095 transitions. [2020-11-09 12:36:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 12:36:00,056 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:36:00,056 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:36:00,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 12:36:00,056 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:36:00,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:36:00,057 INFO L82 PathProgramCache]: Analyzing trace with hash -266700646, now seen corresponding path program 1 times [2020-11-09 12:36:00,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:36:00,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946464793] [2020-11-09 12:36:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:36:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:36:00,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:36:00,190 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946464793] [2020-11-09 12:36:00,190 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:36:00,190 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 12:36:00,191 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056342958] [2020-11-09 12:36:00,191 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 12:36:00,191 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:36:00,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 12:36:00,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 12:36:00,192 INFO L87 Difference]: Start difference. First operand 415 states and 1095 transitions. Second operand 6 states. [2020-11-09 12:36:00,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:36:00,304 INFO L93 Difference]: Finished difference Result 497 states and 1259 transitions. [2020-11-09 12:36:00,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:36:00,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-09 12:36:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:36:00,307 INFO L225 Difference]: With dead ends: 497 [2020-11-09 12:36:00,307 INFO L226 Difference]: Without dead ends: 232 [2020-11-09 12:36:00,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2020-11-09 12:36:00,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2020-11-09 12:36:00,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2020-11-09 12:36:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2020-11-09 12:36:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 561 transitions. [2020-11-09 12:36:00,314 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 561 transitions. Word has length 25 [2020-11-09 12:36:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:36:00,314 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 561 transitions. [2020-11-09 12:36:00,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 12:36:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 561 transitions. [2020-11-09 12:36:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 12:36:00,316 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:36:00,316 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:36:00,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 12:36:00,316 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:36:00,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:36:00,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1627508946, now seen corresponding path program 2 times [2020-11-09 12:36:00,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:36:00,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982862072] [2020-11-09 12:36:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:36:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 12:36:00,783 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 24 [2020-11-09 12:36:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 12:36:00,953 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982862072] [2020-11-09 12:36:00,953 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 12:36:00,953 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 12:36:00,954 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71937356] [2020-11-09 12:36:00,954 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 12:36:00,954 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 12:36:00,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 12:36:00,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:36:00,955 INFO L87 Difference]: Start difference. First operand 232 states and 561 transitions. Second operand 8 states. [2020-11-09 12:36:01,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 12:36:01,113 INFO L93 Difference]: Finished difference Result 294 states and 705 transitions. [2020-11-09 12:36:01,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 12:36:01,114 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2020-11-09 12:36:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 12:36:01,115 INFO L225 Difference]: With dead ends: 294 [2020-11-09 12:36:01,116 INFO L226 Difference]: Without dead ends: 192 [2020-11-09 12:36:01,118 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-09 12:36:01,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2020-11-09 12:36:01,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2020-11-09 12:36:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2020-11-09 12:36:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 433 transitions. [2020-11-09 12:36:01,128 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 433 transitions. Word has length 25 [2020-11-09 12:36:01,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 12:36:01,128 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 433 transitions. [2020-11-09 12:36:01,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 12:36:01,129 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 433 transitions. [2020-11-09 12:36:01,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-09 12:36:01,129 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 12:36:01,130 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 12:36:01,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 12:36:01,130 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 12:36:01,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 12:36:01,130 INFO L82 PathProgramCache]: Analyzing trace with hash 91777140, now seen corresponding path program 3 times [2020-11-09 12:36:01,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 12:36:01,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901555772] [2020-11-09 12:36:01,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 12:36:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:36:01,195 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:36:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 12:36:01,276 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 12:36:01,363 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 12:36:01,366 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 12:36:01,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 12:36:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 12:36:01 BasicIcfg [2020-11-09 12:36:01,514 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 12:36:01,515 INFO L168 Benchmark]: Toolchain (without parser) took 45361.84 ms. Allocated memory was 151.0 MB in the beginning and 268.4 MB in the end (delta: 117.4 MB). Free memory was 125.1 MB in the beginning and 213.6 MB in the end (delta: -88.5 MB). Peak memory consumption was 170.4 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,516 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 151.0 MB. Free memory is still 125.8 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 12:36:01,516 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.49 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 120.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,517 INFO L168 Benchmark]: Boogie Procedure Inliner took 100.06 ms. Allocated memory is still 151.0 MB. Free memory was 120.5 MB in the beginning and 117.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,517 INFO L168 Benchmark]: Boogie Preprocessor took 68.35 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 115.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,518 INFO L168 Benchmark]: RCFGBuilder took 2424.81 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 115.3 MB in the beginning and 96.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,518 INFO L168 Benchmark]: TraceAbstraction took 42045.89 ms. Allocated memory was 181.4 MB in the beginning and 268.4 MB in the end (delta: 87.0 MB). Free memory was 95.9 MB in the beginning and 214.1 MB in the end (delta: -118.2 MB). Peak memory consumption was 110.4 MB. Max. memory is 8.0 GB. [2020-11-09 12:36:01,521 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.23 ms. Allocated memory is still 151.0 MB. Free memory is still 125.8 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 710.49 ms. Allocated memory is still 151.0 MB. Free memory was 124.5 MB in the beginning and 120.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 27.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 100.06 ms. Allocated memory is still 151.0 MB. Free memory was 120.5 MB in the beginning and 117.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 68.35 ms. Allocated memory is still 151.0 MB. Free memory was 117.9 MB in the beginning and 115.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 2424.81 ms. Allocated memory was 151.0 MB in the beginning and 181.4 MB in the end (delta: 30.4 MB). Free memory was 115.3 MB in the beginning and 96.5 MB in the end (delta: 18.8 MB). Peak memory consumption was 76.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 42045.89 ms. Allocated memory was 181.4 MB in the beginning and 268.4 MB in the end (delta: 87.0 MB). Free memory was 95.9 MB in the beginning and 214.1 MB in the end (delta: -118.2 MB). Peak memory consumption was 110.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1749 VarBasedMoverChecksPositive, 68 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 54 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 198 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 35.2s, 127 PlacesBefore, 44 PlacesAfterwards, 117 TransitionsBefore, 31 TransitionsAfterwards, 2622 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 6769 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1461; [L837] FCALL, FORK 0 pthread_create(&t1461, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1462; [L839] FCALL, FORK 0 pthread_create(&t1462, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1463; [L841] FCALL, FORK 0 pthread_create(&t1463, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] 0 pthread_t t1464; [L843] FCALL, FORK 0 pthread_create(&t1464, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L778] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L814] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L815] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L816] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L817] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L818] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L818] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L821] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 4 return 0; [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L784] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L784] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L785] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L787] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L788] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L845] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L852] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L852] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L853] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L853] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L856] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L857] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L858] 0 z$flush_delayed = weak$$choice2 [L859] 0 z$mem_tmp = z [L860] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L860] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L861] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L861] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L862] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L862] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L863] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L863] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L864] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L865] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L865] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L866] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L866] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 0) [L868] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L868] 0 z = z$flush_delayed ? z$mem_tmp : z [L869] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix055_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 115 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 41.7s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 35.4s, HoareTripleCheckerStatistics: 456 SDtfs, 543 SDslu, 956 SDs, 0 SdLazy, 459 SolverSat, 108 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2602occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 15 MinimizatonAttempts, 116 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 269 NumberOfCodeBlocks, 269 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 229 ConstructedInterpolants, 0 QuantifiedInterpolants, 36072 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...