/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:14:07,037 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:14:07,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:14:07,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:14:07,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:14:07,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:14:07,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:14:07,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:14:07,076 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:14:07,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:14:07,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:14:07,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:14:07,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:14:07,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:14:07,087 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:14:07,088 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:14:07,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:14:07,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:14:07,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:14:07,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:14:07,102 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:14:07,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:14:07,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:14:07,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:14:07,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:14:07,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:14:07,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:14:07,113 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:14:07,114 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:14:07,115 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:14:07,115 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:14:07,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:14:07,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:14:07,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:14:07,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:14:07,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:14:07,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:14:07,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:14:07,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:14:07,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:14:07,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:14:07,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:14:07,154 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:14:07,154 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:14:07,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:14:07,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:14:07,156 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:14:07,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:14:07,158 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:14:07,158 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:14:07,158 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:14:07,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:14:07,159 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:14:07,160 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:14:07,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:14:07,160 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:14:07,160 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:14:07,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:14:07,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:07,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:14:07,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:14:07,162 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:14:07,162 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:14:07,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:14:07,167 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:14:07,167 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:14:07,168 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:14:07,168 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:14:07,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:14:07,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:14:07,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:14:07,475 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:14:07,475 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:14:07,476 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 17:14:07,534 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000ac2f4a/1a95e7cd82cf4eeea874cfd149fa8c49/FLAG78b611579 [2019-12-27 17:14:08,075 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:14:08,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix048_power.oepc.i [2019-12-27 17:14:08,099 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000ac2f4a/1a95e7cd82cf4eeea874cfd149fa8c49/FLAG78b611579 [2019-12-27 17:14:08,374 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/000ac2f4a/1a95e7cd82cf4eeea874cfd149fa8c49 [2019-12-27 17:14:08,385 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:14:08,387 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:14:08,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:08,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:14:08,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:14:08,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:08" (1/1) ... [2019-12-27 17:14:08,395 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e06cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:08, skipping insertion in model container [2019-12-27 17:14:08,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:14:08" (1/1) ... [2019-12-27 17:14:08,403 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:14:08,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:14:08,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:09,006 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:14:09,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:14:09,175 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:14:09,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09 WrapperNode [2019-12-27 17:14:09,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:14:09,176 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:09,176 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:14:09,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:14:09,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:14:09,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:14:09,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:14:09,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:14:09,249 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,273 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... [2019-12-27 17:14:09,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:14:09,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:14:09,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:14:09,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:14:09,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:14:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:14:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:14:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:14:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:14:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:14:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:14:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:14:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:14:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:14:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:14:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:14:09,343 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:14:10,017 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:14:10,018 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:14:10,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:10 BoogieIcfgContainer [2019-12-27 17:14:10,019 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:14:10,021 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:14:10,021 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:14:10,024 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:14:10,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:14:08" (1/3) ... [2019-12-27 17:14:10,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0a1d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:10, skipping insertion in model container [2019-12-27 17:14:10,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:14:09" (2/3) ... [2019-12-27 17:14:10,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0a1d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:14:10, skipping insertion in model container [2019-12-27 17:14:10,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:14:10" (3/3) ... [2019-12-27 17:14:10,029 INFO L109 eAbstractionObserver]: Analyzing ICFG mix048_power.oepc.i [2019-12-27 17:14:10,039 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:14:10,040 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:14:10,048 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:14:10,049 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:14:10,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,088 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,089 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,091 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,091 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,092 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,092 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,095 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,096 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,097 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,098 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,099 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,100 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,101 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,102 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,103 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,106 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,107 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,108 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,109 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,110 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,111 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,114 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,115 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,116 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,117 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,119 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,130 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,131 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,132 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,173 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,186 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:14:10,202 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 17:14:10,224 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:14:10,224 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:14:10,224 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:14:10,224 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:14:10,224 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:14:10,224 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:14:10,224 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:14:10,225 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:14:10,242 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-27 17:14:10,244 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:10,334 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:10,334 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:10,348 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:10,368 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-27 17:14:10,414 INFO L132 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-27 17:14:10,414 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:14:10,420 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 0/136 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 17:14:10,435 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 17:14:10,436 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:14:15,179 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 17:14:15,293 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 17:14:15,367 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-27 17:14:15,368 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-27 17:14:15,370 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-27 17:14:15,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-27 17:14:15,789 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-27 17:14:15,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:14:15,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:15,796 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:14:15,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:15,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:15,803 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-27 17:14:15,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:15,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303730867] [2019-12-27 17:14:15,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:16,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:16,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303730867] [2019-12-27 17:14:16,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:16,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:14:16,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [787116003] [2019-12-27 17:14:16,051 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:16,056 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:16,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:14:16,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:16,071 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:16,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:16,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:16,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:16,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:16,087 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-27 17:14:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:16,411 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-27 17:14:16,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:16,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:14:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:16,499 INFO L225 Difference]: With dead ends: 8074 [2019-12-27 17:14:16,499 INFO L226 Difference]: Without dead ends: 7606 [2019-12-27 17:14:16,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:16,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-27 17:14:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-27 17:14:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-27 17:14:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-27 17:14:17,051 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-27 17:14:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:17,051 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-27 17:14:17,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-27 17:14:17,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:14:17,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:17,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:17,055 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:17,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:17,056 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-27 17:14:17,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:17,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448649701] [2019-12-27 17:14:17,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:17,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448649701] [2019-12-27 17:14:17,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:17,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:17,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [950074579] [2019-12-27 17:14:17,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:17,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:17,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:14:17,178 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:17,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:17,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:17,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:17,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:17,181 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-27 17:14:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:17,532 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-27 17:14:17,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:17,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:14:17,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:17,645 INFO L225 Difference]: With dead ends: 11630 [2019-12-27 17:14:17,646 INFO L226 Difference]: Without dead ends: 11623 [2019-12-27 17:14:17,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:17,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-27 17:14:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-27 17:14:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-27 17:14:18,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-27 17:14:18,222 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-27 17:14:18,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:18,223 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-27 17:14:18,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:18,223 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-27 17:14:18,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 17:14:18,228 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:18,228 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:18,229 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:18,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-27 17:14:18,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:18,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208783256] [2019-12-27 17:14:18,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:18,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208783256] [2019-12-27 17:14:18,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:18,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:18,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2032957261] [2019-12-27 17:14:18,311 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:18,313 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:18,315 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 17:14:18,315 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:18,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:18,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:14:18,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:18,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:14:18,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:18,316 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-27 17:14:18,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:18,726 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-27 17:14:18,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:14:18,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 17:14:18,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:18,782 INFO L225 Difference]: With dead ends: 14471 [2019-12-27 17:14:18,782 INFO L226 Difference]: Without dead ends: 14471 [2019-12-27 17:14:18,783 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 17:14:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-27 17:14:19,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-27 17:14:19,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-27 17:14:19,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-27 17:14:19,893 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-27 17:14:19,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:19,894 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-27 17:14:19,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:14:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-27 17:14:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:14:19,898 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:19,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:19,899 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:19,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:19,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-27 17:14:19,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:19,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614834547] [2019-12-27 17:14:19,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614834547] [2019-12-27 17:14:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [57605981] [2019-12-27 17:14:19,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:19,970 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:19,973 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 22 transitions. [2019-12-27 17:14:19,973 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:19,974 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:19,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:19,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:19,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:19,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:19,976 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-27 17:14:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:20,095 INFO L93 Difference]: Finished difference Result 10750 states and 33336 transitions. [2019-12-27 17:14:20,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:20,096 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 17:14:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:20,136 INFO L225 Difference]: With dead ends: 10750 [2019-12-27 17:14:20,136 INFO L226 Difference]: Without dead ends: 10750 [2019-12-27 17:14:20,137 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 17:14:20,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10750 states. [2019-12-27 17:14:20,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10750 to 10670. [2019-12-27 17:14:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10670 states. [2019-12-27 17:14:20,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10670 states to 10670 states and 33104 transitions. [2019-12-27 17:14:20,590 INFO L78 Accepts]: Start accepts. Automaton has 10670 states and 33104 transitions. Word has length 16 [2019-12-27 17:14:20,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:20,590 INFO L462 AbstractCegarLoop]: Abstraction has 10670 states and 33104 transitions. [2019-12-27 17:14:20,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:20,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10670 states and 33104 transitions. [2019-12-27 17:14:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:14:20,593 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:20,593 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:20,594 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:20,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:20,594 INFO L82 PathProgramCache]: Analyzing trace with hash 2099964683, now seen corresponding path program 1 times [2019-12-27 17:14:20,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:20,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686342718] [2019-12-27 17:14:20,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:20,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:20,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686342718] [2019-12-27 17:14:20,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:20,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:20,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2136678918] [2019-12-27 17:14:20,721 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:20,723 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:20,725 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:14:20,725 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:20,726 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:20,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:20,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:20,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:20,727 INFO L87 Difference]: Start difference. First operand 10670 states and 33104 transitions. Second operand 4 states. [2019-12-27 17:14:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:20,762 INFO L93 Difference]: Finished difference Result 2054 states and 5113 transitions. [2019-12-27 17:14:20,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:20,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:14:20,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:20,766 INFO L225 Difference]: With dead ends: 2054 [2019-12-27 17:14:20,766 INFO L226 Difference]: Without dead ends: 1457 [2019-12-27 17:14:20,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-12-27 17:14:20,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1457. [2019-12-27 17:14:20,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1457 states. [2019-12-27 17:14:20,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 3211 transitions. [2019-12-27 17:14:20,797 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 3211 transitions. Word has length 16 [2019-12-27 17:14:20,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:20,798 INFO L462 AbstractCegarLoop]: Abstraction has 1457 states and 3211 transitions. [2019-12-27 17:14:20,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 3211 transitions. [2019-12-27 17:14:20,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 17:14:20,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:20,800 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] [2019-12-27 17:14:20,800 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:20,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-27 17:14:20,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:20,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976327370] [2019-12-27 17:14:20,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:20,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976327370] [2019-12-27 17:14:20,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:20,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:20,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1405386953] [2019-12-27 17:14:20,955 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:20,960 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:20,965 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 25 states and 24 transitions. [2019-12-27 17:14:20,965 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:20,966 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:20,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:20,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:20,967 INFO L87 Difference]: Start difference. First operand 1457 states and 3211 transitions. Second operand 6 states. [2019-12-27 17:14:21,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:21,318 INFO L93 Difference]: Finished difference Result 2249 states and 4761 transitions. [2019-12-27 17:14:21,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:21,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-27 17:14:21,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:21,326 INFO L225 Difference]: With dead ends: 2249 [2019-12-27 17:14:21,326 INFO L226 Difference]: Without dead ends: 2197 [2019-12-27 17:14:21,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:14:21,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2197 states. [2019-12-27 17:14:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2197 to 1428. [2019-12-27 17:14:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-12-27 17:14:21,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 3147 transitions. [2019-12-27 17:14:21,358 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 3147 transitions. Word has length 24 [2019-12-27 17:14:21,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:21,358 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 3147 transitions. [2019-12-27 17:14:21,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:21,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 3147 transitions. [2019-12-27 17:14:21,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:14:21,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:21,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:21,361 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:21,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:21,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1394338791, now seen corresponding path program 1 times [2019-12-27 17:14:21,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:21,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016177461] [2019-12-27 17:14:21,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:21,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 17:14:21,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016177461] [2019-12-27 17:14:21,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:21,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:14:21,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1249593197] [2019-12-27 17:14:21,478 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:21,483 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:21,492 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 71 transitions. [2019-12-27 17:14:21,493 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:21,546 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:14:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:21,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:21,549 INFO L87 Difference]: Start difference. First operand 1428 states and 3147 transitions. Second operand 6 states. [2019-12-27 17:14:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:21,605 INFO L93 Difference]: Finished difference Result 752 states and 1639 transitions. [2019-12-27 17:14:21,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:14:21,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:14:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:21,608 INFO L225 Difference]: With dead ends: 752 [2019-12-27 17:14:21,608 INFO L226 Difference]: Without dead ends: 689 [2019-12-27 17:14:21,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:14:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2019-12-27 17:14:21,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 689. [2019-12-27 17:14:21,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 689 states. [2019-12-27 17:14:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1501 transitions. [2019-12-27 17:14:21,624 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1501 transitions. Word has length 27 [2019-12-27 17:14:21,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:21,624 INFO L462 AbstractCegarLoop]: Abstraction has 689 states and 1501 transitions. [2019-12-27 17:14:21,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1501 transitions. [2019-12-27 17:14:21,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:14:21,628 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:21,628 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] [2019-12-27 17:14:21,628 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:21,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:21,629 INFO L82 PathProgramCache]: Analyzing trace with hash 178128967, now seen corresponding path program 1 times [2019-12-27 17:14:21,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:21,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072113328] [2019-12-27 17:14:21,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:21,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072113328] [2019-12-27 17:14:21,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:21,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:14:21,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1674656390] [2019-12-27 17:14:21,722 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:21,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:21,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 64 transitions. [2019-12-27 17:14:21,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:21,866 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:14:21,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:14:21,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:14:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:14:21,867 INFO L87 Difference]: Start difference. First operand 689 states and 1501 transitions. Second operand 4 states. [2019-12-27 17:14:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:21,891 INFO L93 Difference]: Finished difference Result 1118 states and 2458 transitions. [2019-12-27 17:14:21,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:14:21,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-12-27 17:14:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:21,893 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 17:14:21,893 INFO L226 Difference]: Without dead ends: 471 [2019-12-27 17:14:21,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:14:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-27 17:14:21,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-27 17:14:21,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-27 17:14:21,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-27 17:14:21,903 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 51 [2019-12-27 17:14:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:21,903 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-27 17:14:21,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:14:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-27 17:14:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:14:21,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:21,905 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] [2019-12-27 17:14:21,905 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:21,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 2 times [2019-12-27 17:14:21,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:21,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394229470] [2019-12-27 17:14:21,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:22,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:22,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394229470] [2019-12-27 17:14:22,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:22,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:14:22,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1840095851] [2019-12-27 17:14:22,028 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:22,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:22,097 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 79 states and 96 transitions. [2019-12-27 17:14:22,098 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:22,167 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:14:22,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:14:22,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:14:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:14:22,169 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 9 states. [2019-12-27 17:14:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:22,456 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-27 17:14:22,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:14:22,456 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 17:14:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:22,458 INFO L225 Difference]: With dead ends: 982 [2019-12-27 17:14:22,458 INFO L226 Difference]: Without dead ends: 683 [2019-12-27 17:14:22,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 17:14:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-27 17:14:22,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-27 17:14:22,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-27 17:14:22,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-27 17:14:22,470 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-27 17:14:22,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:22,470 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-27 17:14:22,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:14:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-27 17:14:22,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:14:22,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:22,472 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] [2019-12-27 17:14:22,473 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:22,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:22,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 3 times [2019-12-27 17:14:22,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:22,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597156429] [2019-12-27 17:14:22,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:22,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:22,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597156429] [2019-12-27 17:14:22,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:22,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:14:22,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [284799311] [2019-12-27 17:14:22,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:22,575 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:22,624 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 98 transitions. [2019-12-27 17:14:22,624 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:22,659 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:14:22,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:14:22,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:22,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:14:22,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:14:22,660 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 6 states. [2019-12-27 17:14:23,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:23,137 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-27 17:14:23,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:14:23,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 17:14:23,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:23,141 INFO L225 Difference]: With dead ends: 885 [2019-12-27 17:14:23,142 INFO L226 Difference]: Without dead ends: 861 [2019-12-27 17:14:23,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:14:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-27 17:14:23,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-27 17:14:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-27 17:14:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-27 17:14:23,158 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-27 17:14:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:23,158 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-27 17:14:23,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:14:23,159 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-27 17:14:23,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 17:14:23,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:23,161 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] [2019-12-27 17:14:23,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:23,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:23,161 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 4 times [2019-12-27 17:14:23,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:23,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669433409] [2019-12-27 17:14:23,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:23,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:14:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:14:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669433409] [2019-12-27 17:14:23,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:14:23,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:14:23,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1141236092] [2019-12-27 17:14:23,254 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:14:23,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:14:23,314 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 81 states and 101 transitions. [2019-12-27 17:14:23,314 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:14:23,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:14:23,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:14:23,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:14:23,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:14:23,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:14:23,317 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-27 17:14:23,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:14:23,368 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-27 17:14:23,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:14:23,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 17:14:23,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:14:23,374 INFO L225 Difference]: With dead ends: 923 [2019-12-27 17:14:23,375 INFO L226 Difference]: Without dead ends: 923 [2019-12-27 17:14:23,375 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 17:14:23,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-27 17:14:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-27 17:14:23,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-27 17:14:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-27 17:14:23,398 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-27 17:14:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:14:23,398 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-27 17:14:23,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:14:23,399 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-27 17:14:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 17:14:23,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:14:23,401 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:14:23,401 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:14:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:14:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-27 17:14:23,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:14:23,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973528184] [2019-12-27 17:14:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:14:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:14:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:14:23,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:14:23,580 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:14:23,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= 0 v_~y$flush_delayed~0_22) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= v_~y$r_buff1_thd0~0_125 0) (= 0 v_~y$r_buff0_thd2~0_324) (= 0 v_~__unbuffered_p1_EAX~0_51) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_40| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1281~0.base_40|) |v_ULTIMATE.start_main_~#t1281~0.offset_27| 0))) (= v_~y$read_delayed~0_6 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1281~0.base_40|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1281~0.base_40| 4) |v_#length_17|) (= 0 v_~y$r_buff1_thd2~0_235) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~weak$$choice2~0_96) (= v_~y~0_133 0) (= 0 v_~__unbuffered_p0_EAX~0_91) (= v_~y$r_buff0_thd0~0_125 0) (= |v_ULTIMATE.start_main_~#t1281~0.offset_27| 0) (= v_~y$w_buff1_used~0_311 0) (= v_~x~0_65 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~weak$$choice0~0_13) (= v_~y$r_buff1_thd1~0_115 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_40|)) (= (store .cse0 |v_ULTIMATE.start_main_~#t1281~0.base_40| 1) |v_#valid_65|) (= v_~main$tmp_guard1~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_76|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_91, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_51, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_22, #length=|v_#length_17|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_27|, ~y~0=v_~y~0_133, ULTIMATE.start_main_~#t1281~0.base=|v_ULTIMATE.start_main_~#t1281~0.base_40|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1281~0.offset=|v_ULTIMATE.start_main_~#t1281~0.offset_27|, ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_41|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_65|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_96, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_125, ~x~0=v_~x~0_65, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~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, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1282~0.offset, ~y~0, ULTIMATE.start_main_~#t1281~0.base, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1281~0.offset, ULTIMATE.start_main_~#t1282~0.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, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:14:23,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13| 1) |v_#valid_27|) (not (= 0 |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1282~0.base_13|) |v_ULTIMATE.start_main_~#t1282~0.offset_11| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1282~0.offset_11| 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1282~0.base_13| 4)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1282~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1282~0.base=|v_ULTIMATE.start_main_~#t1282~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1282~0.offset=|v_ULTIMATE.start_main_~#t1282~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1282~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t1282~0.offset] because there is no mapped edge [2019-12-27 17:14:23,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-893287326)) (= 1 ~y$r_buff0_thd1~0_Out-893287326) (= ~y$r_buff1_thd2~0_Out-893287326 ~y$r_buff0_thd2~0_In-893287326) (= ~y$r_buff1_thd0~0_Out-893287326 ~y$r_buff0_thd0~0_In-893287326) (= ~x~0_In-893287326 ~__unbuffered_p0_EAX~0_Out-893287326) (= ~y$r_buff0_thd1~0_In-893287326 ~y$r_buff1_thd1~0_Out-893287326)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893287326, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-893287326, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893287326, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-893287326, ~x~0=~x~0_In-893287326} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-893287326, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-893287326, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-893287326, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-893287326, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-893287326, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-893287326, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-893287326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-893287326, ~x~0=~x~0_In-893287326} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 17:14:23,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-223354091 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-223354091 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-223354091| ~y$w_buff0_used~0_In-223354091)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-223354091| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-223354091, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-223354091} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-223354091|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-223354091, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-223354091} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 17:14:23,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2040877199 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite21_Out-2040877199| |P1Thread1of1ForFork1_#t~ite20_Out-2040877199|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-2040877199 256)))) (or (and (= (mod ~y$r_buff1_thd2~0_In-2040877199 256) 0) .cse1) (= (mod ~y$w_buff0_used~0_In-2040877199 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-2040877199 256))))) (= ~y$w_buff0_used~0_In-2040877199 |P1Thread1of1ForFork1_#t~ite20_Out-2040877199|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-2040877199| |P1Thread1of1ForFork1_#t~ite20_Out-2040877199|) (not .cse0) (= ~y$w_buff0_used~0_In-2040877199 |P1Thread1of1ForFork1_#t~ite21_Out-2040877199|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2040877199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2040877199|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199, ~weak$$choice2~0=~weak$$choice2~0_In-2040877199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040877199} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2040877199, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2040877199, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2040877199|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2040877199, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2040877199|, ~weak$$choice2~0=~weak$$choice2~0_In-2040877199, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2040877199} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 17:14:23,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse5 (= (mod ~y$r_buff1_thd2~0_In-1775114838 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1775114838 256) 0)) (.cse6 (= (mod ~y$r_buff0_thd2~0_In-1775114838 256) 0)) (.cse4 (= (mod ~y$w_buff0_used~0_In-1775114838 256) 0)) (.cse1 (= |P1Thread1of1ForFork1_#t~ite24_Out-1775114838| |P1Thread1of1ForFork1_#t~ite23_Out-1775114838|)) (.cse0 (= (mod ~weak$$choice2~0_In-1775114838 256) 0))) (or (let ((.cse3 (not .cse6))) (and .cse0 .cse1 (or (not .cse2) .cse3) (not .cse4) (= |P1Thread1of1ForFork1_#t~ite22_Out-1775114838| 0) (or (not .cse5) .cse3) (= |P1Thread1of1ForFork1_#t~ite22_Out-1775114838| |P1Thread1of1ForFork1_#t~ite23_Out-1775114838|))) (and (or (and .cse0 (= ~y$w_buff1_used~0_In-1775114838 |P1Thread1of1ForFork1_#t~ite23_Out-1775114838|) (or (and .cse5 .cse6) (and .cse2 .cse6) .cse4) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite23_In-1775114838| |P1Thread1of1ForFork1_#t~ite23_Out-1775114838|) (= ~y$w_buff1_used~0_In-1775114838 |P1Thread1of1ForFork1_#t~ite24_Out-1775114838|) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite22_In-1775114838| |P1Thread1of1ForFork1_#t~ite22_Out-1775114838|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1775114838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1775114838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1775114838|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1775114838|, ~weak$$choice2~0=~weak$$choice2~0_In-1775114838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1775114838} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1775114838, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1775114838, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1775114838, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1775114838|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1775114838|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1775114838|, ~weak$$choice2~0=~weak$$choice2~0_In-1775114838, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1775114838} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 17:14:23,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-711726031 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-711726031 256))) (.cse3 (= (mod ~y$r_buff1_thd1~0_In-711726031 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-711726031 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-711726031 |P0Thread1of1ForFork0_#t~ite6_Out-711726031|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-711726031|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-711726031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-711726031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-711726031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-711726031} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-711726031|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-711726031, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-711726031, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-711726031, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-711726031} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 17:14:23,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-1768948669 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1768948669 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-1768948669) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-1768948669 ~y$r_buff0_thd1~0_Out-1768948669) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768948669, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1768948669} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1768948669, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1768948669|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1768948669} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:14:23,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-273682797 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-273682797 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-273682797 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-273682797 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-273682797| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-273682797| ~y$r_buff1_thd1~0_In-273682797)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-273682797, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-273682797, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-273682797, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273682797} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-273682797, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-273682797, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-273682797|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-273682797, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-273682797} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 17:14:23,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310) (not (= (mod v_~weak$$choice2~0_88 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_88, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 17:14:23,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In2037204824 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In2037204824 |P1Thread1of1ForFork1_#t~ite29_Out2037204824|) (= |P1Thread1of1ForFork1_#t~ite30_Out2037204824| |P1Thread1of1ForFork1_#t~ite29_Out2037204824|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In2037204824 256) 0))) (or (= (mod ~y$w_buff0_used~0_In2037204824 256) 0) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In2037204824 256))) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In2037204824 256) 0)))) .cse1) (and (not .cse1) (= ~y$r_buff1_thd2~0_In2037204824 |P1Thread1of1ForFork1_#t~ite30_Out2037204824|) (= |P1Thread1of1ForFork1_#t~ite29_In2037204824| |P1Thread1of1ForFork1_#t~ite29_Out2037204824|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2037204824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In2037204824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2037204824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2037204824, ~weak$$choice2~0=~weak$$choice2~0_In2037204824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2037204824} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2037204824, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out2037204824|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out2037204824|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2037204824, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2037204824, ~weak$$choice2~0=~weak$$choice2~0_In2037204824, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2037204824} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 17:14:23,599 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 17:14:23,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1520118846 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1520118846 256)))) (or (and (= ~y~0_In1520118846 |P1Thread1of1ForFork1_#t~ite32_Out1520118846|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite32_Out1520118846| ~y$w_buff1~0_In1520118846)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1520118846, ~y$w_buff1~0=~y$w_buff1~0_In1520118846, ~y~0=~y~0_In1520118846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520118846} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1520118846, ~y$w_buff1~0=~y$w_buff1~0_In1520118846, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1520118846|, ~y~0=~y~0_In1520118846, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1520118846} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 17:14:23,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-27 17:14:23,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1692056377 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1692056377 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1692056377|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1692056377 |P1Thread1of1ForFork1_#t~ite34_Out1692056377|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1692056377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1692056377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1692056377, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1692056377, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1692056377|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 17:14:23,601 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1394281640 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1394281640 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1394281640 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1394281640 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out1394281640| 0)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out1394281640| ~y$w_buff1_used~0_In1394281640) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1394281640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394281640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394281640, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394281640} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1394281640, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1394281640, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1394281640, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out1394281640|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1394281640} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 17:14:23,602 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1155599383 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In1155599383 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In1155599383 |P1Thread1of1ForFork1_#t~ite36_Out1155599383|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1155599383|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1155599383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1155599383} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1155599383, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1155599383, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1155599383|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 17:14:23,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In1332296858 256))) (.cse0 (= (mod ~y$r_buff1_thd2~0_In1332296858 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In1332296858 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In1332296858 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1332296858 |P1Thread1of1ForFork1_#t~ite37_Out1332296858|)) (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out1332296858|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1332296858, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1332296858, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1332296858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332296858} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1332296858, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1332296858, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1332296858, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1332296858|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1332296858} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 17:14:23,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} 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 17:14:23,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42} 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 17:14:23,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 17:14:23,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In452000607 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In452000607 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out452000607| ~y$w_buff1~0_In452000607) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out452000607| ~y~0_In452000607)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In452000607, ~y~0=~y~0_In452000607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out452000607|, ~y$w_buff1~0=~y$w_buff1~0_In452000607, ~y~0=~y~0_In452000607, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452000607, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452000607} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 17:14:23,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 17:14:23,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-364613894 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-364613894 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-364613894| ~y$w_buff0_used~0_In-364613894) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite42_Out-364613894| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-364613894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-364613894} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-364613894, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-364613894, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-364613894|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:14:23,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1483292742 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1483292742 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In1483292742 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1483292742 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite43_Out1483292742| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite43_Out1483292742| ~y$w_buff1_used~0_In1483292742)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1483292742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1483292742, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1483292742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1483292742} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1483292742, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1483292742, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1483292742|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1483292742, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1483292742} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 17:14:23,606 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In2079856697 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2079856697 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out2079856697| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out2079856697| ~y$r_buff0_thd0~0_In2079856697) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2079856697, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2079856697} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2079856697, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2079856697, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2079856697|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 17:14:23,607 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-262253249 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-262253249 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-262253249 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-262253249 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out-262253249| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out-262253249| ~y$r_buff1_thd0~0_In-262253249) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-262253249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-262253249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262253249, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262253249} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-262253249, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-262253249, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-262253249, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-262253249|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-262253249} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:14:23,608 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_19) (= 0 v_~__unbuffered_p0_EAX~0_47)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_47, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, 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 17:14:23,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:14:23 BasicIcfg [2019-12-27 17:14:23,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:14:23,674 INFO L168 Benchmark]: Toolchain (without parser) took 15287.95 ms. Allocated memory was 140.0 MB in the beginning and 697.8 MB in the end (delta: 557.8 MB). Free memory was 101.5 MB in the beginning and 376.6 MB in the end (delta: -275.1 MB). Peak memory consumption was 282.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,675 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.05 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,677 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.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 17:14:23,677 INFO L168 Benchmark]: Boogie Preprocessor took 38.99 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,678 INFO L168 Benchmark]: RCFGBuilder took 740.67 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 109.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,679 INFO L168 Benchmark]: TraceAbstraction took 13651.75 ms. Allocated memory was 204.5 MB in the beginning and 697.8 MB in the end (delta: 493.4 MB). Free memory was 108.4 MB in the beginning and 376.6 MB in the end (delta: -268.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 7.1 GB. [2019-12-27 17:14:23,683 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.05 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 101.3 MB in the beginning and 157.7 MB in the end (delta: -56.4 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.11 ms. Allocated memory is still 204.5 MB. Free memory was 157.7 MB in the beginning and 155.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 38.99 ms. Allocated memory is still 204.5 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 740.67 ms. Allocated memory is still 204.5 MB. Free memory was 153.2 MB in the beginning and 109.1 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13651.75 ms. Allocated memory was 204.5 MB in the beginning and 697.8 MB in the end (delta: 493.4 MB). Free memory was 108.4 MB in the beginning and 376.6 MB in the end (delta: -268.2 MB). Peak memory consumption was 225.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4653 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 209 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t1281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t1282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_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] [L738] 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_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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] [L752] 2 x = 1 [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L759] 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_p0_EAX=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=1, 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] [L738] 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) [L759] 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) [L760] EXPR 2 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_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))=1, x=1, 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] [L760] 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)) [L761] 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_p0_EAX=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=1, 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] [L761] 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)) [L762] 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)) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 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 [L765] 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)) [L766] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, 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] [L771] 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_p0_EAX=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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=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=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 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, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1295 SDtfs, 1498 SDslu, 2451 SDs, 0 SdLazy, 1214 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 22 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 11 MinimizatonAttempts, 5640 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 367 NumberOfCodeBlocks, 367 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 304 ConstructedInterpolants, 0 QuantifiedInterpolants, 32918 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...