/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:26:52,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:26:52,100 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:26:52,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:26:52,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:26:52,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:26:52,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:26:52,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:26:52,129 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:26:52,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:26:52,131 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:26:52,132 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:26:52,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:26:52,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:26:52,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:26:52,135 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:26:52,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:26:52,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:26:52,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:26:52,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:26:52,147 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:26:52,148 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:26:52,149 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:26:52,152 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:26:52,154 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:26:52,154 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:26:52,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:26:52,157 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:26:52,157 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:26:52,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:26:52,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:26:52,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:26:52,162 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:26:52,162 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:26:52,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:26:52,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:26:52,166 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:26:52,168 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:26:52,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:26:52,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:26:52,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:26:52,173 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:26:52,186 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:26:52,187 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:26:52,188 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:26:52,188 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:26:52,188 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:26:52,188 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:26:52,188 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:26:52,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:26:52,190 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:26:52,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:26:52,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:26:52,190 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:26:52,190 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:26:52,190 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:26:52,191 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:26:52,191 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:26:52,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:26:52,191 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:26:52,191 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:26:52,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:26:52,503 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:26:52,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:26:52,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:26:52,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:26:52,527 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:26:52,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-18 12:26:52,596 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f28e94b7/c6db43b6606749ca833484200204b9db/FLAG7322d877f [2019-12-18 12:26:53,172 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:26:53,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_pso.oepc.i [2019-12-18 12:26:53,193 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f28e94b7/c6db43b6606749ca833484200204b9db/FLAG7322d877f [2019-12-18 12:26:53,419 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f28e94b7/c6db43b6606749ca833484200204b9db [2019-12-18 12:26:53,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:26:53,432 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:26:53,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:26:53,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:26:53,437 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:26:53,438 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:26:53" (1/1) ... [2019-12-18 12:26:53,441 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1edfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:53, skipping insertion in model container [2019-12-18 12:26:53,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:26:53" (1/1) ... [2019-12-18 12:26:53,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:26:53,503 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:26:54,044 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:26:54,056 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:26:54,112 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:26:54,192 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:26:54,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54 WrapperNode [2019-12-18 12:26:54,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:26:54,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:26:54,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:26:54,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:26:54,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,222 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:26:54,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:26:54,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:26:54,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:26:54,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,291 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (1/1) ... [2019-12-18 12:26:54,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:26:54,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:26:54,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:26:54,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:26:54,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (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-18 12:26:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:26:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:26:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:26:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:26:54,380 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:26:54,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:26:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:26:54,381 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:26:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:26:54,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:26:54,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:26:54,383 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:26:55,063 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:26:55,063 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:26:55,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:26:55 BoogieIcfgContainer [2019-12-18 12:26:55,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:26:55,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:26:55,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:26:55,070 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:26:55,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:26:53" (1/3) ... [2019-12-18 12:26:55,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0e2850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:26:55, skipping insertion in model container [2019-12-18 12:26:55,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:26:54" (2/3) ... [2019-12-18 12:26:55,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0e2850 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:26:55, skipping insertion in model container [2019-12-18 12:26:55,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:26:55" (3/3) ... [2019-12-18 12:26:55,074 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_pso.oepc.i [2019-12-18 12:26:55,086 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:26:55,086 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:26:55,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:26:55,096 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:26:55,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,138 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,182 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,183 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,184 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,184 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,185 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,185 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,191 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,192 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,210 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,211 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,212 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,213 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,213 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:26:55,228 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 12:26:55,249 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:26:55,249 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:26:55,249 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:26:55,249 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:26:55,249 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:26:55,249 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:26:55,250 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:26:55,250 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:26:55,267 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-18 12:26:55,269 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 12:26:55,366 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 12:26:55,367 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:26:55,387 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:26:55,407 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-18 12:26:55,466 INFO L126 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-18 12:26:55,466 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:26:55,472 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 338 event pairs. 6/143 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 12:26:55,486 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 12:26:55,487 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:26:59,672 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-18 12:27:00,420 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 12:27:00,557 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-18 12:27:00,843 INFO L206 etLargeBlockEncoding]: Checked pairs total: 77720 [2019-12-18 12:27:00,843 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-18 12:27:00,847 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 12:27:01,355 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8912 states. [2019-12-18 12:27:01,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8912 states. [2019-12-18 12:27:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:27:01,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:01,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:27:01,367 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:01,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-18 12:27:01,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:01,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437429981] [2019-12-18 12:27:01,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:01,738 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-18 12:27:01,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437429981] [2019-12-18 12:27:01,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:01,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:27:01,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73790342] [2019-12-18 12:27:01,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:01,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:01,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:01,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:01,769 INFO L87 Difference]: Start difference. First operand 8912 states. Second operand 3 states. [2019-12-18 12:27:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:02,002 INFO L93 Difference]: Finished difference Result 8760 states and 28314 transitions. [2019-12-18 12:27:02,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:02,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:27:02,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:02,114 INFO L225 Difference]: With dead ends: 8760 [2019-12-18 12:27:02,114 INFO L226 Difference]: Without dead ends: 7798 [2019-12-18 12:27:02,115 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-18 12:27:02,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7798 states. [2019-12-18 12:27:02,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7798 to 7798. [2019-12-18 12:27:02,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7798 states. [2019-12-18 12:27:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 25120 transitions. [2019-12-18 12:27:02,533 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 25120 transitions. Word has length 3 [2019-12-18 12:27:02,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:02,533 INFO L462 AbstractCegarLoop]: Abstraction has 7798 states and 25120 transitions. [2019-12-18 12:27:02,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 25120 transitions. [2019-12-18 12:27:02,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:27:02,541 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:02,541 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:02,541 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:02,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:02,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-18 12:27:02,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:02,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408700287] [2019-12-18 12:27:02,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:02,633 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-18 12:27:02,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408700287] [2019-12-18 12:27:02,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:02,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:02,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677285795] [2019-12-18 12:27:02,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:02,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:02,636 INFO L87 Difference]: Start difference. First operand 7798 states and 25120 transitions. Second operand 3 states. [2019-12-18 12:27:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:02,657 INFO L93 Difference]: Finished difference Result 1232 states and 2767 transitions. [2019-12-18 12:27:02,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:02,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 12:27:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:02,665 INFO L225 Difference]: With dead ends: 1232 [2019-12-18 12:27:02,665 INFO L226 Difference]: Without dead ends: 1232 [2019-12-18 12:27:02,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:02,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-12-18 12:27:02,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1232. [2019-12-18 12:27:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2019-12-18 12:27:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 2767 transitions. [2019-12-18 12:27:02,698 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 2767 transitions. Word has length 11 [2019-12-18 12:27:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:02,698 INFO L462 AbstractCegarLoop]: Abstraction has 1232 states and 2767 transitions. [2019-12-18 12:27:02,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:02,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 2767 transitions. [2019-12-18 12:27:02,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 12:27:02,700 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:02,701 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:02,703 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-18 12:27:02,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:02,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008662054] [2019-12-18 12:27:02,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:02,807 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-18 12:27:02,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008662054] [2019-12-18 12:27:02,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:02,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:02,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957074845] [2019-12-18 12:27:02,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:27:02,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:02,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:27:02,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:27:02,809 INFO L87 Difference]: Start difference. First operand 1232 states and 2767 transitions. Second operand 5 states. [2019-12-18 12:27:03,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:03,116 INFO L93 Difference]: Finished difference Result 1829 states and 4038 transitions. [2019-12-18 12:27:03,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:27:03,117 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 12:27:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:03,127 INFO L225 Difference]: With dead ends: 1829 [2019-12-18 12:27:03,127 INFO L226 Difference]: Without dead ends: 1829 [2019-12-18 12:27:03,127 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-18 12:27:03,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2019-12-18 12:27:03,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1572. [2019-12-18 12:27:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1572 states. [2019-12-18 12:27:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1572 states to 1572 states and 3508 transitions. [2019-12-18 12:27:03,168 INFO L78 Accepts]: Start accepts. Automaton has 1572 states and 3508 transitions. Word has length 14 [2019-12-18 12:27:03,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:03,169 INFO L462 AbstractCegarLoop]: Abstraction has 1572 states and 3508 transitions. [2019-12-18 12:27:03,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:27:03,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1572 states and 3508 transitions. [2019-12-18 12:27:03,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:27:03,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:03,171 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-18 12:27:03,171 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:03,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:03,172 INFO L82 PathProgramCache]: Analyzing trace with hash 603755618, now seen corresponding path program 1 times [2019-12-18 12:27:03,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:03,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456465775] [2019-12-18 12:27:03,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:03,334 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-18 12:27:03,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456465775] [2019-12-18 12:27:03,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:03,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:27:03,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855541765] [2019-12-18 12:27:03,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:27:03,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:27:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:27:03,336 INFO L87 Difference]: Start difference. First operand 1572 states and 3508 transitions. Second operand 6 states. [2019-12-18 12:27:03,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:03,735 INFO L93 Difference]: Finished difference Result 2337 states and 5011 transitions. [2019-12-18 12:27:03,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:27:03,736 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 12:27:03,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:03,749 INFO L225 Difference]: With dead ends: 2337 [2019-12-18 12:27:03,749 INFO L226 Difference]: Without dead ends: 2337 [2019-12-18 12:27:03,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:27:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2337 states. [2019-12-18 12:27:03,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2337 to 1705. [2019-12-18 12:27:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-12-18 12:27:03,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 3772 transitions. [2019-12-18 12:27:03,795 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 3772 transitions. Word has length 24 [2019-12-18 12:27:03,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:03,796 INFO L462 AbstractCegarLoop]: Abstraction has 1705 states and 3772 transitions. [2019-12-18 12:27:03,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:27:03,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 3772 transitions. [2019-12-18 12:27:03,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:27:03,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:03,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:03,799 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:03,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:03,799 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-18 12:27:03,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:03,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922293106] [2019-12-18 12:27:03,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:03,847 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-18 12:27:03,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922293106] [2019-12-18 12:27:03,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:03,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:27:03,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049912209] [2019-12-18 12:27:03,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:03,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:03,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:03,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:03,850 INFO L87 Difference]: Start difference. First operand 1705 states and 3772 transitions. Second operand 3 states. [2019-12-18 12:27:03,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:03,863 INFO L93 Difference]: Finished difference Result 1704 states and 3770 transitions. [2019-12-18 12:27:03,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:03,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-18 12:27:03,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:03,873 INFO L225 Difference]: With dead ends: 1704 [2019-12-18 12:27:03,874 INFO L226 Difference]: Without dead ends: 1704 [2019-12-18 12:27:03,874 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-18 12:27:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1704 states. [2019-12-18 12:27:03,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1704 to 1704. [2019-12-18 12:27:03,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 12:27:03,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3770 transitions. [2019-12-18 12:27:03,912 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3770 transitions. Word has length 26 [2019-12-18 12:27:03,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:03,912 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3770 transitions. [2019-12-18 12:27:03,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:03,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3770 transitions. [2019-12-18 12:27:03,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:27:03,915 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:03,915 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-18 12:27:03,915 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:03,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:03,916 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-18 12:27:03,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:03,916 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241823841] [2019-12-18 12:27:03,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:03,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-18 12:27:03,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241823841] [2019-12-18 12:27:03,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:03,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:03,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699038582] [2019-12-18 12:27:03,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:27:03,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:03,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:27:03,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:03,970 INFO L87 Difference]: Start difference. First operand 1704 states and 3770 transitions. Second operand 4 states. [2019-12-18 12:27:03,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:04,000 INFO L93 Difference]: Finished difference Result 2700 states and 6022 transitions. [2019-12-18 12:27:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:27:04,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-18 12:27:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:04,007 INFO L225 Difference]: With dead ends: 2700 [2019-12-18 12:27:04,007 INFO L226 Difference]: Without dead ends: 1250 [2019-12-18 12:27:04,008 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-18 12:27:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-12-18 12:27:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1233. [2019-12-18 12:27:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1233 states. [2019-12-18 12:27:04,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2691 transitions. [2019-12-18 12:27:04,034 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2691 transitions. Word has length 27 [2019-12-18 12:27:04,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:04,035 INFO L462 AbstractCegarLoop]: Abstraction has 1233 states and 2691 transitions. [2019-12-18 12:27:04,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:27:04,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2691 transitions. [2019-12-18 12:27:04,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 12:27:04,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:04,037 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-18 12:27:04,037 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:04,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:04,038 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-18 12:27:04,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:04,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393262215] [2019-12-18 12:27:04,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:04,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:04,113 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-18 12:27:04,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393262215] [2019-12-18 12:27:04,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:04,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:27:04,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108250208] [2019-12-18 12:27:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:27:04,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:27:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:27:04,115 INFO L87 Difference]: Start difference. First operand 1233 states and 2691 transitions. Second operand 5 states. [2019-12-18 12:27:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:04,588 INFO L93 Difference]: Finished difference Result 1899 states and 4075 transitions. [2019-12-18 12:27:04,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:27:04,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 12:27:04,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:04,596 INFO L225 Difference]: With dead ends: 1899 [2019-12-18 12:27:04,597 INFO L226 Difference]: Without dead ends: 1899 [2019-12-18 12:27:04,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:27:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2019-12-18 12:27:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1704. [2019-12-18 12:27:04,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1704 states. [2019-12-18 12:27:04,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1704 states to 1704 states and 3701 transitions. [2019-12-18 12:27:04,656 INFO L78 Accepts]: Start accepts. Automaton has 1704 states and 3701 transitions. Word has length 27 [2019-12-18 12:27:04,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:04,657 INFO L462 AbstractCegarLoop]: Abstraction has 1704 states and 3701 transitions. [2019-12-18 12:27:04,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:27:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1704 states and 3701 transitions. [2019-12-18 12:27:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:27:04,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:04,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:04,661 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:04,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:04,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-18 12:27:04,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:04,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641159182] [2019-12-18 12:27:04,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:04,721 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-18 12:27:04,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641159182] [2019-12-18 12:27:04,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:04,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:27:04,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37254519] [2019-12-18 12:27:04,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:27:04,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:27:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:04,724 INFO L87 Difference]: Start difference. First operand 1704 states and 3701 transitions. Second operand 4 states. [2019-12-18 12:27:04,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:04,776 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-18 12:27:04,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:27:04,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-18 12:27:04,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:04,784 INFO L225 Difference]: With dead ends: 921 [2019-12-18 12:27:04,785 INFO L226 Difference]: Without dead ends: 824 [2019-12-18 12:27:04,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:27:04,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-18 12:27:04,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-18 12:27:04,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-18 12:27:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-18 12:27:04,804 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-18 12:27:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:04,805 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-18 12:27:04,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:27:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-18 12:27:04,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:27:04,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:04,810 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] [2019-12-18 12:27:04,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:04,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:04,810 INFO L82 PathProgramCache]: Analyzing trace with hash -317989854, now seen corresponding path program 1 times [2019-12-18 12:27:04,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:04,815 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268037325] [2019-12-18 12:27:04,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:04,948 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-18 12:27:04,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268037325] [2019-12-18 12:27:04,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:04,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:27:04,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441676580] [2019-12-18 12:27:04,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:04,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:04,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:04,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:04,951 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 7 states. [2019-12-18 12:27:05,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:05,135 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-18 12:27:05,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 12:27:05,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 12:27:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:05,139 INFO L225 Difference]: With dead ends: 1342 [2019-12-18 12:27:05,140 INFO L226 Difference]: Without dead ends: 903 [2019-12-18 12:27:05,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:27:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-18 12:27:05,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-18 12:27:05,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-18 12:27:05,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-18 12:27:05,155 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 50 [2019-12-18 12:27:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:05,156 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-18 12:27:05,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-18 12:27:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:27:05,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:05,158 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] [2019-12-18 12:27:05,158 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1216040192, now seen corresponding path program 2 times [2019-12-18 12:27:05,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:05,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953121911] [2019-12-18 12:27:05,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:05,267 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-18 12:27:05,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953121911] [2019-12-18 12:27:05,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:05,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:27:05,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786913863] [2019-12-18 12:27:05,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:27:05,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:05,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:27:05,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:27:05,269 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 7 states. [2019-12-18 12:27:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:05,915 INFO L93 Difference]: Finished difference Result 1033 states and 2141 transitions. [2019-12-18 12:27:05,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:27:05,916 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-18 12:27:05,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:05,919 INFO L225 Difference]: With dead ends: 1033 [2019-12-18 12:27:05,919 INFO L226 Difference]: Without dead ends: 1027 [2019-12-18 12:27:05,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:27:05,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-12-18 12:27:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 827. [2019-12-18 12:27:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-18 12:27:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1729 transitions. [2019-12-18 12:27:05,936 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1729 transitions. Word has length 50 [2019-12-18 12:27:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:05,937 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1729 transitions. [2019-12-18 12:27:05,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:27:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1729 transitions. [2019-12-18 12:27:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-18 12:27:05,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:05,939 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] [2019-12-18 12:27:05,940 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1826446246, now seen corresponding path program 3 times [2019-12-18 12:27:05,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:05,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133419949] [2019-12-18 12:27:05,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:06,006 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-18 12:27:06,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133419949] [2019-12-18 12:27:06,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:06,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:06,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520578800] [2019-12-18 12:27:06,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:06,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:06,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:06,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:06,009 INFO L87 Difference]: Start difference. First operand 827 states and 1729 transitions. Second operand 3 states. [2019-12-18 12:27:06,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:06,054 INFO L93 Difference]: Finished difference Result 1100 states and 2305 transitions. [2019-12-18 12:27:06,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:06,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-18 12:27:06,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:06,057 INFO L225 Difference]: With dead ends: 1100 [2019-12-18 12:27:06,058 INFO L226 Difference]: Without dead ends: 1100 [2019-12-18 12:27:06,058 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-18 12:27:06,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2019-12-18 12:27:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 884. [2019-12-18 12:27:06,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 884 states. [2019-12-18 12:27:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1865 transitions. [2019-12-18 12:27:06,074 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1865 transitions. Word has length 50 [2019-12-18 12:27:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:06,076 INFO L462 AbstractCegarLoop]: Abstraction has 884 states and 1865 transitions. [2019-12-18 12:27:06,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1865 transitions. [2019-12-18 12:27:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 12:27:06,078 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:06,078 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-18 12:27:06,078 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:06,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:06,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1408508718, now seen corresponding path program 1 times [2019-12-18 12:27:06,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:06,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578864000] [2019-12-18 12:27:06,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:27:06,166 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-18 12:27:06,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578864000] [2019-12-18 12:27:06,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:27:06,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:27:06,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337794966] [2019-12-18 12:27:06,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:27:06,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:27:06,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:27:06,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:27:06,168 INFO L87 Difference]: Start difference. First operand 884 states and 1865 transitions. Second operand 3 states. [2019-12-18 12:27:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:27:06,184 INFO L93 Difference]: Finished difference Result 883 states and 1863 transitions. [2019-12-18 12:27:06,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:27:06,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 12:27:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:27:06,187 INFO L225 Difference]: With dead ends: 883 [2019-12-18 12:27:06,188 INFO L226 Difference]: Without dead ends: 883 [2019-12-18 12:27:06,188 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-18 12:27:06,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-18 12:27:06,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 789. [2019-12-18 12:27:06,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-12-18 12:27:06,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1685 transitions. [2019-12-18 12:27:06,202 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1685 transitions. Word has length 51 [2019-12-18 12:27:06,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:27:06,203 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1685 transitions. [2019-12-18 12:27:06,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:27:06,203 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1685 transitions. [2019-12-18 12:27:06,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 12:27:06,205 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:27:06,205 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:27:06,206 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:27:06,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:27:06,206 INFO L82 PathProgramCache]: Analyzing trace with hash 355104308, now seen corresponding path program 1 times [2019-12-18 12:27:06,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:27:06,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029951391] [2019-12-18 12:27:06,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:27:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:06,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:27:06,409 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:27:06,409 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:27:06,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~y$r_buff0_thd2~0_418) (= v_~main$tmp_guard0~0_19 0) (= 0 v_~__unbuffered_cnt~0_61) (= v_~y$r_buff0_thd0~0_150 0) (= v_~y$r_buff1_thd1~0_136 0) (= 0 v_~y$w_buff0~0_517) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd2~0_265) (= v_~weak$$choice2~0_161 0) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27| 1)) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$flush_delayed~0_39) (= v_~__unbuffered_p1_EBX~0_45 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t309~0.base_27| 4)) (= |v_ULTIMATE.start_main_~#t309~0.offset_19| 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~y$r_buff0_thd1~0_219 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$w_buff1~0_303 0) (= 0 |v_#NULL.base_6|) (= v_~y$r_buff1_thd0~0_161 0) (= 0 v_~weak$$choice0~0_24) (= 0 v_~__unbuffered_p0_EAX~0_105) (= v_~main$tmp_guard1~0_47 0) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t309~0.base_27|) (= v_~x~0_99 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t309~0.base_27|) 0) (= v_~y~0_150 0) (= v_~y$w_buff1_used~0_497 0) (= v_~y$w_buff0_used~0_750 0) (= v_~y$mem_tmp~0_25 0) (= 0 v_~__unbuffered_p1_EAX~0_50) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t309~0.base_27|) |v_ULTIMATE.start_main_~#t309~0.offset_19| 0)) |v_#memory_int_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_750, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_28|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_47, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_34|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_87|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_42|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_136, ~y$mem_tmp~0=v_~y$mem_tmp~0_25, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_105, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_50, ~y$w_buff0~0=v_~y$w_buff0~0_517, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_219, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, #length=|v_#length_17|, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t309~0.offset=|v_ULTIMATE.start_main_~#t309~0.offset_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_45, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_20|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t309~0.base=|v_ULTIMATE.start_main_~#t309~0.base_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ~weak$$choice0~0=v_~weak$$choice0~0_24, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_36|, ~y$w_buff1~0=v_~y$w_buff1~0_303, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_30|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_150, #valid=|v_#valid_61|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_418, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_18|, ~weak$$choice2~0=v_~weak$$choice2~0_161, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_161, ~x~0=v_~x~0_99, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_497} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t310~0.base, #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, ~y~0, ULTIMATE.start_main_~#t309~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t310~0.offset, #NULL.base, ULTIMATE.start_main_~#t309~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-18 12:27:06,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10|)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t310~0.base_10| 4)) (not (= |v_ULTIMATE.start_main_~#t310~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t310~0.offset_9| 0) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t310~0.base_10|) |v_ULTIMATE.start_main_~#t310~0.offset_9| 1)) |v_#memory_int_5|) (= (store |v_#valid_20| |v_ULTIMATE.start_main_~#t310~0.base_10| 1) |v_#valid_19|) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t310~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t310~0.base=|v_ULTIMATE.start_main_~#t310~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t310~0.offset=|v_ULTIMATE.start_main_~#t310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t310~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t310~0.offset] because there is no mapped edge [2019-12-18 12:27:06,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (= ~y$r_buff0_thd0~0_In1262905356 ~y$r_buff1_thd0~0_Out1262905356) (= ~y$r_buff0_thd1~0_In1262905356 ~y$r_buff1_thd1~0_Out1262905356) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1262905356)) (= 1 ~y$r_buff0_thd1~0_Out1262905356) (= ~y$r_buff1_thd2~0_Out1262905356 ~y$r_buff0_thd2~0_In1262905356) (= ~x~0_In1262905356 ~__unbuffered_p0_EAX~0_Out1262905356)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1262905356, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1262905356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1262905356, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1262905356, ~x~0=~x~0_In1262905356} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1262905356, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1262905356, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1262905356, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1262905356, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1262905356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1262905356, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In1262905356, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1262905356, ~x~0=~x~0_In1262905356} 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-18 12:27:06,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-59364986 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-59364986 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-59364986|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-59364986 |P0Thread1of1ForFork0_#t~ite5_Out-59364986|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-59364986, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-59364986} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-59364986|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-59364986, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-59364986} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 12:27:06,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1100765108 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-1100765108 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1100765108 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-1100765108 256) 0))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-1100765108|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1100765108 |P0Thread1of1ForFork0_#t~ite6_Out-1100765108|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1100765108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100765108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1100765108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100765108} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1100765108|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1100765108, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1100765108, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1100765108, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1100765108} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 12:27:06,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1754712552 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1754712552 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd1~0_Out-1754712552)) (and (= ~y$r_buff0_thd1~0_In-1754712552 ~y$r_buff0_thd1~0_Out-1754712552) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754712552, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1754712552} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754712552, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1754712552|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-1754712552} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:27:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1780266392 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1780266392 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1780266392 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1780266392 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1780266392| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1780266392| ~y$r_buff1_thd1~0_In-1780266392) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1780266392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780266392, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1780266392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780266392} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1780266392, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780266392, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1780266392|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1780266392, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780266392} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 12:27:06,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_51 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_51, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} 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-18 12:27:06,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In952551228 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite17_In952551228| |P1Thread1of1ForFork1_#t~ite17_Out952551228|) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite18_Out952551228| ~y$w_buff1~0_In952551228)) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite18_Out952551228| |P1Thread1of1ForFork1_#t~ite17_Out952551228|) (= ~y$w_buff1~0_In952551228 |P1Thread1of1ForFork1_#t~ite17_Out952551228|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In952551228 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In952551228 256)) (and .cse1 (= (mod ~y$w_buff1_used~0_In952551228 256) 0)) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In952551228 256) 0))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In952551228, ~y$w_buff1~0=~y$w_buff1~0_In952551228, ~y$w_buff0_used~0=~y$w_buff0_used~0_In952551228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952551228, ~weak$$choice2~0=~weak$$choice2~0_In952551228, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In952551228|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952551228} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In952551228, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out952551228|, ~y$w_buff1~0=~y$w_buff1~0_In952551228, ~y$w_buff0_used~0=~y$w_buff0_used~0_In952551228, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In952551228, ~weak$$choice2~0=~weak$$choice2~0_In952551228, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out952551228|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In952551228} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 12:27:06,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1761957039 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-1761957039| ~y$w_buff0_used~0_In-1761957039) (= |P1Thread1of1ForFork1_#t~ite20_Out-1761957039| |P1Thread1of1ForFork1_#t~ite21_Out-1761957039|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1761957039 256) 0))) (or (and (= (mod ~y$w_buff1_used~0_In-1761957039 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In-1761957039 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1761957039 256)) .cse1)))) (and (= |P1Thread1of1ForFork1_#t~ite20_In-1761957039| |P1Thread1of1ForFork1_#t~ite20_Out-1761957039|) (= ~y$w_buff0_used~0_In-1761957039 |P1Thread1of1ForFork1_#t~ite21_Out-1761957039|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1761957039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1761957039, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-1761957039|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1761957039, ~weak$$choice2~0=~weak$$choice2~0_In-1761957039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1761957039} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1761957039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1761957039, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-1761957039|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1761957039, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-1761957039|, ~weak$$choice2~0=~weak$$choice2~0_In-1761957039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1761957039} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 12:27:06,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1743426356 256) 0)) (.cse2 (= |P1Thread1of1ForFork1_#t~ite24_Out-1743426356| |P1Thread1of1ForFork1_#t~ite23_Out-1743426356|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1743426356 256))) (.cse4 (= (mod ~y$r_buff1_thd2~0_In-1743426356 256) 0)) (.cse6 (= 0 (mod ~y$r_buff0_thd2~0_In-1743426356 256))) (.cse5 (= 0 (mod ~y$w_buff1_used~0_In-1743426356 256)))) (or (let ((.cse3 (not .cse6))) (and .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite23_Out-1743426356| |P1Thread1of1ForFork1_#t~ite22_Out-1743426356|) .cse2 (or .cse3 (not .cse4)) (= |P1Thread1of1ForFork1_#t~ite22_Out-1743426356| 0) (or .cse3 (not .cse5)))) (and (= |P1Thread1of1ForFork1_#t~ite22_In-1743426356| |P1Thread1of1ForFork1_#t~ite22_Out-1743426356|) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite23_Out-1743426356| |P1Thread1of1ForFork1_#t~ite23_In-1743426356|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1743426356| ~y$w_buff1_used~0_In-1743426356)) (and .cse0 .cse2 (= |P1Thread1of1ForFork1_#t~ite23_Out-1743426356| ~y$w_buff1_used~0_In-1743426356) (or .cse1 (and .cse4 .cse6) (and .cse6 .cse5))))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1743426356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743426356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743426356, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1743426356|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1743426356|, ~weak$$choice2~0=~weak$$choice2~0_In-1743426356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1743426356} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1743426356, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1743426356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1743426356, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1743426356|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1743426356|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1743426356|, ~weak$$choice2~0=~weak$$choice2~0_In-1743426356, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1743426356} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 12:27:06,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L768-8-->L770: Formula: (and (= v_~y$w_buff1_used~0_417 |v_P1Thread1of1ForFork1_#t~ite24_25|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= v_~y$r_buff0_thd2~0_320 v_~y$r_buff0_thd2~0_319)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_320, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_25|, ~weak$$choice2~0=v_~weak$$choice2~0_105} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_319, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_22|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_24|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_20|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_35|, ~weak$$choice2~0=v_~weak$$choice2~0_105, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_28|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_32|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_417} 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-18 12:27:06,430 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2007535792 256) 0))) (or (let ((.cse0 (not (= (mod ~y$r_buff0_thd2~0_In-2007535792 256) 0)))) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-2007535792| |P1Thread1of1ForFork1_#t~ite29_Out-2007535792|) (= |P1Thread1of1ForFork1_#t~ite29_Out-2007535792| |P1Thread1of1ForFork1_#t~ite28_Out-2007535792|) (or .cse0 (not (= 0 (mod ~y$w_buff1_used~0_In-2007535792 256)))) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-2007535792|) (not (= 0 (mod ~y$w_buff0_used~0_In-2007535792 256))) (or (not (= (mod ~y$r_buff1_thd2~0_In-2007535792 256) 0)) .cse0) .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite29_In-2007535792| |P1Thread1of1ForFork1_#t~ite29_Out-2007535792|) (= |P1Thread1of1ForFork1_#t~ite30_Out-2007535792| ~y$r_buff1_thd2~0_In-2007535792) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite28_In-2007535792| |P1Thread1of1ForFork1_#t~ite28_Out-2007535792|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2007535792, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-2007535792|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007535792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2007535792, ~weak$$choice2~0=~weak$$choice2~0_In-2007535792, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-2007535792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007535792} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2007535792, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-2007535792|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-2007535792|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007535792, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2007535792, ~weak$$choice2~0=~weak$$choice2~0_In-2007535792, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-2007535792|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007535792} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-18 12:27:06,432 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (= v_~y~0_43 v_~y$mem_tmp~0_8) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_8, ~y$flush_delayed~0=v_~y$flush_delayed~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_8, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ~y~0=v_~y~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 12:27:06,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In115933305 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In115933305 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out115933305| |P1Thread1of1ForFork1_#t~ite32_Out115933305|))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out115933305| ~y$w_buff1~0_In115933305) .cse2) (and (= |P1Thread1of1ForFork1_#t~ite32_Out115933305| ~y~0_In115933305) (or .cse0 .cse1) .cse2))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115933305, ~y$w_buff1~0=~y$w_buff1~0_In115933305, ~y~0=~y~0_In115933305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115933305} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In115933305, ~y$w_buff1~0=~y$w_buff1~0_In115933305, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out115933305|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out115933305|, ~y~0=~y~0_In115933305, ~y$w_buff1_used~0=~y$w_buff1_used~0_In115933305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 12:27:06,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1251891273 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1251891273 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out1251891273|) (not .cse1)) (and (= ~y$w_buff0_used~0_In1251891273 |P1Thread1of1ForFork1_#t~ite34_Out1251891273|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1251891273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1251891273} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1251891273, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1251891273, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out1251891273|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 12:27:06,435 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd2~0_In-438748973 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-438748973 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-438748973 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-438748973 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite35_Out-438748973| 0)) (and (= ~y$w_buff1_used~0_In-438748973 |P1Thread1of1ForFork1_#t~ite35_Out-438748973|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-438748973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-438748973, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438748973} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-438748973, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-438748973, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-438748973, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-438748973|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-438748973} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 12:27:06,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1363311942 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1363311942 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite36_Out-1363311942|)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1363311942| ~y$r_buff0_thd2~0_In-1363311942) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1363311942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1363311942} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1363311942, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1363311942, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1363311942|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 12:27:06,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In250651665 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In250651665 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In250651665 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In250651665 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out250651665|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In250651665 |P1Thread1of1ForFork1_#t~ite37_Out250651665|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In250651665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In250651665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In250651665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In250651665} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In250651665, ~y$w_buff0_used~0=~y$w_buff0_used~0_In250651665, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In250651665, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out250651665|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In250651665} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 12:27:06,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_174 |v_P1Thread1of1ForFork1_#t~ite37_34|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_34|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_174, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_33|} 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-18 12:27:06,437 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= 2 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_6|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:27:06,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In18163978 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In18163978 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out18163978| ~y~0_In18163978) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite40_Out18163978| ~y$w_buff1~0_In18163978) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In18163978, ~y~0=~y~0_In18163978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In18163978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In18163978} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out18163978|, ~y$w_buff1~0=~y$w_buff1~0_In18163978, ~y~0=~y~0_In18163978, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In18163978, ~y$w_buff1_used~0=~y$w_buff1_used~0_In18163978} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 12:27:06,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite40_14|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~y~0=v_~y~0_34} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 12:27:06,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In68850999 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In68850999 256)))) (or (and (= ~y$w_buff0_used~0_In68850999 |ULTIMATE.start_main_#t~ite42_Out68850999|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out68850999| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In68850999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In68850999} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In68850999, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In68850999, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out68850999|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:27:06,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-951463160 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-951463160 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-951463160 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-951463160 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-951463160|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-951463160 |ULTIMATE.start_main_#t~ite43_Out-951463160|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951463160, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951463160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951463160} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-951463160, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-951463160, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-951463160|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-951463160, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-951463160} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 12:27:06,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-2092108302 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-2092108302 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In-2092108302 |ULTIMATE.start_main_#t~ite44_Out-2092108302|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-2092108302|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2092108302, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2092108302} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2092108302, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2092108302, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-2092108302|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:27:06,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In452241388 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In452241388 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In452241388 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In452241388 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In452241388 |ULTIMATE.start_main_#t~ite45_Out452241388|)) (and (= 0 |ULTIMATE.start_main_#t~ite45_Out452241388|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In452241388, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In452241388, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452241388, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452241388} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In452241388, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In452241388, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In452241388, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out452241388|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In452241388} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:27:06,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_28 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_28 0) (= 1 v_~__unbuffered_p1_EAX~0_37) (= v_~__unbuffered_p1_EBX~0_29 0) (= 0 v_~__unbuffered_p0_EAX~0_76) (= v_~y$r_buff1_thd0~0_112 |v_ULTIMATE.start_main_#t~ite45_56|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_56|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_76, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_37, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_55|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:27:06,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:27:06 BasicIcfg [2019-12-18 12:27:06,561 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:27:06,564 INFO L168 Benchmark]: Toolchain (without parser) took 13131.65 ms. Allocated memory was 137.4 MB in the beginning and 439.4 MB in the end (delta: 302.0 MB). Free memory was 101.1 MB in the beginning and 384.1 MB in the end (delta: -283.0 MB). Peak memory consumption was 281.6 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,568 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 760.13 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,569 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.04 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,570 INFO L168 Benchmark]: Boogie Preprocessor took 36.96 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,571 INFO L168 Benchmark]: RCFGBuilder took 751.20 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 106.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,571 INFO L168 Benchmark]: TraceAbstraction took 11494.32 ms. Allocated memory was 201.9 MB in the beginning and 439.4 MB in the end (delta: 237.5 MB). Free memory was 106.8 MB in the beginning and 384.1 MB in the end (delta: -277.4 MB). Peak memory consumption was 222.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:27:06,581 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 760.13 ms. Allocated memory was 137.4 MB in the beginning and 201.9 MB in the end (delta: 64.5 MB). Free memory was 100.7 MB in the beginning and 156.6 MB in the end (delta: -55.9 MB). Peak memory consumption was 26.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.04 ms. Allocated memory is still 201.9 MB. Free memory was 156.6 MB in the beginning and 153.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.96 ms. Allocated memory is still 201.9 MB. Free memory was 153.9 MB in the beginning and 151.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 751.20 ms. Allocated memory is still 201.9 MB. Free memory was 151.2 MB in the beginning and 106.8 MB in the end (delta: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11494.32 ms. Allocated memory was 201.9 MB in the beginning and 439.4 MB in the end (delta: 237.5 MB). Free memory was 106.8 MB in the beginning and 384.1 MB in the end (delta: -277.4 MB). Peak memory consumption was 222.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 148 ProgramPointsBefore, 75 ProgramPointsAfterwards, 182 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 12 FixpointIterations, 30 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 28 ChoiceCompositions, 4966 VarBasedMoverChecksPositive, 278 VarBasedMoverChecksNegative, 167 SemBasedMoverChecksPositive, 218 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 77720 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L740] 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, __unbuffered_p1_EBX=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] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L764] 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=1, __unbuffered_p1_EBX=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] [L740] 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) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 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 [L764] 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) [L765] 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=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 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)) [L766] 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)) [L767] 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)) [L770] 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)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 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 [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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 [L810] 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, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1452 SDtfs, 1228 SDslu, 2594 SDs, 0 SdLazy, 1621 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8912occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1783 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 38317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...