/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 06:53:59,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 06:53:59,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 06:53:59,142 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 06:53:59,142 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 06:53:59,144 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 06:53:59,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 06:53:59,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 06:53:59,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 06:53:59,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 06:53:59,163 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 06:53:59,165 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 06:53:59,166 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 06:53:59,167 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 06:53:59,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 06:53:59,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 06:53:59,173 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 06:53:59,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 06:53:59,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 06:53:59,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 06:53:59,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 06:53:59,188 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 06:53:59,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 06:53:59,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 06:53:59,193 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 06:53:59,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 06:53:59,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 06:53:59,195 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 06:53:59,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 06:53:59,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 06:53:59,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 06:53:59,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 06:53:59,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 06:53:59,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 06:53:59,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 06:53:59,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 06:53:59,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 06:53:59,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 06:53:59,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 06:53:59,203 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 06:53:59,204 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 06:53:59,205 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-VariableLbe.epf [2019-12-27 06:53:59,233 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 06:53:59,234 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 06:53:59,235 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 06:53:59,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 06:53:59,241 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 06:53:59,241 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 06:53:59,241 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 06:53:59,241 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 06:53:59,242 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 06:53:59,242 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 06:53:59,242 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 06:53:59,242 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 06:53:59,242 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 06:53:59,243 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 06:53:59,243 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 06:53:59,243 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 06:53:59,243 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 06:53:59,243 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 06:53:59,244 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 06:53:59,244 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 06:53:59,244 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 06:53:59,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 06:53:59,244 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 06:53:59,244 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 06:53:59,245 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 06:53:59,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 06:53:59,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 06:53:59,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 06:53:59,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 06:53:59,570 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 06:53:59,571 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 06:53:59,643 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b9a401/bd37c9a91b76410c9b100dfe2a38c98f/FLAGbf94be528 [2019-12-27 06:54:00,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 06:54:00,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-27 06:54:00,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b9a401/bd37c9a91b76410c9b100dfe2a38c98f/FLAGbf94be528 [2019-12-27 06:54:00,471 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f9b9a401/bd37c9a91b76410c9b100dfe2a38c98f [2019-12-27 06:54:00,482 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 06:54:00,484 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 06:54:00,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:00,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 06:54:00,490 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 06:54:00,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:00" (1/1) ... [2019-12-27 06:54:00,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e211ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:00, skipping insertion in model container [2019-12-27 06:54:00,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:54:00" (1/1) ... [2019-12-27 06:54:00,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 06:54:00,552 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 06:54:01,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:01,047 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 06:54:01,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 06:54:01,190 INFO L208 MainTranslator]: Completed translation [2019-12-27 06:54:01,191 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01 WrapperNode [2019-12-27 06:54:01,191 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 06:54:01,192 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:01,192 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 06:54:01,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 06:54:01,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 06:54:01,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 06:54:01,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 06:54:01,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 06:54:01,262 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,277 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (1/1) ... [2019-12-27 06:54:01,289 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 06:54:01,290 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 06:54:01,290 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 06:54:01,290 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 06:54:01,291 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (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 06:54:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 06:54:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 06:54:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 06:54:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 06:54:01,364 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 06:54:01,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 06:54:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 06:54:01,365 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 06:54:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 06:54:01,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 06:54:01,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 06:54:01,368 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 06:54:02,144 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 06:54:02,144 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 06:54:02,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:02 BoogieIcfgContainer [2019-12-27 06:54:02,145 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 06:54:02,147 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 06:54:02,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 06:54:02,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 06:54:02,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:54:00" (1/3) ... [2019-12-27 06:54:02,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f4fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:02, skipping insertion in model container [2019-12-27 06:54:02,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:54:01" (2/3) ... [2019-12-27 06:54:02,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d0f4fd3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:54:02, skipping insertion in model container [2019-12-27 06:54:02,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:54:02" (3/3) ... [2019-12-27 06:54:02,156 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-12-27 06:54:02,164 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 06:54:02,165 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 06:54:02,172 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 06:54:02,173 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 06:54:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,210 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,211 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,212 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,222 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,282 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 06:54:02,303 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 06:54:02,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 06:54:02,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 06:54:02,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 06:54:02,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 06:54:02,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 06:54:02,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 06:54:02,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 06:54:02,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 06:54:02,338 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 06:54:02,340 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:02,435 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:02,436 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:02,455 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:02,472 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 06:54:02,554 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 06:54:02,555 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 06:54:02,562 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 06:54:02,580 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 06:54:02,581 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 06:54:05,774 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 06:54:05,880 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 06:54:05,902 INFO L206 etLargeBlockEncoding]: Checked pairs total: 54539 [2019-12-27 06:54:05,902 INFO L214 etLargeBlockEncoding]: Total number of compositions: 101 [2019-12-27 06:54:05,906 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 86 transitions [2019-12-27 06:54:06,368 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8432 states. [2019-12-27 06:54:06,370 INFO L276 IsEmpty]: Start isEmpty. Operand 8432 states. [2019-12-27 06:54:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 06:54:06,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:06,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 06:54:06,376 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:06,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:06,381 INFO L82 PathProgramCache]: Analyzing trace with hash 787368, now seen corresponding path program 1 times [2019-12-27 06:54:06,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:06,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049238917] [2019-12-27 06:54:06,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:06,603 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 06:54:06,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049238917] [2019-12-27 06:54:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:06,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7285680] [2019-12-27 06:54:06,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:06,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:06,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:06,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:06,637 INFO L87 Difference]: Start difference. First operand 8432 states. Second operand 3 states. [2019-12-27 06:54:06,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:06,957 INFO L93 Difference]: Finished difference Result 8310 states and 27124 transitions. [2019-12-27 06:54:06,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:06,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 06:54:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:07,059 INFO L225 Difference]: With dead ends: 8310 [2019-12-27 06:54:07,060 INFO L226 Difference]: Without dead ends: 7790 [2019-12-27 06:54:07,061 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 06:54:07,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7790 states. [2019-12-27 06:54:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7790 to 7790. [2019-12-27 06:54:07,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7790 states. [2019-12-27 06:54:07,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7790 states to 7790 states and 25381 transitions. [2019-12-27 06:54:07,508 INFO L78 Accepts]: Start accepts. Automaton has 7790 states and 25381 transitions. Word has length 3 [2019-12-27 06:54:07,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:07,509 INFO L462 AbstractCegarLoop]: Abstraction has 7790 states and 25381 transitions. [2019-12-27 06:54:07,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:07,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7790 states and 25381 transitions. [2019-12-27 06:54:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 06:54:07,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:07,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:07,513 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:07,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1148786608, now seen corresponding path program 1 times [2019-12-27 06:54:07,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:07,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669735036] [2019-12-27 06:54:07,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:07,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:07,650 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 06:54:07,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669735036] [2019-12-27 06:54:07,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:07,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67022761] [2019-12-27 06:54:07,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:07,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:07,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:07,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:07,655 INFO L87 Difference]: Start difference. First operand 7790 states and 25381 transitions. Second operand 4 states. [2019-12-27 06:54:08,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:08,129 INFO L93 Difference]: Finished difference Result 12240 states and 38069 transitions. [2019-12-27 06:54:08,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:08,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 06:54:08,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:08,226 INFO L225 Difference]: With dead ends: 12240 [2019-12-27 06:54:08,226 INFO L226 Difference]: Without dead ends: 12233 [2019-12-27 06:54:08,228 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 06:54:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12233 states. [2019-12-27 06:54:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12233 to 11012. [2019-12-27 06:54:08,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-27 06:54:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 34845 transitions. [2019-12-27 06:54:08,758 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 34845 transitions. Word has length 11 [2019-12-27 06:54:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:08,758 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 34845 transitions. [2019-12-27 06:54:08,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 34845 transitions. [2019-12-27 06:54:08,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 06:54:08,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:08,764 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:08,764 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:08,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:08,765 INFO L82 PathProgramCache]: Analyzing trace with hash 440538846, now seen corresponding path program 1 times [2019-12-27 06:54:08,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:08,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615656602] [2019-12-27 06:54:08,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:08,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:08,855 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 06:54:08,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615656602] [2019-12-27 06:54:08,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:08,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:08,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511580988] [2019-12-27 06:54:08,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:08,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:08,858 INFO L87 Difference]: Start difference. First operand 11012 states and 34845 transitions. Second operand 5 states. [2019-12-27 06:54:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:09,258 INFO L93 Difference]: Finished difference Result 15483 states and 48326 transitions. [2019-12-27 06:54:09,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 06:54:09,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 06:54:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:09,313 INFO L225 Difference]: With dead ends: 15483 [2019-12-27 06:54:09,313 INFO L226 Difference]: Without dead ends: 15483 [2019-12-27 06:54:09,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:09,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15483 states. [2019-12-27 06:54:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15483 to 12390. [2019-12-27 06:54:10,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12390 states. [2019-12-27 06:54:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12390 states to 12390 states and 39189 transitions. [2019-12-27 06:54:10,444 INFO L78 Accepts]: Start accepts. Automaton has 12390 states and 39189 transitions. Word has length 14 [2019-12-27 06:54:10,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:10,446 INFO L462 AbstractCegarLoop]: Abstraction has 12390 states and 39189 transitions. [2019-12-27 06:54:10,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:10,446 INFO L276 IsEmpty]: Start isEmpty. Operand 12390 states and 39189 transitions. [2019-12-27 06:54:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 06:54:10,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:10,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 06:54:10,450 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1898414351, now seen corresponding path program 1 times [2019-12-27 06:54:10,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:10,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783602343] [2019-12-27 06:54:10,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:10,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:10,514 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 06:54:10,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783602343] [2019-12-27 06:54:10,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:10,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 06:54:10,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354546348] [2019-12-27 06:54:10,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:10,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:10,519 INFO L87 Difference]: Start difference. First operand 12390 states and 39189 transitions. Second operand 3 states. [2019-12-27 06:54:10,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:10,580 INFO L93 Difference]: Finished difference Result 12387 states and 39180 transitions. [2019-12-27 06:54:10,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:10,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 06:54:10,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:10,612 INFO L225 Difference]: With dead ends: 12387 [2019-12-27 06:54:10,612 INFO L226 Difference]: Without dead ends: 12387 [2019-12-27 06:54:10,613 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 06:54:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2019-12-27 06:54:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 12387. [2019-12-27 06:54:11,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12387 states. [2019-12-27 06:54:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12387 states to 12387 states and 39180 transitions. [2019-12-27 06:54:11,074 INFO L78 Accepts]: Start accepts. Automaton has 12387 states and 39180 transitions. Word has length 16 [2019-12-27 06:54:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:11,075 INFO L462 AbstractCegarLoop]: Abstraction has 12387 states and 39180 transitions. [2019-12-27 06:54:11,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:11,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12387 states and 39180 transitions. [2019-12-27 06:54:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:54:11,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:11,080 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 06:54:11,080 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:11,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:11,081 INFO L82 PathProgramCache]: Analyzing trace with hash 242771609, now seen corresponding path program 1 times [2019-12-27 06:54:11,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:11,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291701397] [2019-12-27 06:54:11,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:11,126 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 06:54:11,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291701397] [2019-12-27 06:54:11,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:11,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:11,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228799047] [2019-12-27 06:54:11,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:11,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:11,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:11,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:11,129 INFO L87 Difference]: Start difference. First operand 12387 states and 39180 transitions. Second operand 3 states. [2019-12-27 06:54:11,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:11,214 INFO L93 Difference]: Finished difference Result 20943 states and 65829 transitions. [2019-12-27 06:54:11,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:11,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 06:54:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:11,241 INFO L225 Difference]: With dead ends: 20943 [2019-12-27 06:54:11,242 INFO L226 Difference]: Without dead ends: 11612 [2019-12-27 06:54:11,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:11,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11612 states. [2019-12-27 06:54:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11612 to 10925. [2019-12-27 06:54:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10925 states. [2019-12-27 06:54:11,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 33699 transitions. [2019-12-27 06:54:11,730 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 33699 transitions. Word has length 17 [2019-12-27 06:54:11,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:11,731 INFO L462 AbstractCegarLoop]: Abstraction has 10925 states and 33699 transitions. [2019-12-27 06:54:11,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:11,731 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 33699 transitions. [2019-12-27 06:54:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:54:11,738 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:11,739 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 06:54:11,739 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:11,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:11,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1332750577, now seen corresponding path program 1 times [2019-12-27 06:54:11,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:11,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202285278] [2019-12-27 06:54:11,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:11,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:11,836 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 06:54:11,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202285278] [2019-12-27 06:54:11,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:11,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:11,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866998709] [2019-12-27 06:54:11,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:11,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:11,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:11,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:11,840 INFO L87 Difference]: Start difference. First operand 10925 states and 33699 transitions. Second operand 3 states. [2019-12-27 06:54:11,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:11,924 INFO L93 Difference]: Finished difference Result 10925 states and 33164 transitions. [2019-12-27 06:54:11,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:11,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 06:54:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:11,954 INFO L225 Difference]: With dead ends: 10925 [2019-12-27 06:54:11,954 INFO L226 Difference]: Without dead ends: 10925 [2019-12-27 06:54:11,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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 06:54:12,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10925 states. [2019-12-27 06:54:12,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10925 to 10917. [2019-12-27 06:54:12,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10917 states. [2019-12-27 06:54:12,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10917 states to 10917 states and 33148 transitions. [2019-12-27 06:54:12,366 INFO L78 Accepts]: Start accepts. Automaton has 10917 states and 33148 transitions. Word has length 17 [2019-12-27 06:54:12,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:12,367 INFO L462 AbstractCegarLoop]: Abstraction has 10917 states and 33148 transitions. [2019-12-27 06:54:12,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 10917 states and 33148 transitions. [2019-12-27 06:54:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 06:54:12,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:12,372 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 06:54:12,372 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:12,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1842424808, now seen corresponding path program 1 times [2019-12-27 06:54:12,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:12,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047385125] [2019-12-27 06:54:12,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:12,477 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 06:54:12,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047385125] [2019-12-27 06:54:12,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:12,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:12,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572260462] [2019-12-27 06:54:12,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 06:54:12,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:12,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 06:54:12,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 06:54:12,480 INFO L87 Difference]: Start difference. First operand 10917 states and 33148 transitions. Second operand 4 states. [2019-12-27 06:54:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:12,510 INFO L93 Difference]: Finished difference Result 1827 states and 4498 transitions. [2019-12-27 06:54:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 06:54:12,510 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 06:54:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:12,512 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 06:54:12,513 INFO L226 Difference]: Without dead ends: 1295 [2019-12-27 06:54:12,513 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 06:54:12,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2019-12-27 06:54:12,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1295. [2019-12-27 06:54:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2019-12-27 06:54:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2824 transitions. [2019-12-27 06:54:12,540 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2824 transitions. Word has length 17 [2019-12-27 06:54:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:12,541 INFO L462 AbstractCegarLoop]: Abstraction has 1295 states and 2824 transitions. [2019-12-27 06:54:12,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 06:54:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2824 transitions. [2019-12-27 06:54:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 06:54:12,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:12,543 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 06:54:12,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1197258380, now seen corresponding path program 1 times [2019-12-27 06:54:12,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:12,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844465200] [2019-12-27 06:54:12,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:12,651 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 06:54:12,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844465200] [2019-12-27 06:54:12,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:12,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:12,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779939665] [2019-12-27 06:54:12,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 06:54:12,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:12,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 06:54:12,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 06:54:12,653 INFO L87 Difference]: Start difference. First operand 1295 states and 2824 transitions. Second operand 6 states. [2019-12-27 06:54:13,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:13,004 INFO L93 Difference]: Finished difference Result 1351 states and 2894 transitions. [2019-12-27 06:54:13,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:54:13,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 06:54:13,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:13,008 INFO L225 Difference]: With dead ends: 1351 [2019-12-27 06:54:13,008 INFO L226 Difference]: Without dead ends: 1300 [2019-12-27 06:54:13,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 06:54:13,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1300 states. [2019-12-27 06:54:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1300 to 1241. [2019-12-27 06:54:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-12-27 06:54:13,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 2709 transitions. [2019-12-27 06:54:13,029 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 2709 transitions. Word has length 25 [2019-12-27 06:54:13,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:13,029 INFO L462 AbstractCegarLoop]: Abstraction has 1241 states and 2709 transitions. [2019-12-27 06:54:13,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 06:54:13,029 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 2709 transitions. [2019-12-27 06:54:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 06:54:13,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:13,032 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 06:54:13,032 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:13,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:13,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1913919297, now seen corresponding path program 1 times [2019-12-27 06:54:13,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:13,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383458410] [2019-12-27 06:54:13,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:13,131 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 06:54:13,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383458410] [2019-12-27 06:54:13,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:13,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 06:54:13,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248953453] [2019-12-27 06:54:13,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 06:54:13,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 06:54:13,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 06:54:13,136 INFO L87 Difference]: Start difference. First operand 1241 states and 2709 transitions. Second operand 5 states. [2019-12-27 06:54:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:13,186 INFO L93 Difference]: Finished difference Result 662 states and 1418 transitions. [2019-12-27 06:54:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 06:54:13,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 06:54:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:13,188 INFO L225 Difference]: With dead ends: 662 [2019-12-27 06:54:13,188 INFO L226 Difference]: Without dead ends: 524 [2019-12-27 06:54:13,188 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2019-12-27 06:54:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 524. [2019-12-27 06:54:13,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-27 06:54:13,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1164 transitions. [2019-12-27 06:54:13,197 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1164 transitions. Word has length 28 [2019-12-27 06:54:13,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:13,200 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 1164 transitions. [2019-12-27 06:54:13,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 06:54:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1164 transitions. [2019-12-27 06:54:13,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:13,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:13,205 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 06:54:13,205 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:13,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:13,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2101668284, now seen corresponding path program 1 times [2019-12-27 06:54:13,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:13,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206610784] [2019-12-27 06:54:13,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:13,262 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 06:54:13,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206610784] [2019-12-27 06:54:13,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:13,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 06:54:13,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524068326] [2019-12-27 06:54:13,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:13,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:13,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:13,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:13,265 INFO L87 Difference]: Start difference. First operand 524 states and 1164 transitions. Second operand 3 states. [2019-12-27 06:54:13,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:13,303 INFO L93 Difference]: Finished difference Result 776 states and 1668 transitions. [2019-12-27 06:54:13,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:13,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:13,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:13,304 INFO L225 Difference]: With dead ends: 776 [2019-12-27 06:54:13,304 INFO L226 Difference]: Without dead ends: 776 [2019-12-27 06:54:13,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 06:54:13,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2019-12-27 06:54:13,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 584. [2019-12-27 06:54:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-12-27 06:54:13,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 1284 transitions. [2019-12-27 06:54:13,315 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 1284 transitions. Word has length 52 [2019-12-27 06:54:13,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:13,316 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 1284 transitions. [2019-12-27 06:54:13,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:13,316 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 1284 transitions. [2019-12-27 06:54:13,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:13,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:13,319 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 06:54:13,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:13,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:13,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1679965585, now seen corresponding path program 1 times [2019-12-27 06:54:13,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:13,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804640827] [2019-12-27 06:54:13,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:13,459 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 06:54:13,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804640827] [2019-12-27 06:54:13,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:13,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 06:54:13,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650331335] [2019-12-27 06:54:13,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 06:54:13,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:13,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 06:54:13,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 06:54:13,462 INFO L87 Difference]: Start difference. First operand 584 states and 1284 transitions. Second operand 7 states. [2019-12-27 06:54:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:13,627 INFO L93 Difference]: Finished difference Result 1131 states and 2408 transitions. [2019-12-27 06:54:13,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 06:54:13,628 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 06:54:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:13,629 INFO L225 Difference]: With dead ends: 1131 [2019-12-27 06:54:13,629 INFO L226 Difference]: Without dead ends: 792 [2019-12-27 06:54:13,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 06:54:13,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-12-27 06:54:13,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 639. [2019-12-27 06:54:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-12-27 06:54:13,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 1372 transitions. [2019-12-27 06:54:13,640 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 1372 transitions. Word has length 52 [2019-12-27 06:54:13,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:13,640 INFO L462 AbstractCegarLoop]: Abstraction has 639 states and 1372 transitions. [2019-12-27 06:54:13,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 06:54:13,640 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 1372 transitions. [2019-12-27 06:54:13,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 06:54:13,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:13,643 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 06:54:13,644 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:13,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1571745907, now seen corresponding path program 2 times [2019-12-27 06:54:13,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:13,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107359138] [2019-12-27 06:54:13,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 06:54:13,763 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 06:54:13,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107359138] [2019-12-27 06:54:13,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 06:54:13,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 06:54:13,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978675885] [2019-12-27 06:54:13,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 06:54:13,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 06:54:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 06:54:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 06:54:13,766 INFO L87 Difference]: Start difference. First operand 639 states and 1372 transitions. Second operand 3 states. [2019-12-27 06:54:13,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 06:54:13,819 INFO L93 Difference]: Finished difference Result 784 states and 1673 transitions. [2019-12-27 06:54:13,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 06:54:13,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 06:54:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 06:54:13,820 INFO L225 Difference]: With dead ends: 784 [2019-12-27 06:54:13,820 INFO L226 Difference]: Without dead ends: 784 [2019-12-27 06:54:13,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 06:54:13,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-27 06:54:13,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 688. [2019-12-27 06:54:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2019-12-27 06:54:13,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1481 transitions. [2019-12-27 06:54:13,833 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1481 transitions. Word has length 52 [2019-12-27 06:54:13,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 06:54:13,834 INFO L462 AbstractCegarLoop]: Abstraction has 688 states and 1481 transitions. [2019-12-27 06:54:13,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 06:54:13,834 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1481 transitions. [2019-12-27 06:54:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 06:54:13,836 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 06:54:13,836 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 06:54:13,837 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 06:54:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 06:54:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1281220607, now seen corresponding path program 1 times [2019-12-27 06:54:13,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 06:54:13,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254844872] [2019-12-27 06:54:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 06:54:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 06:54:14,025 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 06:54:14,025 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 06:54:14,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] ULTIMATE.startENTRY-->L792: Formula: (let ((.cse0 (store |v_#valid_46| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$w_buff0~0_26) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_44| (store .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_22| 1)) (= v_~y~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_15) (= 0 v_~__unbuffered_cnt~0_15) (= 0 v_~y$w_buff1~0_24) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_53) (= |v_#NULL.offset_3| 0) (= v_~y$r_buff0_thd2~0_80 0) (= v_~main$tmp_guard0~0_8 0) (= v_~y$w_buff0_used~0_103 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1449~0.base_22| 4)) (= 0 v_~weak$$choice2~0_32) (= 0 v_~y$r_buff1_thd0~0_26) (= 0 v_~y$flush_delayed~0_13) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1449~0.base_22|)) (= 0 |v_ULTIMATE.start_main_~#t1449~0.offset_17|) (= v_~y$r_buff0_thd1~0_29 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1449~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1449~0.base_22|) |v_ULTIMATE.start_main_~#t1449~0.offset_17| 0)) |v_#memory_int_13|) (= v_~x~0_18 0) (= v_~y$w_buff1_used~0_65 0) (= 0 v_~weak$$choice0~0_7) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= 0 v_~y$r_buff1_thd1~0_19) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1449~0.base_22|) (= 0 |v_#NULL.base_3|) (= v_~y$mem_tmp~0_10 0) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_103, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_23|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t1449~0.base=|v_ULTIMATE.start_main_~#t1449~0.base_22|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_19, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$w_buff0~0=v_~y$w_buff0~0_26, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_15|, ~y~0=v_~y~0_25, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_18|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_44|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_7|, ULTIMATE.start_main_~#t1449~0.offset=|v_ULTIMATE.start_main_~#t1449~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_26, ~x~0=v_~x~0_18, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_65} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t1449~0.base, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t1450~0.base, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1449~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 06:54:14,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L792-1-->L794: Formula: (and (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t1450~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1450~0.offset_10| 0) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11|) 0) (= (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|) |v_ULTIMATE.start_main_~#t1450~0.offset_10| 1)) |v_#memory_int_7|) (not (= |v_ULTIMATE.start_main_~#t1450~0.base_11| 0)) (= (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1450~0.base_11| 1) |v_#valid_23|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1450~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1450~0.offset=|v_ULTIMATE.start_main_~#t1450~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1450~0.base=|v_ULTIMATE.start_main_~#t1450~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1450~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1450~0.base] because there is no mapped edge [2019-12-27 06:54:14,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L4-->L736: Formula: (and (= 1 ~y$r_buff0_thd1~0_Out-178459319) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-178459319)) (= 1 ~x~0_Out-178459319) (= ~y$r_buff0_thd1~0_In-178459319 ~y$r_buff1_thd1~0_Out-178459319) (= ~y$r_buff0_thd2~0_In-178459319 ~y$r_buff1_thd2~0_Out-178459319) (= ~y$r_buff1_thd0~0_Out-178459319 ~y$r_buff0_thd0~0_In-178459319)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-178459319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-178459319, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-178459319} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-178459319, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-178459319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-178459319, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-178459319, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-178459319, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-178459319, ~x~0=~x~0_Out-178459319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-178459319} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 06:54:14,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-2090957103 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2090957103 256)))) (or (and (= ~y$w_buff0_used~0_In-2090957103 |P0Thread1of1ForFork0_#t~ite5_Out-2090957103|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-2090957103|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2090957103} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2090957103|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090957103, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2090957103} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 06:54:14,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L758-->L758-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In1237712934 256) 0))) (or (and (= ~y$w_buff0~0_In1237712934 |P1Thread1of1ForFork1_#t~ite14_Out1237712934|) (= |P1Thread1of1ForFork1_#t~ite14_Out1237712934| |P1Thread1of1ForFork1_#t~ite15_Out1237712934|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1237712934 256) 0))) (or (= (mod ~y$w_buff0_used~0_In1237712934 256) 0) (and .cse1 (= (mod ~y$w_buff1_used~0_In1237712934 256) 0)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1237712934 256)))))) (and (= ~y$w_buff0~0_In1237712934 |P1Thread1of1ForFork1_#t~ite15_Out1237712934|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite14_In1237712934| |P1Thread1of1ForFork1_#t~ite14_Out1237712934|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1237712934, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1237712934, ~y$w_buff0~0=~y$w_buff0~0_In1237712934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1237712934, ~weak$$choice2~0=~weak$$choice2~0_In1237712934, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In1237712934|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1237712934} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1237712934, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1237712934, ~y$w_buff0~0=~y$w_buff0~0_In1237712934, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1237712934, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out1237712934|, ~weak$$choice2~0=~weak$$choice2~0_In1237712934, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1237712934|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1237712934} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 06:54:14,039 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L760-->L760-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1096129299 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite20_Out-1096129299| ~y$w_buff0_used~0_In-1096129299) (= |P1Thread1of1ForFork1_#t~ite21_Out-1096129299| |P1Thread1of1ForFork1_#t~ite20_Out-1096129299|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1096129299 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1096129299 256))) (and (= 0 (mod ~y$w_buff1_used~0_In-1096129299 256)) .cse1) (= (mod ~y$w_buff0_used~0_In-1096129299 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite21_Out-1096129299| ~y$w_buff0_used~0_In-1096129299) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite20_In-1096129299| |P1Thread1of1ForFork1_#t~ite20_Out-1096129299|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1096129299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1096129299, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1096129299|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1096129299, ~weak$$choice2~0=~weak$$choice2~0_In-1096129299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096129299} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1096129299, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1096129299, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1096129299|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1096129299, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1096129299|, ~weak$$choice2~0=~weak$$choice2~0_In-1096129299, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1096129299} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 06:54:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L762-->L763: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~y$r_buff0_thd2~0_47 v_~y$r_buff0_thd2~0_48)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_47, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_16, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 06:54:14,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In2088314378 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out2088314378| ~y$r_buff1_thd2~0_In2088314378) (= |P1Thread1of1ForFork1_#t~ite29_Out2088314378| |P1Thread1of1ForFork1_#t~ite30_Out2088314378|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2088314378 256)))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In2088314378 256)) .cse0) (= (mod ~y$w_buff0_used~0_In2088314378 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2088314378 256))))) .cse1) (and (= ~y$r_buff1_thd2~0_In2088314378 |P1Thread1of1ForFork1_#t~ite30_Out2088314378|) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite29_In2088314378| |P1Thread1of1ForFork1_#t~ite29_Out2088314378|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2088314378, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2088314378|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378, ~weak$$choice2~0=~weak$$choice2~0_In2088314378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2088314378} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2088314378, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2088314378|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2088314378|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2088314378, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2088314378, ~weak$$choice2~0=~weak$$choice2~0_In2088314378, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2088314378} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 06:54:14,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L765-->L769: Formula: (and (= v_~y~0_15 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_6) (not (= 0 (mod v_~y$flush_delayed~0_7 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_6, ~y~0=v_~y~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 06:54:14,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L769-2-->L769-5: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1798359110| |P1Thread1of1ForFork1_#t~ite33_Out1798359110|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1798359110 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1798359110 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork1_#t~ite32_Out1798359110| ~y~0_In1798359110)) (and .cse2 (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1798359110| ~y$w_buff1~0_In1798359110)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798359110, ~y$w_buff1~0=~y$w_buff1~0_In1798359110, ~y~0=~y~0_In1798359110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798359110} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1798359110, ~y$w_buff1~0=~y$w_buff1~0_In1798359110, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1798359110|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out1798359110|, ~y~0=~y~0_In1798359110, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798359110} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 06:54:14,044 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L770-->L770-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1857690886 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1857690886 256)))) (or (and (= ~y$w_buff0_used~0_In-1857690886 |P1Thread1of1ForFork1_#t~ite34_Out-1857690886|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1857690886| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1857690886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1857690886} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1857690886, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1857690886, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1857690886|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 06:54:14,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd2~0_In-2068097119 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-2068097119 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-2068097119 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-2068097119 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-2068097119| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-2068097119| ~y$w_buff1_used~0_In-2068097119) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2068097119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068097119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2068097119, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068097119} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2068097119, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2068097119, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2068097119, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-2068097119|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2068097119} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 06:54:14,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1316612682 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1316612682 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1316612682 |P1Thread1of1ForFork1_#t~ite36_Out1316612682|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1316612682|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1316612682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1316612682} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1316612682, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1316612682, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1316612682|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 06:54:14,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L773-->L773-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In816756047 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In816756047 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In816756047 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In816756047 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In816756047 |P1Thread1of1ForFork1_#t~ite37_Out816756047|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out816756047|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816756047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816756047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816756047, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816756047} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In816756047, ~y$w_buff0_used~0=~y$w_buff0_used~0_In816756047, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In816756047, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out816756047|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In816756047} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:54:14,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_43, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 06:54:14,047 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L738-->L738-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2041619067 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2041619067 256))) (.cse2 (= (mod ~y$r_buff1_thd1~0_In2041619067 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2041619067 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out2041619067|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2041619067 |P0Thread1of1ForFork0_#t~ite6_Out2041619067|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2041619067, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041619067, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2041619067, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2041619067} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2041619067|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In2041619067, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2041619067, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2041619067, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2041619067} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 06:54:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L739-->L740: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1267665577 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1267665577 256)))) (or (and (= ~y$r_buff0_thd1~0_In-1267665577 ~y$r_buff0_thd1~0_Out-1267665577) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1267665577) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267665577, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1267665577} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267665577, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1267665577|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1267665577} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 06:54:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L740-->L740-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-1154166624 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1154166624 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1154166624 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In-1154166624 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-1154166624| ~y$r_buff1_thd1~0_In-1154166624) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1154166624| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1154166624, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154166624, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1154166624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154166624} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1154166624, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154166624, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1154166624|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1154166624, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1154166624} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 06:54:14,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L740-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_12) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 06:54:14,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L798-->L800-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_79 256) 0) (= (mod v_~y$r_buff0_thd0~0_15 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_79, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 06:54:14,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L800-2-->L800-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-846187184 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite41_Out-846187184| |ULTIMATE.start_main_#t~ite40_Out-846187184|)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-846187184 256)))) (or (and (or .cse0 .cse1) .cse2 (= ~y~0_In-846187184 |ULTIMATE.start_main_#t~ite40_Out-846187184|)) (and (not .cse1) .cse2 (not .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-846187184| ~y$w_buff1~0_In-846187184)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-846187184, ~y~0=~y~0_In-846187184, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-846187184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846187184} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-846187184|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-846187184|, ~y$w_buff1~0=~y$w_buff1~0_In-846187184, ~y~0=~y~0_In-846187184, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-846187184, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-846187184} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 06:54:14,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-818720962 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-818720962 256)))) (or (and (= ~y$w_buff0_used~0_In-818720962 |ULTIMATE.start_main_#t~ite42_Out-818720962|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite42_Out-818720962|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-818720962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-818720962} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-818720962, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-818720962, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-818720962|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 06:54:14,051 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In539797626 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In539797626 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In539797626 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In539797626 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In539797626 |ULTIMATE.start_main_#t~ite43_Out539797626|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out539797626| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In539797626, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In539797626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In539797626, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In539797626, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out539797626|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In539797626, ~y$w_buff1_used~0=~y$w_buff1_used~0_In539797626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 06:54:14,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1122650421 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1122650421 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1122650421|)) (and (= ~y$r_buff0_thd0~0_In-1122650421 |ULTIMATE.start_main_#t~ite44_Out-1122650421|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122650421} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1122650421, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1122650421, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1122650421|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 06:54:14,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L804-->L804-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1114571638 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1114571638 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1114571638 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1114571638 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1114571638|)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1114571638| ~y$r_buff1_thd0~0_In-1114571638) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1114571638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1114571638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1114571638, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1114571638} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1114571638, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1114571638, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1114571638, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1114571638|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1114571638} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 06:54:14,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L804-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= |v_ULTIMATE.start_main_#t~ite45_13| v_~y$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= 0 v_~__unbuffered_p1_EAX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~x~0_11 2)) InVars {~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_13|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_9, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~x~0=v_~x~0_11, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 06:54:14,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:54:14 BasicIcfg [2019-12-27 06:54:14,122 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 06:54:14,125 INFO L168 Benchmark]: Toolchain (without parser) took 13641.24 ms. Allocated memory was 146.3 MB in the beginning and 602.4 MB in the end (delta: 456.1 MB). Free memory was 102.4 MB in the beginning and 191.5 MB in the end (delta: -89.1 MB). Peak memory consumption was 367.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,126 INFO L168 Benchmark]: CDTParser took 1.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,127 INFO L168 Benchmark]: CACSL2BoogieTranslator took 706.73 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 158.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.78 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,129 INFO L168 Benchmark]: Boogie Preprocessor took 36.79 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,130 INFO L168 Benchmark]: RCFGBuilder took 855.93 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,133 INFO L168 Benchmark]: TraceAbstraction took 11974.93 ms. Allocated memory was 204.5 MB in the beginning and 602.4 MB in the end (delta: 397.9 MB). Free memory was 109.8 MB in the beginning and 191.5 MB in the end (delta: -81.7 MB). Peak memory consumption was 316.2 MB. Max. memory is 7.1 GB. [2019-12-27 06:54:14,143 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.28 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 706.73 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.0 MB in the beginning and 158.7 MB in the end (delta: -56.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.78 ms. Allocated memory is still 204.5 MB. Free memory was 158.7 MB in the beginning and 156.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.79 ms. Allocated memory is still 204.5 MB. Free memory was 156.1 MB in the beginning and 154.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 855.93 ms. Allocated memory is still 204.5 MB. Free memory was 154.1 MB in the beginning and 109.8 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11974.93 ms. Allocated memory was 204.5 MB in the beginning and 602.4 MB in the end (delta: 397.9 MB). Free memory was 109.8 MB in the beginning and 191.5 MB in the end (delta: -81.7 MB). Peak memory consumption was 316.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 146 ProgramPointsBefore, 76 ProgramPointsAfterwards, 180 TransitionsBefore, 86 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 28 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 27 ChoiceCompositions, 4499 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 54539 CheckedPairsTotal, 101 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1269 SDtfs, 1209 SDslu, 1984 SDs, 0 SdLazy, 793 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12390occurred 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: 3.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 5509 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 292 ConstructedInterpolants, 0 QuantifiedInterpolants, 25812 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...