/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:48:41,079 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:48:41,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:48:41,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:48:41,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:48:41,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:48:41,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:48:41,100 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:48:41,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:48:41,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:48:41,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:48:41,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:48:41,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:48:41,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:48:41,107 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:48:41,108 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:48:41,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:48:41,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:48:41,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:48:41,114 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:48:41,115 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:48:41,116 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:48:41,117 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:48:41,118 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:48:41,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:48:41,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:48:41,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:48:41,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:48:41,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:48:41,124 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:48:41,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:48:41,125 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:48:41,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:48:41,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:48:41,127 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:48:41,127 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:48:41,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:48:41,128 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:48:41,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:48:41,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:48:41,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:48:41,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:48:41,147 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:48:41,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:48:41,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:48:41,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:48:41,149 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:48:41,149 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:48:41,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:48:41,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:48:41,151 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:48:41,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:48:41,151 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:48:41,151 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:48:41,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:48:41,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:48:41,152 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:48:41,152 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:48:41,152 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:48:41,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:48:41,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:48:41,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:48:41,153 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:48:41,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:48:41,154 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:48:41,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:48:41,154 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:48:41,154 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:48:41,430 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:48:41,442 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:48:41,446 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:48:41,447 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:48:41,448 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:48:41,449 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-27 17:48:41,510 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9949760e9/c36adcf4afa34cdd9fa3ab2eaa32a370/FLAG49c83e64b [2019-12-27 17:48:42,033 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:48:42,034 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_power.oepc.i [2019-12-27 17:48:42,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9949760e9/c36adcf4afa34cdd9fa3ab2eaa32a370/FLAG49c83e64b [2019-12-27 17:48:42,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9949760e9/c36adcf4afa34cdd9fa3ab2eaa32a370 [2019-12-27 17:48:42,368 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:48:42,370 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:48:42,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:48:42,371 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:48:42,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:48:42,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:48:42" (1/1) ... [2019-12-27 17:48:42,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ad6db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:42, skipping insertion in model container [2019-12-27 17:48:42,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:48:42" (1/1) ... [2019-12-27 17:48:42,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:48:42,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:48:42,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:48:42,957 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:48:43,025 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:48:43,095 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:48:43,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43 WrapperNode [2019-12-27 17:48:43,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:48:43,097 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:48:43,097 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:48:43,097 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:48:43,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:48:43,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:48:43,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:48:43,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:48:43,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (1/1) ... [2019-12-27 17:48:43,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:48:43,226 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:48:43,226 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:48:43,226 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:48:43,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (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 [2019-12-27 17:48:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:48:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:48:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:48:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:48:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:48:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:48:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:48:43,282 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:48:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:48:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:48:43,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:48:43,285 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:48:43,985 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:48:43,986 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:48:43,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:48:43 BoogieIcfgContainer [2019-12-27 17:48:43,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:48:43,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:48:43,989 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:48:43,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:48:43,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:48:42" (1/3) ... [2019-12-27 17:48:43,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63006c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:48:43, skipping insertion in model container [2019-12-27 17:48:43,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:48:43" (2/3) ... [2019-12-27 17:48:43,994 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63006c4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:48:43, skipping insertion in model container [2019-12-27 17:48:43,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:48:43" (3/3) ... [2019-12-27 17:48:43,996 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.oepc.i [2019-12-27 17:48:44,008 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:48:44,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:48:44,017 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:48:44,018 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:48:44,057 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,058 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,058 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,065 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,066 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,068 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,069 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,070 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,070 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,073 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,074 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,079 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,080 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,081 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,082 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,083 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,084 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,085 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,086 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,087 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,088 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,089 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,105 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,109 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,110 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,112 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,113 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,120 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,121 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,121 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,122 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:48:44,150 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:48:44,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:48:44,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:48:44,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:48:44,167 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:48:44,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:48:44,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:48:44,168 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:48:44,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:48:44,185 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:48:44,187 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:48:44,276 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:48:44,276 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:48:44,291 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:48:44,309 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:48:44,354 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:48:44,354 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:48:44,361 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 341 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:48:44,377 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:48:44,379 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:48:49,243 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:48:49,352 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:48:49,711 INFO L206 etLargeBlockEncoding]: Checked pairs total: 76691 [2019-12-27 17:48:49,711 INFO L214 etLargeBlockEncoding]: Total number of compositions: 108 [2019-12-27 17:48:49,716 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 90 transitions [2019-12-27 17:48:50,314 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 9438 states. [2019-12-27 17:48:50,316 INFO L276 IsEmpty]: Start isEmpty. Operand 9438 states. [2019-12-27 17:48:50,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:48:50,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:50,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:48:50,324 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:50,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:50,331 INFO L82 PathProgramCache]: Analyzing trace with hash 790297, now seen corresponding path program 1 times [2019-12-27 17:48:50,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:50,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206802513] [2019-12-27 17:48:50,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:50,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:50,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206802513] [2019-12-27 17:48:50,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:50,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:48:50,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [262823592] [2019-12-27 17:48:50,562 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:50,574 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:50,588 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:48:50,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:50,593 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:50,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:48:50,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:50,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:48:50,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:50,611 INFO L87 Difference]: Start difference. First operand 9438 states. Second operand 3 states. [2019-12-27 17:48:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:50,910 INFO L93 Difference]: Finished difference Result 9266 states and 29920 transitions. [2019-12-27 17:48:50,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:48:50,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:48:50,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:51,062 INFO L225 Difference]: With dead ends: 9266 [2019-12-27 17:48:51,062 INFO L226 Difference]: Without dead ends: 8258 [2019-12-27 17:48:51,064 INFO L631 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 [2019-12-27 17:48:51,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8258 states. [2019-12-27 17:48:51,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8258 to 8258. [2019-12-27 17:48:51,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8258 states. [2019-12-27 17:48:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8258 states to 8258 states and 26572 transitions. [2019-12-27 17:48:51,605 INFO L78 Accepts]: Start accepts. Automaton has 8258 states and 26572 transitions. Word has length 3 [2019-12-27 17:48:51,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:51,605 INFO L462 AbstractCegarLoop]: Abstraction has 8258 states and 26572 transitions. [2019-12-27 17:48:51,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:48:51,605 INFO L276 IsEmpty]: Start isEmpty. Operand 8258 states and 26572 transitions. [2019-12-27 17:48:51,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:48:51,610 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:51,610 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:51,610 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:51,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:51,611 INFO L82 PathProgramCache]: Analyzing trace with hash 316025548, now seen corresponding path program 1 times [2019-12-27 17:48:51,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:51,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837250265] [2019-12-27 17:48:51,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:51,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:51,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837250265] [2019-12-27 17:48:51,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:51,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:48:51,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1011910386] [2019-12-27 17:48:51,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:51,724 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:51,728 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:48:51,728 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:51,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:51,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:48:51,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:51,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:48:51,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:48:51,731 INFO L87 Difference]: Start difference. First operand 8258 states and 26572 transitions. Second operand 4 states. [2019-12-27 17:48:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:52,206 INFO L93 Difference]: Finished difference Result 12603 states and 38772 transitions. [2019-12-27 17:48:52,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:48:52,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:48:52,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:52,294 INFO L225 Difference]: With dead ends: 12603 [2019-12-27 17:48:52,294 INFO L226 Difference]: Without dead ends: 12589 [2019-12-27 17:48:52,296 INFO L631 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 [2019-12-27 17:48:52,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12589 states. [2019-12-27 17:48:52,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12589 to 11299. [2019-12-27 17:48:52,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11299 states. [2019-12-27 17:48:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11299 states to 11299 states and 35365 transitions. [2019-12-27 17:48:53,526 INFO L78 Accepts]: Start accepts. Automaton has 11299 states and 35365 transitions. Word has length 11 [2019-12-27 17:48:53,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:53,526 INFO L462 AbstractCegarLoop]: Abstraction has 11299 states and 35365 transitions. [2019-12-27 17:48:53,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:48:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand 11299 states and 35365 transitions. [2019-12-27 17:48:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:48:53,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:53,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:53,537 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:53,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:53,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1209477957, now seen corresponding path program 1 times [2019-12-27 17:48:53,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:53,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72537638] [2019-12-27 17:48:53,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:53,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:53,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72537638] [2019-12-27 17:48:53,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:53,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:48:53,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2037787397] [2019-12-27 17:48:53,668 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:53,670 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:53,673 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:48:53,673 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:53,674 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:53,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:48:53,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:53,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:48:53,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:48:53,675 INFO L87 Difference]: Start difference. First operand 11299 states and 35365 transitions. Second operand 4 states. [2019-12-27 17:48:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:53,924 INFO L93 Difference]: Finished difference Result 13736 states and 42816 transitions. [2019-12-27 17:48:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:48:53,925 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 17:48:53,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:53,975 INFO L225 Difference]: With dead ends: 13736 [2019-12-27 17:48:53,975 INFO L226 Difference]: Without dead ends: 13736 [2019-12-27 17:48:53,975 INFO L631 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 [2019-12-27 17:48:54,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13736 states. [2019-12-27 17:48:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13736 to 12234. [2019-12-27 17:48:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12234 states. [2019-12-27 17:48:54,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12234 states to 12234 states and 38359 transitions. [2019-12-27 17:48:54,519 INFO L78 Accepts]: Start accepts. Automaton has 12234 states and 38359 transitions. Word has length 14 [2019-12-27 17:48:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:54,520 INFO L462 AbstractCegarLoop]: Abstraction has 12234 states and 38359 transitions. [2019-12-27 17:48:54,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:48:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 12234 states and 38359 transitions. [2019-12-27 17:48:54,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:48:54,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:54,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:54,525 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:54,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:54,525 INFO L82 PathProgramCache]: Analyzing trace with hash -572907870, now seen corresponding path program 1 times [2019-12-27 17:48:54,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:54,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174444850] [2019-12-27 17:48:54,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:54,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174444850] [2019-12-27 17:48:54,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:54,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:48:54,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [190475666] [2019-12-27 17:48:54,609 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:54,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:54,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:48:54,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:54,614 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:54,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:48:54,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:54,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:48:54,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:54,615 INFO L87 Difference]: Start difference. First operand 12234 states and 38359 transitions. Second operand 3 states. [2019-12-27 17:48:54,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:54,676 INFO L93 Difference]: Finished difference Result 12209 states and 38285 transitions. [2019-12-27 17:48:54,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:48:54,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:48:54,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:54,717 INFO L225 Difference]: With dead ends: 12209 [2019-12-27 17:48:54,718 INFO L226 Difference]: Without dead ends: 12209 [2019-12-27 17:48:54,718 INFO L631 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 [2019-12-27 17:48:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12209 states. [2019-12-27 17:48:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12209 to 12209. [2019-12-27 17:48:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12209 states. [2019-12-27 17:48:55,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12209 states to 12209 states and 38285 transitions. [2019-12-27 17:48:55,099 INFO L78 Accepts]: Start accepts. Automaton has 12209 states and 38285 transitions. Word has length 16 [2019-12-27 17:48:55,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:55,100 INFO L462 AbstractCegarLoop]: Abstraction has 12209 states and 38285 transitions. [2019-12-27 17:48:55,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:48:55,100 INFO L276 IsEmpty]: Start isEmpty. Operand 12209 states and 38285 transitions. [2019-12-27 17:48:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:48:55,104 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:55,105 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:55,105 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:55,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:55,105 INFO L82 PathProgramCache]: Analyzing trace with hash -574911552, now seen corresponding path program 1 times [2019-12-27 17:48:55,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:55,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435742702] [2019-12-27 17:48:55,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:55,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435742702] [2019-12-27 17:48:55,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:55,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:48:55,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1911157431] [2019-12-27 17:48:55,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:55,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:55,181 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:48:55,181 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:55,185 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:48:55,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:48:55,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:55,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:48:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:48:55,187 INFO L87 Difference]: Start difference. First operand 12209 states and 38285 transitions. Second operand 4 states. [2019-12-27 17:48:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:55,225 INFO L93 Difference]: Finished difference Result 2335 states and 5845 transitions. [2019-12-27 17:48:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:48:55,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 17:48:55,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:55,231 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 17:48:55,231 INFO L226 Difference]: Without dead ends: 1651 [2019-12-27 17:48:55,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:48:55,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1651 states. [2019-12-27 17:48:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1651 to 1635. [2019-12-27 17:48:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2019-12-27 17:48:55,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 3657 transitions. [2019-12-27 17:48:55,262 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 3657 transitions. Word has length 17 [2019-12-27 17:48:55,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:55,263 INFO L462 AbstractCegarLoop]: Abstraction has 1635 states and 3657 transitions. [2019-12-27 17:48:55,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:48:55,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 3657 transitions. [2019-12-27 17:48:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:48:55,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:55,265 INFO L411 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] [2019-12-27 17:48:55,266 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:55,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:55,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1133745070, now seen corresponding path program 1 times [2019-12-27 17:48:55,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:55,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814326141] [2019-12-27 17:48:55,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:55,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:55,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814326141] [2019-12-27 17:48:55,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:55,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:48:55,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [144960243] [2019-12-27 17:48:55,352 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:55,357 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:55,363 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 17:48:55,364 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:55,364 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:55,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:48:55,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:55,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:48:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:48:55,365 INFO L87 Difference]: Start difference. First operand 1635 states and 3657 transitions. Second operand 6 states. [2019-12-27 17:48:56,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:56,022 INFO L93 Difference]: Finished difference Result 4528 states and 9998 transitions. [2019-12-27 17:48:56,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:48:56,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 17:48:56,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:56,037 INFO L225 Difference]: With dead ends: 4528 [2019-12-27 17:48:56,037 INFO L226 Difference]: Without dead ends: 4493 [2019-12-27 17:48:56,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:48:56,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-12-27 17:48:56,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2195. [2019-12-27 17:48:56,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2019-12-27 17:48:56,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 4961 transitions. [2019-12-27 17:48:56,093 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 4961 transitions. Word has length 25 [2019-12-27 17:48:56,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:56,094 INFO L462 AbstractCegarLoop]: Abstraction has 2195 states and 4961 transitions. [2019-12-27 17:48:56,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:48:56,094 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 4961 transitions. [2019-12-27 17:48:56,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 17:48:56,097 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:56,097 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:56,097 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:56,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:56,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1963896570, now seen corresponding path program 1 times [2019-12-27 17:48:56,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:56,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848437632] [2019-12-27 17:48:56,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:56,172 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848437632] [2019-12-27 17:48:56,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:56,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:48:56,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [82056973] [2019-12-27 17:48:56,173 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:56,178 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:56,185 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 26 transitions. [2019-12-27 17:48:56,186 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:56,186 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:48:56,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:48:56,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:56,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:48:56,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:48:56,187 INFO L87 Difference]: Start difference. First operand 2195 states and 4961 transitions. Second operand 6 states. [2019-12-27 17:48:56,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:56,751 INFO L93 Difference]: Finished difference Result 4412 states and 9625 transitions. [2019-12-27 17:48:56,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:48:56,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-12-27 17:48:56,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:56,758 INFO L225 Difference]: With dead ends: 4412 [2019-12-27 17:48:56,759 INFO L226 Difference]: Without dead ends: 4383 [2019-12-27 17:48:56,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:48:56,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4383 states. [2019-12-27 17:48:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4383 to 2070. [2019-12-27 17:48:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-27 17:48:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4705 transitions. [2019-12-27 17:48:56,813 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4705 transitions. Word has length 26 [2019-12-27 17:48:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:56,813 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4705 transitions. [2019-12-27 17:48:56,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:48:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4705 transitions. [2019-12-27 17:48:56,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:48:56,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:56,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:56,817 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:56,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:56,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1827812304, now seen corresponding path program 1 times [2019-12-27 17:48:56,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:56,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504375462] [2019-12-27 17:48:56,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:56,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:56,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504375462] [2019-12-27 17:48:56,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:56,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:48:56,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [691389165] [2019-12-27 17:48:56,872 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:56,881 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:56,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 17:48:56,898 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:56,900 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:48:56,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:48:56,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:48:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:56,902 INFO L87 Difference]: Start difference. First operand 2070 states and 4705 transitions. Second operand 3 states. [2019-12-27 17:48:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:56,928 INFO L93 Difference]: Finished difference Result 1991 states and 4456 transitions. [2019-12-27 17:48:56,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:48:56,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:48:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:56,933 INFO L225 Difference]: With dead ends: 1991 [2019-12-27 17:48:56,933 INFO L226 Difference]: Without dead ends: 1991 [2019-12-27 17:48:56,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-12-27 17:48:56,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1854. [2019-12-27 17:48:56,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-12-27 17:48:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 4184 transitions. [2019-12-27 17:48:56,982 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 4184 transitions. Word has length 27 [2019-12-27 17:48:56,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:56,983 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 4184 transitions. [2019-12-27 17:48:56,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:48:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 4184 transitions. [2019-12-27 17:48:56,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:48:56,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:56,987 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:56,987 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:56,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1234551102, now seen corresponding path program 1 times [2019-12-27 17:48:56,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:56,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535301880] [2019-12-27 17:48:56,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:57,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535301880] [2019-12-27 17:48:57,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:57,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:48:57,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1131001791] [2019-12-27 17:48:57,074 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:57,082 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:57,100 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 17:48:57,100 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:57,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:48:57,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:48:57,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:57,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:48:57,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:48:57,169 INFO L87 Difference]: Start difference. First operand 1854 states and 4184 transitions. Second operand 6 states. [2019-12-27 17:48:57,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:57,243 INFO L93 Difference]: Finished difference Result 968 states and 2169 transitions. [2019-12-27 17:48:57,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:48:57,244 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:48:57,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:57,246 INFO L225 Difference]: With dead ends: 968 [2019-12-27 17:48:57,246 INFO L226 Difference]: Without dead ends: 886 [2019-12-27 17:48:57,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:48:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2019-12-27 17:48:57,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 886. [2019-12-27 17:48:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2019-12-27 17:48:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1985 transitions. [2019-12-27 17:48:57,269 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1985 transitions. Word has length 28 [2019-12-27 17:48:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:57,270 INFO L462 AbstractCegarLoop]: Abstraction has 886 states and 1985 transitions. [2019-12-27 17:48:57,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:48:57,271 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1985 transitions. [2019-12-27 17:48:57,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:48:57,278 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:57,278 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:57,278 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash 551725022, now seen corresponding path program 1 times [2019-12-27 17:48:57,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:57,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762012913] [2019-12-27 17:48:57,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:57,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:57,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762012913] [2019-12-27 17:48:57,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:57,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:48:57,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2057535163] [2019-12-27 17:48:57,429 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:57,477 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:57,535 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 144 transitions. [2019-12-27 17:48:57,535 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:57,553 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:48:57,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:48:57,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:48:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:48:57,554 INFO L87 Difference]: Start difference. First operand 886 states and 1985 transitions. Second operand 7 states. [2019-12-27 17:48:57,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:57,850 INFO L93 Difference]: Finished difference Result 2885 states and 6293 transitions. [2019-12-27 17:48:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 17:48:57,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 17:48:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:57,854 INFO L225 Difference]: With dead ends: 2885 [2019-12-27 17:48:57,854 INFO L226 Difference]: Without dead ends: 1947 [2019-12-27 17:48:57,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:48:57,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1947 states. [2019-12-27 17:48:57,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1947 to 1014. [2019-12-27 17:48:57,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-12-27 17:48:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 2260 transitions. [2019-12-27 17:48:57,879 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 2260 transitions. Word has length 52 [2019-12-27 17:48:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:57,880 INFO L462 AbstractCegarLoop]: Abstraction has 1014 states and 2260 transitions. [2019-12-27 17:48:57,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:48:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 2260 transitions. [2019-12-27 17:48:57,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:48:57,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:57,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:57,883 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:57,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:57,884 INFO L82 PathProgramCache]: Analyzing trace with hash -744775922, now seen corresponding path program 2 times [2019-12-27 17:48:57,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:57,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055015742] [2019-12-27 17:48:57,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:48:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:48:57,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055015742] [2019-12-27 17:48:57,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:48:57,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:48:57,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1697062965] [2019-12-27 17:48:57,967 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:48:57,982 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:48:58,049 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 146 transitions. [2019-12-27 17:48:58,050 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:48:58,051 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:48:58,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:48:58,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:48:58,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:48:58,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:58,052 INFO L87 Difference]: Start difference. First operand 1014 states and 2260 transitions. Second operand 3 states. [2019-12-27 17:48:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:48:58,103 INFO L93 Difference]: Finished difference Result 1280 states and 2822 transitions. [2019-12-27 17:48:58,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:48:58,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 17:48:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:48:58,105 INFO L225 Difference]: With dead ends: 1280 [2019-12-27 17:48:58,105 INFO L226 Difference]: Without dead ends: 1280 [2019-12-27 17:48:58,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:48:58,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2019-12-27 17:48:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 942. [2019-12-27 17:48:58,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 17:48:58,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2088 transitions. [2019-12-27 17:48:58,123 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2088 transitions. Word has length 52 [2019-12-27 17:48:58,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:48:58,124 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 2088 transitions. [2019-12-27 17:48:58,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:48:58,124 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2088 transitions. [2019-12-27 17:48:58,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 17:48:58,126 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:48:58,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:48:58,127 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:48:58,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:48:58,127 INFO L82 PathProgramCache]: Analyzing trace with hash 238171223, now seen corresponding path program 1 times [2019-12-27 17:48:58,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:48:58,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945613580] [2019-12-27 17:48:58,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:48:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:48:58,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:48:58,254 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:48:58,254 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:48:58,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] ULTIMATE.startENTRY-->L797: Formula: (let ((.cse0 (store |v_#valid_47| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= v_~x$r_buff1_thd1~0_165 0) (= 0 v_~x~0_148) (= v_~x$r_buff0_thd0~0_133 0) (= v_~x$r_buff0_thd1~0_227 0) (= v_~weak$$choice2~0_120 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_40 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1705~0.base_24|) (= 0 |v_ULTIMATE.start_main_~#t1705~0.offset_18|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_45| (store .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24| 1)) (= 0 v_~__unbuffered_cnt~0_63) (= v_~main$tmp_guard1~0_41 0) (= v_~y~0_147 0) (= 0 |v_#NULL.base_6|) (= v_~x$flush_delayed~0_31 0) (= 0 v_~x$read_delayed~0_7) (= v_~x$mem_tmp~0_24 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1705~0.base_24|)) (= 0 v_~x$w_buff1_used~0_507) (= 0 v_~weak$$choice0~0_22) (= v_~x$r_buff1_thd0~0_183 0) (= 0 v_~x$w_buff1~0_317) (= 0 v_~x$w_buff0~0_542) (= 0 v_~x$r_buff0_thd2~0_359) (= 0 v_~x$read_delayed_var~0.offset_7) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| 4) |v_#length_13|) (= 0 v_~x$w_buff0_used~0_792) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1705~0.base_24|) |v_ULTIMATE.start_main_~#t1705~0.offset_18| 0)) |v_#memory_int_13|) (= 0 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~x$r_buff1_thd2~0_331) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_542, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_227, ~x$flush_delayed~0=v_~x$flush_delayed~0_31, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_16|, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_165, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ~x$mem_tmp~0=v_~x$mem_tmp~0_24, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_28|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_69|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_34|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, #length=|v_#length_13|, ~y~0=v_~y~0_147, ULTIMATE.start_main_~#t1705~0.offset=|v_ULTIMATE.start_main_~#t1705~0.offset_18|, ULTIMATE.start_main_~#t1705~0.base=|v_ULTIMATE.start_main_~#t1705~0.base_24|, ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_14|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_133, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_40, ~x$w_buff1~0=v_~x$w_buff1~0_317, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_507, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_331, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_183, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_359, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_792, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_120, ~x~0=v_~x~0_148, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1706~0.base, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p1_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t1705~0.offset, ULTIMATE.start_main_~#t1705~0.base, ULTIMATE.start_main_~#t1706~0.offset, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 17:48:58,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L4-->L738: Formula: (and (= 1 v_~x$r_buff0_thd1~0_40) (= v_~x$r_buff1_thd1~0_23 v_~x$r_buff0_thd1~0_41) (= v_~x$r_buff1_thd2~0_64 v_~x$r_buff0_thd2~0_110) (= v_~y~0_18 1) (not (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74 0)) (= v_~x$r_buff1_thd0~0_37 v_~x$r_buff0_thd0~0_53)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_53, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_40, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_74, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_64, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_23, ~y~0=v_~y~0_18, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_110, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_37} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:48:58,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-1-->L799: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t1706~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t1706~0.base_12| 0)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12| 1) |v_#valid_27|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1706~0.base_12|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1706~0.base_12|) |v_ULTIMATE.start_main_~#t1706~0.offset_10| 1)) |v_#memory_int_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1706~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1706~0.offset=|v_ULTIMATE.start_main_~#t1706~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t1706~0.base=|v_ULTIMATE.start_main_~#t1706~0.base_12|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1706~0.offset, ULTIMATE.start_main_~#t1706~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 17:48:58,265 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In768370385 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In768370385 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In768370385 |P0Thread1of1ForFork0_#t~ite5_Out768370385|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out768370385|) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In768370385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In768370385} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out768370385|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In768370385, ~x$w_buff0_used~0=~x$w_buff0_used~0_In768370385} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:48:58,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L763-->L763-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In919617644 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_In919617644| |P1Thread1of1ForFork1_#t~ite14_Out919617644|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite15_Out919617644| ~x$w_buff0~0_In919617644)) (and (= |P1Thread1of1ForFork1_#t~ite15_Out919617644| |P1Thread1of1ForFork1_#t~ite14_Out919617644|) .cse0 (= ~x$w_buff0~0_In919617644 |P1Thread1of1ForFork1_#t~ite14_Out919617644|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In919617644 256)))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In919617644 256))) (and .cse1 (= (mod ~x$r_buff1_thd2~0_In919617644 256) 0)) (= (mod ~x$w_buff0_used~0_In919617644 256) 0)))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In919617644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In919617644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In919617644, ~weak$$choice2~0=~weak$$choice2~0_In919617644, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In919617644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In919617644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In919617644} OutVars{~x$w_buff0~0=~x$w_buff0~0_In919617644, ~x$w_buff1_used~0=~x$w_buff1_used~0_In919617644, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In919617644, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out919617644|, ~weak$$choice2~0=~weak$$choice2~0_In919617644, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In919617644, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out919617644|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In919617644} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 17:48:58,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L740-->L740-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In780062997 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In780062997 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In780062997 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In780062997 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out780062997|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In780062997 |P0Thread1of1ForFork0_#t~ite6_Out780062997|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In780062997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In780062997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In780062997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780062997} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out780062997|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In780062997, ~x$w_buff1_used~0=~x$w_buff1_used~0_In780062997, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In780062997, ~x$w_buff0_used~0=~x$w_buff0_used~0_In780062997} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:48:58,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In1406914138 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In1406914138 256) 0))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd1~0_Out1406914138 0)) (and (= ~x$r_buff0_thd1~0_Out1406914138 ~x$r_buff0_thd1~0_In1406914138) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1406914138, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406914138} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out1406914138, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1406914138|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406914138} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 17:48:58,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In-1871286102 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1871286102 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1871286102 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1871286102 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1871286102| ~x$r_buff1_thd1~0_In-1871286102) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1871286102|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1871286102, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1871286102, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1871286102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1871286102} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1871286102, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1871286102|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1871286102, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1871286102, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1871286102} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:48:58,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_128 |v_P0Thread1of1ForFork0_#t~ite8_32|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_31|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_128} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 17:48:58,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In542041791 256)))) (or (and .cse0 (= ~x$w_buff1~0_In542041791 |P1Thread1of1ForFork1_#t~ite17_Out542041791|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In542041791 256)))) (or (and .cse1 (= (mod ~x$r_buff1_thd2~0_In542041791 256) 0)) (= 0 (mod ~x$w_buff0_used~0_In542041791 256)) (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In542041791 256))))) (= |P1Thread1of1ForFork1_#t~ite18_Out542041791| |P1Thread1of1ForFork1_#t~ite17_Out542041791|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In542041791| |P1Thread1of1ForFork1_#t~ite17_Out542041791|) (= ~x$w_buff1~0_In542041791 |P1Thread1of1ForFork1_#t~ite18_Out542041791|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In542041791, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542041791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542041791, ~weak$$choice2~0=~weak$$choice2~0_In542041791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542041791, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In542041791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542041791} OutVars{P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out542041791|, ~x$w_buff1~0=~x$w_buff1~0_In542041791, ~x$w_buff1_used~0=~x$w_buff1_used~0_In542041791, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In542041791, ~weak$$choice2~0=~weak$$choice2~0_In542041791, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In542041791, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out542041791|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In542041791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 17:48:58,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1138488694 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out1138488694| |P1Thread1of1ForFork1_#t~ite21_Out1138488694|) (= |P1Thread1of1ForFork1_#t~ite20_Out1138488694| ~x$w_buff0_used~0_In1138488694) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1138488694 256) 0))) (or (and (= (mod ~x$r_buff1_thd2~0_In1138488694 256) 0) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1138488694 256)) .cse1) (= (mod ~x$w_buff0_used~0_In1138488694 256) 0)))) (and (= ~x$w_buff0_used~0_In1138488694 |P1Thread1of1ForFork1_#t~ite21_Out1138488694|) (= |P1Thread1of1ForFork1_#t~ite20_In1138488694| |P1Thread1of1ForFork1_#t~ite20_Out1138488694|) (not .cse0)))) InVars {P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In1138488694|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1138488694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1138488694, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1138488694, ~weak$$choice2~0=~weak$$choice2~0_In1138488694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1138488694} OutVars{P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out1138488694|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1138488694, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1138488694, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out1138488694|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1138488694, ~weak$$choice2~0=~weak$$choice2~0_In1138488694, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1138488694} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:48:58,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~x$r_buff0_thd2~0_135 v_~x$r_buff0_thd2~0_134)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_27, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_14|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_11|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 17:48:58,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In235252905 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In235252905| |P1Thread1of1ForFork1_#t~ite29_Out235252905|) (= |P1Thread1of1ForFork1_#t~ite30_Out235252905| ~x$r_buff1_thd2~0_In235252905) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out235252905| |P1Thread1of1ForFork1_#t~ite30_Out235252905|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In235252905 256)))) (or (and (= 0 (mod ~x$w_buff1_used~0_In235252905 256)) .cse1) (and (= 0 (mod ~x$r_buff1_thd2~0_In235252905 256)) .cse1) (= (mod ~x$w_buff0_used~0_In235252905 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out235252905| ~x$r_buff1_thd2~0_In235252905) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In235252905|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In235252905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In235252905, ~weak$$choice2~0=~weak$$choice2~0_In235252905, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In235252905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In235252905} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out235252905|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out235252905|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In235252905, ~x$w_buff1_used~0=~x$w_buff1_used~0_In235252905, ~weak$$choice2~0=~weak$$choice2~0_In235252905, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In235252905, ~x$w_buff0_used~0=~x$w_buff0_used~0_In235252905} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:48:58,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L770-->L774: Formula: (and (= 0 v_~x$flush_delayed~0_7) (not (= 0 (mod v_~x$flush_delayed~0_8 256))) (= v_~x$mem_tmp~0_5 v_~x~0_14)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_7, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 17:48:58,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L774-2-->L774-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd2~0_In-766187171 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-766187171 256)))) (or (and (= ~x$w_buff1~0_In-766187171 |P1Thread1of1ForFork1_#t~ite32_Out-766187171|) (not .cse0) (not .cse1)) (and (= ~x~0_In-766187171 |P1Thread1of1ForFork1_#t~ite32_Out-766187171|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-766187171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-766187171, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766187171, ~x~0=~x~0_In-766187171} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-766187171, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-766187171, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-766187171, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-766187171|, ~x~0=~x~0_In-766187171} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:48:58,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L774-4-->L775: Formula: (= v_~x~0_29 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 17:48:58,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1726134840 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1726134840 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite34_Out-1726134840| 0)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1726134840 |P1Thread1of1ForFork1_#t~ite34_Out-1726134840|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1726134840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726134840} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1726134840|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1726134840, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1726134840} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:48:58,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L776-->L776-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In958380813 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In958380813 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In958380813 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd2~0_In958380813 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out958380813|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In958380813 |P1Thread1of1ForFork1_#t~ite35_Out958380813|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In958380813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In958380813, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In958380813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958380813} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In958380813, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In958380813, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out958380813|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In958380813, ~x$w_buff0_used~0=~x$w_buff0_used~0_In958380813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:48:58,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1734762607 256))) (.cse0 (= (mod ~x$r_buff0_thd2~0_In1734762607 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out1734762607| ~x$r_buff0_thd2~0_In1734762607) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite36_Out1734762607| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734762607, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734762607} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1734762607, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1734762607|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1734762607} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:48:58,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L778-->L778-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In-1293529921 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1293529921 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In-1293529921 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1293529921 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1293529921| ~x$r_buff1_thd2~0_In-1293529921) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-1293529921| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1293529921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1293529921, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1293529921, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1293529921} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1293529921, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1293529921, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1293529921, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1293529921|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1293529921} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:48:58,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L778-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_269 |v_P1Thread1of1ForFork1_#t~ite37_42|) (= (+ v_~__unbuffered_cnt~0_47 1) v_~__unbuffered_cnt~0_46) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_269, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_46, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_41|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:48:58,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L803-->L805-2: Formula: (and (or (= 0 (mod v_~x$r_buff0_thd0~0_64 256)) (= (mod v_~x$w_buff0_used~0_301 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_64, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_301} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:48:58,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L805-2-->L805-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1562582470 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-1562582470 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1562582470| ~x$w_buff1~0_In-1562582470) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-1562582470| ~x~0_In-1562582470)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1562582470, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562582470, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1562582470, ~x~0=~x~0_In-1562582470} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-1562582470|, ~x$w_buff1~0=~x$w_buff1~0_In-1562582470, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1562582470, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1562582470, ~x~0=~x~0_In-1562582470} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:48:58,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L805-4-->L806: Formula: (= v_~x~0_46 |v_ULTIMATE.start_main_#t~ite40_13|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~x~0=v_~x~0_46} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x~0] because there is no mapped edge [2019-12-27 17:48:58,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In723492789 256))) (.cse1 (= (mod ~x$r_buff0_thd0~0_In723492789 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out723492789|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In723492789 |ULTIMATE.start_main_#t~ite42_Out723492789|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In723492789, ~x$w_buff0_used~0=~x$w_buff0_used~0_In723492789} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In723492789, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out723492789|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In723492789} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:48:58,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L807-->L807-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1434888566 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1434888566 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1434888566 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1434888566 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out1434888566|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1434888566| ~x$w_buff1_used~0_In1434888566) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1434888566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1434888566, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1434888566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434888566} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1434888566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1434888566, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1434888566|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1434888566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1434888566} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:48:58,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In30532946 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In30532946 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out30532946| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In30532946 |ULTIMATE.start_main_#t~ite44_Out30532946|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In30532946, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30532946} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In30532946, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out30532946|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In30532946} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:48:58,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1250174322 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In1250174322 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1250174322 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1250174322 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite45_Out1250174322| ~x$r_buff1_thd0~0_In1250174322) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite45_Out1250174322| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1250174322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1250174322, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1250174322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250174322} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1250174322, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1250174322, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1250174322, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1250174322|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1250174322} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:48:58,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L809-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_27 0) (= v_~main$tmp_guard1~0_20 0) (= v_~y~0_126 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 2 v_~__unbuffered_p1_EAX~0_27) (= v_~x$r_buff1_thd0~0_149 |v_ULTIMATE.start_main_#t~ite45_40|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~y~0=v_~y~0_126, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_40|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_27, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~y~0=v_~y~0_126, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_149, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_39|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:48:58,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:48:58 BasicIcfg [2019-12-27 17:48:58,342 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:48:58,348 INFO L168 Benchmark]: Toolchain (without parser) took 15974.66 ms. Allocated memory was 145.8 MB in the beginning and 683.7 MB in the end (delta: 537.9 MB). Free memory was 102.4 MB in the beginning and 232.4 MB in the end (delta: -130.0 MB). Peak memory consumption was 407.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,349 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,350 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.51 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 154.6 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,351 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.66 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,353 INFO L168 Benchmark]: Boogie Preprocessor took 45.33 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,354 INFO L168 Benchmark]: RCFGBuilder took 761.94 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 105.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,355 INFO L168 Benchmark]: TraceAbstraction took 14353.38 ms. Allocated memory was 202.4 MB in the beginning and 683.7 MB in the end (delta: 481.3 MB). Free memory was 105.2 MB in the beginning and 232.4 MB in the end (delta: -127.3 MB). Peak memory consumption was 354.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:48:58,364 INFO L335 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 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 725.51 ms. Allocated memory was 145.8 MB in the beginning and 202.4 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 154.6 MB in the end (delta: -52.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.66 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.33 ms. Allocated memory is still 202.4 MB. Free memory was 152.6 MB in the beginning and 149.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 761.94 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 105.8 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14353.38 ms. Allocated memory was 202.4 MB in the beginning and 683.7 MB in the end (delta: 481.3 MB). Free memory was 105.2 MB in the beginning and 232.4 MB in the end (delta: -127.3 MB). Peak memory consumption was 354.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 147 ProgramPointsBefore, 79 ProgramPointsAfterwards, 181 TransitionsBefore, 90 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 29 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4894 VarBasedMoverChecksPositive, 354 VarBasedMoverChecksNegative, 269 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 76691 CheckedPairsTotal, 108 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L797] FCALL, FORK 0 pthread_create(&t1705, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] FCALL, FORK 0 pthread_create(&t1706, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1461 SDtfs, 1640 SDslu, 2874 SDs, 0 SdLazy, 1296 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12234occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 8827 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 260 ConstructedInterpolants, 0 QuantifiedInterpolants, 23190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...