/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/mix025_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:00:47,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:00:47,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:00:47,204 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:00:47,204 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:00:47,207 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:00:47,209 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:00:47,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:00:47,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:00:47,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:00:47,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:00:47,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:00:47,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:00:47,233 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:00:47,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:00:47,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:00:47,238 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:00:47,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:00:47,244 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:00:47,248 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:00:47,250 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:00:47,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:00:47,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:00:47,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:00:47,259 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:00:47,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:00:47,260 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:00:47,262 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:00:47,263 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:00:47,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:00:47,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:00:47,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:00:47,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:00:47,270 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:00:47,271 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:00:47,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:00:47,274 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:00:47,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:00:47,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:00:47,275 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:00:47,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:00:47,277 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-26 22:00:47,297 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:00:47,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:00:47,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:00:47,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:00:47,300 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:00:47,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:00:47,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:00:47,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:00:47,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:00:47,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:00:47,302 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:00:47,302 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:00:47,302 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:00:47,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:00:47,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:00:47,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:00:47,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:00:47,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:00:47,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:00:47,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:00:47,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:00:47,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:00:47,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:00:47,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:00:47,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:00:47,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:00:47,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:00:47,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:00:47,306 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:00:47,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:00:47,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:00:47,586 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:00:47,589 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:00:47,591 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:00:47,591 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:00:47,592 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-26 22:00:47,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d0ca56a/fe1e8464f4354b9892ea311cbe8efea6/FLAG8f8bb3afb [2019-12-26 22:00:48,193 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:00:48,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix025_rmo.oepc.i [2019-12-26 22:00:48,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d0ca56a/fe1e8464f4354b9892ea311cbe8efea6/FLAG8f8bb3afb [2019-12-26 22:00:48,475 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48d0ca56a/fe1e8464f4354b9892ea311cbe8efea6 [2019-12-26 22:00:48,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:00:48,487 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:00:48,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:00:48,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:00:48,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:00:48,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:00:48" (1/1) ... [2019-12-26 22:00:48,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7215fff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:48, skipping insertion in model container [2019-12-26 22:00:48,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:00:48" (1/1) ... [2019-12-26 22:00:48,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:00:48,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:00:49,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:00:49,015 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:00:49,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:00:49,205 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:00:49,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49 WrapperNode [2019-12-26 22:00:49,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:00:49,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:00:49,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:00:49,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:00:49,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:00:49,271 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:00:49,271 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:00:49,271 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:00:49,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,302 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (1/1) ... [2019-12-26 22:00:49,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:00:49,317 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:00:49,317 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:00:49,317 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:00:49,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (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-26 22:00:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:00:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:00:49,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:00:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:00:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:00:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:00:49,394 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:00:49,394 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:00:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:00:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:00:49,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:00:49,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:00:49,397 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:00:50,148 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:00:50,148 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:00:50,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:00:50 BoogieIcfgContainer [2019-12-26 22:00:50,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:00:50,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:00:50,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:00:50,156 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:00:50,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:00:48" (1/3) ... [2019-12-26 22:00:50,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c85e027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:00:50, skipping insertion in model container [2019-12-26 22:00:50,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:00:49" (2/3) ... [2019-12-26 22:00:50,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c85e027 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:00:50, skipping insertion in model container [2019-12-26 22:00:50,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:00:50" (3/3) ... [2019-12-26 22:00:50,161 INFO L109 eAbstractionObserver]: Analyzing ICFG mix025_rmo.oepc.i [2019-12-26 22:00:50,175 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:00:50,175 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:00:50,184 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:00:50,185 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:00:50,231 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,232 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,233 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,234 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,242 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,276 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,277 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,277 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,277 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,278 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,279 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,280 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,281 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,282 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,283 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,284 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,285 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,286 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,287 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,289 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,290 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,291 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,292 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,293 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,294 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,295 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,296 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,297 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,298 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,299 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,300 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,301 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,302 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,303 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,310 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,312 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,318 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,319 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,320 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,320 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,320 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,320 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,326 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,327 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,327 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,328 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:00:50,346 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 22:00:50,365 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:00:50,365 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:00:50,365 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:00:50,365 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:00:50,366 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:00:50,366 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:00:50,366 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:00:50,366 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:00:50,385 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 22:00:50,387 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:00:50,514 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:00:50,514 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:00:50,531 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:00:50,560 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 22:00:50,642 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 22:00:50,642 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:00:50,650 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 424 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 22:00:50,672 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 22:00:50,673 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:00:55,740 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 22:00:55,859 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 22:00:56,109 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-26 22:00:56,110 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-26 22:00:56,113 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-26 22:01:16,991 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-26 22:01:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-26 22:01:16,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 22:01:16,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:16,999 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 22:01:17,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:17,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:17,006 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-26 22:01:17,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:17,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229993391] [2019-12-26 22:01:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:17,325 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-26 22:01:17,326 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229993391] [2019-12-26 22:01:17,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:17,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:01:17,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999756093] [2019-12-26 22:01:17,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:17,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:17,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:17,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:17,352 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-26 22:01:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:18,982 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-26 22:01:18,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:18,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 22:01:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:19,890 INFO L225 Difference]: With dead ends: 121140 [2019-12-26 22:01:19,890 INFO L226 Difference]: Without dead ends: 107958 [2019-12-26 22:01:19,892 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-26 22:01:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-26 22:01:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-26 22:01:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-26 22:01:34,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-26 22:01:34,171 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-26 22:01:34,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:34,172 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-26 22:01:34,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-26 22:01:34,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 22:01:34,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:34,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:34,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:34,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:34,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-26 22:01:34,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:34,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605339154] [2019-12-26 22:01:34,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:34,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:01:34,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605339154] [2019-12-26 22:01:34,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:34,263 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:34,263 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244898611] [2019-12-26 22:01:34,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:34,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:34,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:34,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:34,265 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-26 22:01:35,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:35,515 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-26 22:01:35,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:35,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 22:01:35,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:41,336 INFO L225 Difference]: With dead ends: 172022 [2019-12-26 22:01:41,336 INFO L226 Difference]: Without dead ends: 171924 [2019-12-26 22:01:41,337 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-26 22:01:46,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-26 22:01:49,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-26 22:01:49,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-26 22:01:49,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-26 22:01:49,910 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-26 22:01:49,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:49,911 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-26 22:01:49,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:49,911 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-26 22:01:49,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 22:01:49,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:49,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:49,919 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:49,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:49,919 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-26 22:01:49,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:49,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980369807] [2019-12-26 22:01:49,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:49,972 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-26 22:01:49,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980369807] [2019-12-26 22:01:49,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:49,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:49,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913836928] [2019-12-26 22:01:49,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:49,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:49,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:49,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:49,974 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-26 22:01:50,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:50,107 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-26 22:01:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:50,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 22:01:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:50,165 INFO L225 Difference]: With dead ends: 33388 [2019-12-26 22:01:50,165 INFO L226 Difference]: Without dead ends: 33388 [2019-12-26 22:01:50,166 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-26 22:01:50,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-26 22:01:55,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-26 22:01:55,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-26 22:01:55,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-26 22:01:55,474 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-26 22:01:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:55,474 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-26 22:01:55,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:55,474 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-26 22:01:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:55,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:55,477 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:55,477 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:55,478 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-26 22:01:55,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:55,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418551431] [2019-12-26 22:01:55,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:55,540 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-26 22:01:55,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418551431] [2019-12-26 22:01:55,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:55,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:55,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505999097] [2019-12-26 22:01:55,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:01:55,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:01:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:55,542 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-26 22:01:55,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:55,774 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-26 22:01:55,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:01:55,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 22:01:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:55,861 INFO L225 Difference]: With dead ends: 52822 [2019-12-26 22:01:55,862 INFO L226 Difference]: Without dead ends: 52822 [2019-12-26 22:01:55,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:01:56,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-26 22:01:56,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-26 22:01:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-26 22:01:56,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-26 22:01:56,610 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-26 22:01:56,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:56,612 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-26 22:01:56,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:01:56,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-26 22:01:56,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:56,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:56,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:56,615 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:56,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-26 22:01:56,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:56,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814647764] [2019-12-26 22:01:56,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:56,713 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-26 22:01:56,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814647764] [2019-12-26 22:01:56,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:56,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:56,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021784982] [2019-12-26 22:01:56,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:56,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:56,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:56,716 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-26 22:01:57,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:57,124 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-26 22:01:57,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:57,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:01:57,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:57,197 INFO L225 Difference]: With dead ends: 46903 [2019-12-26 22:01:57,197 INFO L226 Difference]: Without dead ends: 46903 [2019-12-26 22:01:57,197 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-26 22:01:57,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-26 22:01:58,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-26 22:01:58,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-26 22:01:58,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-26 22:01:58,365 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-26 22:01:58,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:58,365 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-26 22:01:58,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:58,365 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-26 22:01:58,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 22:01:58,369 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:58,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:01:58,369 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:58,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:58,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-26 22:01:58,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:58,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417935213] [2019-12-26 22:01:58,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:58,441 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-26 22:01:58,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417935213] [2019-12-26 22:01:58,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:58,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:01:58,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032606440] [2019-12-26 22:01:58,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:01:58,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:58,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:01:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:01:58,444 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-26 22:01:58,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:01:58,805 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-26 22:01:58,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:01:58,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 22:01:58,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:01:58,901 INFO L225 Difference]: With dead ends: 51478 [2019-12-26 22:01:58,901 INFO L226 Difference]: Without dead ends: 51478 [2019-12-26 22:01:58,901 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-26 22:01:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-26 22:01:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-26 22:01:59,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-26 22:01:59,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-26 22:01:59,696 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-26 22:01:59,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:01:59,697 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-26 22:01:59,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:01:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-26 22:01:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:01:59,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:01:59,707 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] [2019-12-26 22:01:59,707 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:01:59,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:01:59,707 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-26 22:01:59,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:01:59,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444696922] [2019-12-26 22:01:59,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:01:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:01:59,776 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-26 22:01:59,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444696922] [2019-12-26 22:01:59,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:01:59,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:01:59,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514972510] [2019-12-26 22:01:59,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:01:59,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:01:59,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:01:59,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:01:59,779 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-26 22:02:00,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:00,749 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-26 22:02:00,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:02:00,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:02:00,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:00,852 INFO L225 Difference]: With dead ends: 61264 [2019-12-26 22:02:00,852 INFO L226 Difference]: Without dead ends: 61250 [2019-12-26 22:02:00,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:02:01,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-26 22:02:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-26 22:02:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-26 22:02:01,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-26 22:02:01,741 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-26 22:02:01,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:01,741 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-26 22:02:01,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:01,742 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-26 22:02:01,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 22:02:01,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:01,752 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] [2019-12-26 22:02:01,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:01,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:01,752 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-26 22:02:01,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:01,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903222159] [2019-12-26 22:02:01,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:01,820 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-26 22:02:01,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903222159] [2019-12-26 22:02:01,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:01,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:01,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907456970] [2019-12-26 22:02:01,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:01,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:01,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:01,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:01,822 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-26 22:02:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:02,503 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-26 22:02:02,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:02:02,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 22:02:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:02,609 INFO L225 Difference]: With dead ends: 63752 [2019-12-26 22:02:02,609 INFO L226 Difference]: Without dead ends: 63738 [2019-12-26 22:02:02,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:02:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-26 22:02:03,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-26 22:02:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-26 22:02:03,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-26 22:02:03,920 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-26 22:02:03,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:03,920 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-26 22:02:03,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:03,920 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-26 22:02:03,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 22:02:03,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:03,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:03,932 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-26 22:02:03,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:03,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830170063] [2019-12-26 22:02:03,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:04,001 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-26 22:02:04,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830170063] [2019-12-26 22:02:04,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:04,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:04,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238909886] [2019-12-26 22:02:04,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:04,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:04,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:04,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:04,004 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-26 22:02:04,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:04,080 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-26 22:02:04,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:02:04,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 22:02:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:04,111 INFO L225 Difference]: With dead ends: 17193 [2019-12-26 22:02:04,111 INFO L226 Difference]: Without dead ends: 17193 [2019-12-26 22:02:04,112 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-26 22:02:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-26 22:02:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-26 22:02:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-26 22:02:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-26 22:02:04,363 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-26 22:02:04,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:04,364 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-26 22:02:04,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-26 22:02:04,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-26 22:02:04,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:04,376 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-26 22:02:04,376 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:04,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:04,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-26 22:02:04,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:04,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288881772] [2019-12-26 22:02:04,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:04,444 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-26 22:02:04,445 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288881772] [2019-12-26 22:02:04,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:04,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:04,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857244605] [2019-12-26 22:02:04,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:04,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:04,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:04,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:04,446 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-26 22:02:04,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:04,751 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-26 22:02:04,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:02:04,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-26 22:02:04,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:04,781 INFO L225 Difference]: With dead ends: 21613 [2019-12-26 22:02:04,781 INFO L226 Difference]: Without dead ends: 21613 [2019-12-26 22:02:04,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:04,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-26 22:02:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-26 22:02:05,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-26 22:02:05,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-26 22:02:05,078 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-26 22:02:05,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:05,078 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-26 22:02:05,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:05,079 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-26 22:02:05,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 22:02:05,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:05,094 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-26 22:02:05,094 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:05,094 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-26 22:02:05,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:05,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390106869] [2019-12-26 22:02:05,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:05,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:05,161 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-26 22:02:05,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390106869] [2019-12-26 22:02:05,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:05,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:05,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722929928] [2019-12-26 22:02:05,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:05,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:05,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:05,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:05,163 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-26 22:02:05,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:05,475 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-26 22:02:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:02:05,476 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 22:02:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:05,508 INFO L225 Difference]: With dead ends: 23624 [2019-12-26 22:02:05,509 INFO L226 Difference]: Without dead ends: 23624 [2019-12-26 22:02:05,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:05,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-26 22:02:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-26 22:02:05,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-26 22:02:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-26 22:02:05,808 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-26 22:02:05,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:05,808 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-26 22:02:05,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-26 22:02:05,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-26 22:02:05,827 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:05,827 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] [2019-12-26 22:02:05,828 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:05,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:05,828 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-26 22:02:05,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:05,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271588264] [2019-12-26 22:02:05,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:05,912 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-26 22:02:05,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271588264] [2019-12-26 22:02:05,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:05,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:02:05,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074972911] [2019-12-26 22:02:05,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:02:05,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:02:05,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:02:05,914 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-26 22:02:06,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:06,829 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-26 22:02:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:02:06,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-26 22:02:06,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:06,868 INFO L225 Difference]: With dead ends: 27031 [2019-12-26 22:02:06,868 INFO L226 Difference]: Without dead ends: 27031 [2019-12-26 22:02:06,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:02:06,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-26 22:02:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-26 22:02:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-26 22:02:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-26 22:02:07,191 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-26 22:02:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:07,192 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-26 22:02:07,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:02:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-26 22:02:07,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-26 22:02:07,214 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:07,214 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] [2019-12-26 22:02:07,214 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:07,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:07,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-26 22:02:07,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:07,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678856782] [2019-12-26 22:02:07,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:07,292 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-26 22:02:07,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678856782] [2019-12-26 22:02:07,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:07,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:02:07,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859264760] [2019-12-26 22:02:07,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:02:07,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:07,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:02:07,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:02:07,295 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-26 22:02:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:07,930 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-26 22:02:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:02:07,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-26 22:02:07,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:07,969 INFO L225 Difference]: With dead ends: 26334 [2019-12-26 22:02:07,969 INFO L226 Difference]: Without dead ends: 26334 [2019-12-26 22:02:07,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:02:08,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-26 22:02:08,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-26 22:02:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-26 22:02:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-26 22:02:08,282 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-26 22:02:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:08,282 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-26 22:02:08,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:02:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-26 22:02:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 22:02:08,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:08,300 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] [2019-12-26 22:02:08,300 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:08,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:08,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-26 22:02:08,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:08,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665727699] [2019-12-26 22:02:08,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:08,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:08,365 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-26 22:02:08,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665727699] [2019-12-26 22:02:08,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:08,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:02:08,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947472442] [2019-12-26 22:02:08,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:08,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:08,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:08,367 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-26 22:02:08,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:08,433 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-26 22:02:08,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:08,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-26 22:02:08,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:08,461 INFO L225 Difference]: With dead ends: 17641 [2019-12-26 22:02:08,461 INFO L226 Difference]: Without dead ends: 17641 [2019-12-26 22:02:08,462 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-26 22:02:08,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-26 22:02:08,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-26 22:02:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-26 22:02:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-26 22:02:08,709 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-26 22:02:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:08,710 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-26 22:02:08,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-26 22:02:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:02:08,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:08,728 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] [2019-12-26 22:02:08,728 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:08,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:08,728 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-26 22:02:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:08,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180161886] [2019-12-26 22:02:08,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:08,808 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-26 22:02:08,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180161886] [2019-12-26 22:02:08,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:08,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:02:08,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596723165] [2019-12-26 22:02:08,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:08,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:08,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:08,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:08,811 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-26 22:02:09,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:09,516 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-26 22:02:09,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:02:09,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:02:09,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:09,564 INFO L225 Difference]: With dead ends: 25346 [2019-12-26 22:02:09,564 INFO L226 Difference]: Without dead ends: 25346 [2019-12-26 22:02:09,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-26 22:02:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-26 22:02:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-26 22:02:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-26 22:02:10,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-26 22:02:10,155 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-26 22:02:10,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:10,156 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-26 22:02:10,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:10,156 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-26 22:02:10,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 22:02:10,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:10,189 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] [2019-12-26 22:02:10,189 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:10,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:10,190 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-26 22:02:10,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:10,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200622435] [2019-12-26 22:02:10,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:10,573 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-26 22:02:10,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200622435] [2019-12-26 22:02:10,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:10,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:02:10,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297593548] [2019-12-26 22:02:10,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:02:10,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:10,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:02:10,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:10,577 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-26 22:02:10,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:10,660 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-26 22:02:10,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:02:10,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-26 22:02:10,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:10,691 INFO L225 Difference]: With dead ends: 22175 [2019-12-26 22:02:10,691 INFO L226 Difference]: Without dead ends: 22175 [2019-12-26 22:02:10,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:02:10,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-26 22:02:10,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-26 22:02:10,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-26 22:02:11,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-26 22:02:11,015 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-26 22:02:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:11,016 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-26 22:02:11,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:02:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-26 22:02:11,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:02:11,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:11,046 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:11,046 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-26 22:02:11,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:11,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534138978] [2019-12-26 22:02:11,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:11,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:11,141 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-26 22:02:11,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534138978] [2019-12-26 22:02:11,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:11,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:02:11,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174347102] [2019-12-26 22:02:11,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:02:11,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:11,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:02:11,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:11,143 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-26 22:02:11,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:11,680 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-26 22:02:11,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-26 22:02:11,681 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:02:11,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:11,747 INFO L225 Difference]: With dead ends: 62478 [2019-12-26 22:02:11,747 INFO L226 Difference]: Without dead ends: 47634 [2019-12-26 22:02:11,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-26 22:02:11,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-26 22:02:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-26 22:02:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-26 22:02:12,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-26 22:02:12,284 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-26 22:02:12,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:12,284 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-26 22:02:12,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:02:12,285 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-26 22:02:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:02:12,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:12,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:12,314 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-26 22:02:12,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:12,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993141124] [2019-12-26 22:02:12,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:12,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:12,407 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-26 22:02:12,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993141124] [2019-12-26 22:02:12,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:12,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:02:12,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574841253] [2019-12-26 22:02:12,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:02:12,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:02:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:12,409 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-26 22:02:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:12,919 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-26 22:02:12,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 22:02:12,920 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:02:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:12,990 INFO L225 Difference]: With dead ends: 68433 [2019-12-26 22:02:12,990 INFO L226 Difference]: Without dead ends: 48478 [2019-12-26 22:02:12,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:02:13,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-26 22:02:13,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-26 22:02:13,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-26 22:02:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-26 22:02:14,013 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-26 22:02:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:14,013 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-26 22:02:14,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:02:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-26 22:02:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:02:14,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:14,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:14,056 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-26 22:02:14,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:14,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810414647] [2019-12-26 22:02:14,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:14,143 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-26 22:02:14,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810414647] [2019-12-26 22:02:14,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:14,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:02:14,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813095552] [2019-12-26 22:02:14,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:02:14,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:14,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:02:14,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:14,145 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-26 22:02:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:14,638 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-26 22:02:14,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:02:14,639 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:02:14,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:14,712 INFO L225 Difference]: With dead ends: 59843 [2019-12-26 22:02:14,712 INFO L226 Difference]: Without dead ends: 52762 [2019-12-26 22:02:14,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:02:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-26 22:02:15,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-26 22:02:15,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-26 22:02:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-26 22:02:15,347 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-26 22:02:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:15,347 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-26 22:02:15,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:02:15,347 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-26 22:02:15,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:02:15,379 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:15,379 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:15,379 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:15,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:15,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-26 22:02:15,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:15,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505246428] [2019-12-26 22:02:15,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:15,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:15,493 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-26 22:02:15,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505246428] [2019-12-26 22:02:15,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:15,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:02:15,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126447541] [2019-12-26 22:02:15,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:02:15,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:02:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:02:15,496 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 7 states. [2019-12-26 22:02:16,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:16,526 INFO L93 Difference]: Finished difference Result 38094 states and 116230 transitions. [2019-12-26 22:02:16,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 22:02:16,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-26 22:02:16,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:16,579 INFO L225 Difference]: With dead ends: 38094 [2019-12-26 22:02:16,579 INFO L226 Difference]: Without dead ends: 37870 [2019-12-26 22:02:16,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:02:16,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37870 states. [2019-12-26 22:02:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37870 to 31894. [2019-12-26 22:02:17,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31894 states. [2019-12-26 22:02:17,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31894 states to 31894 states and 98893 transitions. [2019-12-26 22:02:17,108 INFO L78 Accepts]: Start accepts. Automaton has 31894 states and 98893 transitions. Word has length 63 [2019-12-26 22:02:17,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:17,108 INFO L462 AbstractCegarLoop]: Abstraction has 31894 states and 98893 transitions. [2019-12-26 22:02:17,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:02:17,108 INFO L276 IsEmpty]: Start isEmpty. Operand 31894 states and 98893 transitions. [2019-12-26 22:02:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-26 22:02:17,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:17,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:17,147 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:17,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:17,148 INFO L82 PathProgramCache]: Analyzing trace with hash 232911163, now seen corresponding path program 5 times [2019-12-26 22:02:17,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:17,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989912911] [2019-12-26 22:02:17,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:17,207 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-26 22:02:17,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989912911] [2019-12-26 22:02:17,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:17,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:17,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153306936] [2019-12-26 22:02:17,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:17,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:17,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:17,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:17,209 INFO L87 Difference]: Start difference. First operand 31894 states and 98893 transitions. Second operand 3 states. [2019-12-26 22:02:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:17,360 INFO L93 Difference]: Finished difference Result 31893 states and 98891 transitions. [2019-12-26 22:02:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:17,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-26 22:02:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:17,436 INFO L225 Difference]: With dead ends: 31893 [2019-12-26 22:02:17,436 INFO L226 Difference]: Without dead ends: 31893 [2019-12-26 22:02:17,437 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-26 22:02:17,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31893 states. [2019-12-26 22:02:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31893 to 27672. [2019-12-26 22:02:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27672 states. [2019-12-26 22:02:18,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27672 states to 27672 states and 86803 transitions. [2019-12-26 22:02:18,490 INFO L78 Accepts]: Start accepts. Automaton has 27672 states and 86803 transitions. Word has length 63 [2019-12-26 22:02:18,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:18,490 INFO L462 AbstractCegarLoop]: Abstraction has 27672 states and 86803 transitions. [2019-12-26 22:02:18,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:18,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27672 states and 86803 transitions. [2019-12-26 22:02:18,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 22:02:18,547 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:18,547 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:18,548 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:18,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:18,548 INFO L82 PathProgramCache]: Analyzing trace with hash 2010713375, now seen corresponding path program 1 times [2019-12-26 22:02:18,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:18,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23548416] [2019-12-26 22:02:18,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:18,675 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-26 22:02:18,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23548416] [2019-12-26 22:02:18,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:18,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:02:18,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468275151] [2019-12-26 22:02:18,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:02:18,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:02:18,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:02:18,681 INFO L87 Difference]: Start difference. First operand 27672 states and 86803 transitions. Second operand 3 states. [2019-12-26 22:02:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:18,830 INFO L93 Difference]: Finished difference Result 24206 states and 74802 transitions. [2019-12-26 22:02:18,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:18,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 22:02:18,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:18,891 INFO L225 Difference]: With dead ends: 24206 [2019-12-26 22:02:18,891 INFO L226 Difference]: Without dead ends: 24206 [2019-12-26 22:02:18,899 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-26 22:02:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24206 states. [2019-12-26 22:02:19,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24206 to 22352. [2019-12-26 22:02:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22352 states. [2019-12-26 22:02:19,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22352 states to 22352 states and 68978 transitions. [2019-12-26 22:02:19,439 INFO L78 Accepts]: Start accepts. Automaton has 22352 states and 68978 transitions. Word has length 64 [2019-12-26 22:02:19,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:19,439 INFO L462 AbstractCegarLoop]: Abstraction has 22352 states and 68978 transitions. [2019-12-26 22:02:19,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:02:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 22352 states and 68978 transitions. [2019-12-26 22:02:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:19,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:19,471 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:19,471 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -668679299, now seen corresponding path program 1 times [2019-12-26 22:02:19,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:19,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725847122] [2019-12-26 22:02:19,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:19,567 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-26 22:02:19,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725847122] [2019-12-26 22:02:19,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:19,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:02:19,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154115525] [2019-12-26 22:02:19,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:02:19,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:19,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:02:19,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:02:19,570 INFO L87 Difference]: Start difference. First operand 22352 states and 68978 transitions. Second operand 6 states. [2019-12-26 22:02:20,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:20,459 INFO L93 Difference]: Finished difference Result 30515 states and 92745 transitions. [2019-12-26 22:02:20,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 22:02:20,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-26 22:02:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:20,530 INFO L225 Difference]: With dead ends: 30515 [2019-12-26 22:02:20,531 INFO L226 Difference]: Without dead ends: 30515 [2019-12-26 22:02:20,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:02:20,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30515 states. [2019-12-26 22:02:20,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30515 to 23430. [2019-12-26 22:02:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23430 states. [2019-12-26 22:02:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23430 states to 23430 states and 72161 transitions. [2019-12-26 22:02:20,974 INFO L78 Accepts]: Start accepts. Automaton has 23430 states and 72161 transitions. Word has length 65 [2019-12-26 22:02:20,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:20,974 INFO L462 AbstractCegarLoop]: Abstraction has 23430 states and 72161 transitions. [2019-12-26 22:02:20,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:02:20,975 INFO L276 IsEmpty]: Start isEmpty. Operand 23430 states and 72161 transitions. [2019-12-26 22:02:21,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:21,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:21,001 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:21,001 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:21,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 339295601, now seen corresponding path program 2 times [2019-12-26 22:02:21,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:21,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869005777] [2019-12-26 22:02:21,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:21,099 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-26 22:02:21,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869005777] [2019-12-26 22:02:21,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:21,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:02:21,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255945475] [2019-12-26 22:02:21,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 22:02:21,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:21,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 22:02:21,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 22:02:21,101 INFO L87 Difference]: Start difference. First operand 23430 states and 72161 transitions. Second operand 8 states. [2019-12-26 22:02:22,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:22,603 INFO L93 Difference]: Finished difference Result 31133 states and 94052 transitions. [2019-12-26 22:02:22,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-26 22:02:22,604 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-26 22:02:22,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:22,644 INFO L225 Difference]: With dead ends: 31133 [2019-12-26 22:02:22,644 INFO L226 Difference]: Without dead ends: 30917 [2019-12-26 22:02:22,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2019-12-26 22:02:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30917 states. [2019-12-26 22:02:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30917 to 22069. [2019-12-26 22:02:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22069 states. [2019-12-26 22:02:23,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22069 states to 22069 states and 68090 transitions. [2019-12-26 22:02:23,320 INFO L78 Accepts]: Start accepts. Automaton has 22069 states and 68090 transitions. Word has length 65 [2019-12-26 22:02:23,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:23,320 INFO L462 AbstractCegarLoop]: Abstraction has 22069 states and 68090 transitions. [2019-12-26 22:02:23,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 22:02:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22069 states and 68090 transitions. [2019-12-26 22:02:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:23,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:23,346 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:23,346 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:23,347 INFO L82 PathProgramCache]: Analyzing trace with hash 903189921, now seen corresponding path program 3 times [2019-12-26 22:02:23,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:23,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233632082] [2019-12-26 22:02:23,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:23,561 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-26 22:02:23,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233632082] [2019-12-26 22:02:23,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:23,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 22:02:23,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596237838] [2019-12-26 22:02:23,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 22:02:23,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:23,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 22:02:23,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 22:02:23,563 INFO L87 Difference]: Start difference. First operand 22069 states and 68090 transitions. Second operand 10 states. [2019-12-26 22:02:24,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:24,779 INFO L93 Difference]: Finished difference Result 32606 states and 100242 transitions. [2019-12-26 22:02:24,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-26 22:02:24,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-26 22:02:24,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:24,819 INFO L225 Difference]: With dead ends: 32606 [2019-12-26 22:02:24,819 INFO L226 Difference]: Without dead ends: 26805 [2019-12-26 22:02:24,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:02:24,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26805 states. [2019-12-26 22:02:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26805 to 22505. [2019-12-26 22:02:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22505 states. [2019-12-26 22:02:25,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22505 states to 22505 states and 69272 transitions. [2019-12-26 22:02:25,183 INFO L78 Accepts]: Start accepts. Automaton has 22505 states and 69272 transitions. Word has length 65 [2019-12-26 22:02:25,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:25,184 INFO L462 AbstractCegarLoop]: Abstraction has 22505 states and 69272 transitions. [2019-12-26 22:02:25,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 22:02:25,184 INFO L276 IsEmpty]: Start isEmpty. Operand 22505 states and 69272 transitions. [2019-12-26 22:02:25,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:25,209 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:25,209 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:25,210 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:25,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:25,210 INFO L82 PathProgramCache]: Analyzing trace with hash 416369971, now seen corresponding path program 4 times [2019-12-26 22:02:25,211 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:25,211 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623187221] [2019-12-26 22:02:25,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:25,426 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-26 22:02:25,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623187221] [2019-12-26 22:02:25,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:25,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:02:25,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025080524] [2019-12-26 22:02:25,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:02:25,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:25,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:02:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:02:25,428 INFO L87 Difference]: Start difference. First operand 22505 states and 69272 transitions. Second operand 11 states. [2019-12-26 22:02:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:26,792 INFO L93 Difference]: Finished difference Result 32402 states and 98705 transitions. [2019-12-26 22:02:26,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 22:02:26,792 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:02:26,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:26,832 INFO L225 Difference]: With dead ends: 32402 [2019-12-26 22:02:26,832 INFO L226 Difference]: Without dead ends: 28216 [2019-12-26 22:02:26,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:02:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28216 states. [2019-12-26 22:02:27,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28216 to 22635. [2019-12-26 22:02:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22635 states. [2019-12-26 22:02:27,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22635 states to 22635 states and 69421 transitions. [2019-12-26 22:02:27,206 INFO L78 Accepts]: Start accepts. Automaton has 22635 states and 69421 transitions. Word has length 65 [2019-12-26 22:02:27,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:27,206 INFO L462 AbstractCegarLoop]: Abstraction has 22635 states and 69421 transitions. [2019-12-26 22:02:27,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:02:27,206 INFO L276 IsEmpty]: Start isEmpty. Operand 22635 states and 69421 transitions. [2019-12-26 22:02:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:27,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:27,230 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:27,230 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:27,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1050757295, now seen corresponding path program 5 times [2019-12-26 22:02:27,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:27,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720042063] [2019-12-26 22:02:27,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:27,410 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-26 22:02:27,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720042063] [2019-12-26 22:02:27,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:27,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:02:27,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850946602] [2019-12-26 22:02:27,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:02:27,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:02:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:02:27,412 INFO L87 Difference]: Start difference. First operand 22635 states and 69421 transitions. Second operand 11 states. [2019-12-26 22:02:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:28,592 INFO L93 Difference]: Finished difference Result 46765 states and 143624 transitions. [2019-12-26 22:02:28,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-26 22:02:28,592 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:02:28,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:28,658 INFO L225 Difference]: With dead ends: 46765 [2019-12-26 22:02:28,658 INFO L226 Difference]: Without dead ends: 44313 [2019-12-26 22:02:28,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-26 22:02:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44313 states. [2019-12-26 22:02:29,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44313 to 26449. [2019-12-26 22:02:29,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26449 states. [2019-12-26 22:02:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26449 states to 26449 states and 80853 transitions. [2019-12-26 22:02:29,494 INFO L78 Accepts]: Start accepts. Automaton has 26449 states and 80853 transitions. Word has length 65 [2019-12-26 22:02:29,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:29,494 INFO L462 AbstractCegarLoop]: Abstraction has 26449 states and 80853 transitions. [2019-12-26 22:02:29,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:02:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 26449 states and 80853 transitions. [2019-12-26 22:02:29,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:29,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:29,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:29,526 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash -330874671, now seen corresponding path program 6 times [2019-12-26 22:02:29,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:29,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169207732] [2019-12-26 22:02:29,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:29,692 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-26 22:02:29,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169207732] [2019-12-26 22:02:29,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:29,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:02:29,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366764820] [2019-12-26 22:02:29,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:02:29,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:29,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:02:29,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:02:29,694 INFO L87 Difference]: Start difference. First operand 26449 states and 80853 transitions. Second operand 11 states. [2019-12-26 22:02:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:30,773 INFO L93 Difference]: Finished difference Result 45145 states and 137290 transitions. [2019-12-26 22:02:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:02:30,774 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:02:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:30,829 INFO L225 Difference]: With dead ends: 45145 [2019-12-26 22:02:30,829 INFO L226 Difference]: Without dead ends: 37440 [2019-12-26 22:02:30,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 22:02:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37440 states. [2019-12-26 22:02:31,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37440 to 21893. [2019-12-26 22:02:31,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21893 states. [2019-12-26 22:02:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21893 states to 21893 states and 66980 transitions. [2019-12-26 22:02:31,266 INFO L78 Accepts]: Start accepts. Automaton has 21893 states and 66980 transitions. Word has length 65 [2019-12-26 22:02:31,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:31,266 INFO L462 AbstractCegarLoop]: Abstraction has 21893 states and 66980 transitions. [2019-12-26 22:02:31,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:02:31,267 INFO L276 IsEmpty]: Start isEmpty. Operand 21893 states and 66980 transitions. [2019-12-26 22:02:31,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:31,290 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:31,290 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:31,290 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:31,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:31,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1664741459, now seen corresponding path program 7 times [2019-12-26 22:02:31,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:31,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507084735] [2019-12-26 22:02:31,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:31,460 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-26 22:02:31,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507084735] [2019-12-26 22:02:31,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:31,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 22:02:31,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937574502] [2019-12-26 22:02:31,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 22:02:31,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 22:02:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:02:31,462 INFO L87 Difference]: Start difference. First operand 21893 states and 66980 transitions. Second operand 11 states. [2019-12-26 22:02:32,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:32,521 INFO L93 Difference]: Finished difference Result 25609 states and 77739 transitions. [2019-12-26 22:02:32,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-26 22:02:32,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-26 22:02:32,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:32,555 INFO L225 Difference]: With dead ends: 25609 [2019-12-26 22:02:32,556 INFO L226 Difference]: Without dead ends: 24729 [2019-12-26 22:02:32,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-12-26 22:02:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24729 states. [2019-12-26 22:02:32,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24729 to 21493. [2019-12-26 22:02:32,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21493 states. [2019-12-26 22:02:32,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21493 states to 21493 states and 65829 transitions. [2019-12-26 22:02:32,876 INFO L78 Accepts]: Start accepts. Automaton has 21493 states and 65829 transitions. Word has length 65 [2019-12-26 22:02:32,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:32,877 INFO L462 AbstractCegarLoop]: Abstraction has 21493 states and 65829 transitions. [2019-12-26 22:02:32,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 22:02:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21493 states and 65829 transitions. [2019-12-26 22:02:32,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 22:02:32,897 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:32,898 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:32,898 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:32,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:32,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1019867375, now seen corresponding path program 8 times [2019-12-26 22:02:32,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:32,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904491974] [2019-12-26 22:02:32,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:32,971 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-26 22:02:32,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904491974] [2019-12-26 22:02:32,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:32,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:02:32,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025987487] [2019-12-26 22:02:32,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:02:32,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:32,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:02:32,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:32,973 INFO L87 Difference]: Start difference. First operand 21493 states and 65829 transitions. Second operand 4 states. [2019-12-26 22:02:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:33,115 INFO L93 Difference]: Finished difference Result 25517 states and 77874 transitions. [2019-12-26 22:02:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:02:33,116 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-26 22:02:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:33,161 INFO L225 Difference]: With dead ends: 25517 [2019-12-26 22:02:33,161 INFO L226 Difference]: Without dead ends: 25517 [2019-12-26 22:02:33,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:02:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25517 states. [2019-12-26 22:02:33,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25517 to 21527. [2019-12-26 22:02:33,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21527 states. [2019-12-26 22:02:33,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21527 states to 21527 states and 66112 transitions. [2019-12-26 22:02:33,828 INFO L78 Accepts]: Start accepts. Automaton has 21527 states and 66112 transitions. Word has length 65 [2019-12-26 22:02:33,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:33,829 INFO L462 AbstractCegarLoop]: Abstraction has 21527 states and 66112 transitions. [2019-12-26 22:02:33,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:02:33,829 INFO L276 IsEmpty]: Start isEmpty. Operand 21527 states and 66112 transitions. [2019-12-26 22:02:33,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:33,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:33,850 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:33,850 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:33,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:33,851 INFO L82 PathProgramCache]: Analyzing trace with hash -952881413, now seen corresponding path program 1 times [2019-12-26 22:02:33,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:33,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365092613] [2019-12-26 22:02:33,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:02:34,040 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-26 22:02:34,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365092613] [2019-12-26 22:02:34,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:02:34,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:02:34,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839502676] [2019-12-26 22:02:34,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:02:34,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:02:34,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:02:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:02:34,043 INFO L87 Difference]: Start difference. First operand 21527 states and 66112 transitions. Second operand 12 states. [2019-12-26 22:02:35,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:02:35,365 INFO L93 Difference]: Finished difference Result 37313 states and 114505 transitions. [2019-12-26 22:02:35,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 22:02:35,366 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 22:02:35,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:02:35,417 INFO L225 Difference]: With dead ends: 37313 [2019-12-26 22:02:35,417 INFO L226 Difference]: Without dead ends: 36838 [2019-12-26 22:02:35,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 22:02:35,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36838 states. [2019-12-26 22:02:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36838 to 21259. [2019-12-26 22:02:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21259 states. [2019-12-26 22:02:35,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21259 states to 21259 states and 65424 transitions. [2019-12-26 22:02:35,837 INFO L78 Accepts]: Start accepts. Automaton has 21259 states and 65424 transitions. Word has length 66 [2019-12-26 22:02:35,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:02:35,837 INFO L462 AbstractCegarLoop]: Abstraction has 21259 states and 65424 transitions. [2019-12-26 22:02:35,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:02:35,838 INFO L276 IsEmpty]: Start isEmpty. Operand 21259 states and 65424 transitions. [2019-12-26 22:02:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 22:02:35,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:02:35,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:02:35,858 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:02:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:02:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 2 times [2019-12-26 22:02:35,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:02:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568381657] [2019-12-26 22:02:35,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:02:35,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:02:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:02:36,003 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:02:36,003 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:02:36,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L825: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_749 0) (= v_~weak$$choice2~0_132 0) (= 0 v_~weak$$choice0~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t669~0.base_22| 4)) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff0_thd1~0_380 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22| 1) |v_#valid_69|) (= v_~z$r_buff0_thd2~0_184 0) (= v_~__unbuffered_cnt~0_128 0) (= v_~y~0_48 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= v_~z$r_buff1_thd0~0_296 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~__unbuffered_p2_EBX~0_50 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t669~0.base_22|)) (= v_~z$w_buff1_used~0_500 0) (= v_~z$r_buff0_thd0~0_197 0) (= 0 |v_#NULL.base_6|) (= 0 |v_ULTIMATE.start_main_~#t669~0.offset_16|) (= 0 v_~z$flush_delayed~0_43) (= 0 v_~__unbuffered_p0_EAX~0_233) (= v_~z$read_delayed~0_7 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t669~0.base_22|) |v_ULTIMATE.start_main_~#t669~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~z$r_buff1_thd3~0_396) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_37) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= 0 v_~z$r_buff0_thd3~0_379) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= 0 v_~x~0_133) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t669~0.base_22|) (= v_~z~0_182 0) (= v_~main$tmp_guard1~0_40 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_17|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_113|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_223|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_76|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_197, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_233, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_37, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_14|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_50, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_500, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_19|, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_267, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_379, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t669~0.base=|v_ULTIMATE.start_main_~#t669~0.base_22|, ~x~0=v_~x~0_133, ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_14|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_40, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_45|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_296, ~y~0=v_~y~0_48, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_184, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_749, ~z$w_buff0~0=v_~z$w_buff0~0_256, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_396, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t669~0.offset=|v_ULTIMATE.start_main_~#t669~0.offset_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_182, ~weak$$choice2~0=v_~weak$$choice2~0_132, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_380} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t670~0.offset, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t670~0.base, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t669~0.base, ~x~0, ULTIMATE.start_main_~#t671~0.offset, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t669~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:36,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_29 v_~z$r_buff1_thd1~0_17) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10 0)) (= v_~z$r_buff0_thd2~0_25 v_~z$r_buff1_thd2~0_17) (= v_~z$r_buff0_thd3~0_70 v_~z$r_buff1_thd3~0_54) (= v_~z$r_buff0_thd1~0_28 1) (= v_~z$r_buff0_thd0~0_26 v_~z$r_buff1_thd0~0_23) (= v_~x~0_9 v_~__unbuffered_p0_EAX~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_29, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_26, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_54, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_23, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_70, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_10, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_28, ~x~0=v_~x~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:36,010 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t670~0.base_11|) |v_ULTIMATE.start_main_~#t670~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t670~0.base_11| 4) |v_#length_15|) (not (= |v_ULTIMATE.start_main_~#t670~0.base_11| 0)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t670~0.base_11|) (= |v_ULTIMATE.start_main_~#t670~0.offset_10| 0) (= (store |v_#valid_32| |v_ULTIMATE.start_main_~#t670~0.base_11| 1) |v_#valid_31|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t670~0.base=|v_ULTIMATE.start_main_~#t670~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_~#t670~0.offset=|v_ULTIMATE.start_main_~#t670~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t670~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t670~0.offset] because there is no mapped edge [2019-12-26 22:02:36,015 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t671~0.base_12|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t671~0.base_12| 4)) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12|) 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t671~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t671~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t671~0.base_12|) |v_ULTIMATE.start_main_~#t671~0.offset_10| 2)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t671~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t671~0.offset=|v_ULTIMATE.start_main_~#t671~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t671~0.base=|v_ULTIMATE.start_main_~#t671~0.base_12|, #valid=|v_#valid_29|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t671~0.offset, ULTIMATE.start_main_~#t671~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-26 22:02:36,019 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1273766265 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In1273766265 256))) (.cse2 (= |P1Thread1of1ForFork2_#t~ite9_Out1273766265| |P1Thread1of1ForFork2_#t~ite10_Out1273766265|))) (or (and (= |P1Thread1of1ForFork2_#t~ite9_Out1273766265| ~z$w_buff1~0_In1273766265) (not .cse0) (not .cse1) .cse2) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1273766265| ~z~0_In1273766265) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1273766265, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273766265, ~z$w_buff1~0=~z$w_buff1~0_In1273766265, ~z~0=~z~0_In1273766265} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1273766265|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1273766265, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1273766265|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1273766265, ~z$w_buff1~0=~z$w_buff1~0_In1273766265, ~z~0=~z~0_In1273766265} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-26 22:02:36,022 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In529240614 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In529240614| |P2Thread1of1ForFork0_#t~ite23_Out529240614|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite24_Out529240614| ~z$w_buff1~0_In529240614)) (and .cse0 (= |P2Thread1of1ForFork0_#t~ite23_Out529240614| ~z$w_buff1~0_In529240614) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In529240614 256)))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In529240614 256))) (= 0 (mod ~z$w_buff0_used~0_In529240614 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In529240614 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite24_Out529240614| |P2Thread1of1ForFork0_#t~ite23_Out529240614|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In529240614, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In529240614, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In529240614|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In529240614, ~z$w_buff1~0=~z$w_buff1~0_In529240614, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In529240614, ~weak$$choice2~0=~weak$$choice2~0_In529240614} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In529240614, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out529240614|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In529240614, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out529240614|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In529240614, ~z$w_buff1~0=~z$w_buff1~0_In529240614, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In529240614, ~weak$$choice2~0=~weak$$choice2~0_In529240614} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-26 22:02:36,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse0 (= |P2Thread1of1ForFork0_#t~ite29_Out1902864210| |P2Thread1of1ForFork0_#t~ite30_Out1902864210|)) (.cse4 (= 0 (mod ~z$w_buff1_used~0_In1902864210 256))) (.cse6 (= (mod ~z$r_buff0_thd3~0_In1902864210 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In1902864210 256) 0)) (.cse5 (= (mod ~z$w_buff0_used~0_In1902864210 256) 0)) (.cse1 (= (mod ~weak$$choice2~0_In1902864210 256) 0))) (or (let ((.cse2 (not .cse6))) (and (= 0 |P2Thread1of1ForFork0_#t~ite28_Out1902864210|) .cse0 .cse1 (or .cse2 (not .cse3)) (or (not .cse4) .cse2) (not .cse5) (= |P2Thread1of1ForFork0_#t~ite29_Out1902864210| |P2Thread1of1ForFork0_#t~ite28_Out1902864210|))) (and (or (and .cse0 .cse1 (or (and .cse6 .cse4) (and .cse6 .cse3) .cse5) (= |P2Thread1of1ForFork0_#t~ite29_Out1902864210| ~z$w_buff1_used~0_In1902864210)) (and (not .cse1) (= ~z$w_buff1_used~0_In1902864210 |P2Thread1of1ForFork0_#t~ite30_Out1902864210|) (= |P2Thread1of1ForFork0_#t~ite29_Out1902864210| |P2Thread1of1ForFork0_#t~ite29_In1902864210|))) (= |P2Thread1of1ForFork0_#t~ite28_In1902864210| |P2Thread1of1ForFork0_#t~ite28_Out1902864210|)))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In1902864210|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1902864210, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1902864210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902864210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1902864210, ~weak$$choice2~0=~weak$$choice2~0_In1902864210, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In1902864210|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1902864210|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1902864210, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1902864210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1902864210, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1902864210, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out1902864210|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out1902864210|, ~weak$$choice2~0=~weak$$choice2~0_In1902864210} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:02:36,026 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0)) (= v_~z$r_buff0_thd3~0_373 v_~z$r_buff0_thd3~0_372)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_373, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_38|, ~weak$$choice2~0=v_~weak$$choice2~0_130} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_39|, P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_15|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_31|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_493, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_372, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_23|, P2Thread1of1ForFork0_#t~ite30=|v_P2Thread1of1ForFork0_#t~ite30_37|, ~weak$$choice2~0=v_~weak$$choice2~0_130, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_49|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$w_buff1_used~0, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 22:02:36,028 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L798-->L802: Formula: (and (not (= 0 (mod v_~z$flush_delayed~0_10 256))) (= 0 v_~z$flush_delayed~0_9) (= v_~z~0_46 v_~z$mem_tmp~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_10} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_7, ~z$flush_delayed~0=v_~z$flush_delayed~0_9, ~z~0=v_~z~0_46} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 22:02:36,029 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In1328363113 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out1328363113| |P2Thread1of1ForFork0_#t~ite39_Out1328363113|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1328363113 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1328363113| ~z~0_In1328363113) .cse0 (or .cse1 .cse2)) (and (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out1328363113| ~z$w_buff1~0_In1328363113) .cse0 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1328363113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328363113, ~z$w_buff1~0=~z$w_buff1~0_In1328363113, ~z~0=~z~0_In1328363113} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1328363113|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1328363113|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1328363113, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1328363113, ~z$w_buff1~0=~z$w_buff1~0_In1328363113, ~z~0=~z~0_In1328363113} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 22:02:36,030 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-654389328 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-654389328 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-654389328| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-654389328 |P2Thread1of1ForFork0_#t~ite40_Out-654389328|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-654389328, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-654389328} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-654389328, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-654389328|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-654389328} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 22:02:36,031 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In-1380827444 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1380827444 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1380827444 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1380827444 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out-1380827444| ~z$w_buff1_used~0_In-1380827444)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P2Thread1of1ForFork0_#t~ite41_Out-1380827444| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380827444, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1380827444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380827444, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1380827444} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1380827444, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1380827444, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1380827444, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1380827444, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-1380827444|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 22:02:36,033 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In443866949 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In443866949 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out443866949| ~z$r_buff0_thd3~0_In443866949)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out443866949| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In443866949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443866949} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In443866949, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In443866949, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out443866949|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 22:02:36,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-116150127 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-116150127 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-116150127 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-116150127 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite43_Out-116150127| 0)) (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-116150127 |P2Thread1of1ForFork0_#t~ite43_Out-116150127|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-116150127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-116150127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-116150127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-116150127} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-116150127|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-116150127, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-116150127, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-116150127, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-116150127} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 22:02:36,034 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L806-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_100 1) v_~__unbuffered_cnt~0_99) (= v_~z$r_buff1_thd3~0_306 |v_P2Thread1of1ForFork0_#t~ite43_56|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_55|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_306, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_99, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 22:02:36,035 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In348239015 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In348239015 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In348239015 |P0Thread1of1ForFork1_#t~ite5_Out348239015|)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out348239015| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In348239015, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348239015} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out348239015|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In348239015, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In348239015} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 22:02:36,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In-10990048 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-10990048 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd1~0_In-10990048 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-10990048 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-10990048|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-10990048 |P0Thread1of1ForFork1_#t~ite6_Out-10990048|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-10990048, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-10990048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-10990048, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-10990048} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-10990048, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-10990048|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-10990048, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-10990048, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-10990048} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 22:02:36,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1434687486 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1434687486 256)))) (or (and (= ~z$r_buff0_thd1~0_Out-1434687486 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd1~0_In-1434687486 ~z$r_buff0_thd1~0_Out-1434687486) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434687486, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1434687486} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1434687486, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-1434687486|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1434687486} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:02:36,036 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-382380242 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In-382380242 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-382380242 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd1~0_In-382380242 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-382380242| ~z$r_buff1_thd1~0_In-382380242) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-382380242| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-382380242, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-382380242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-382380242, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-382380242} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-382380242|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-382380242, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-382380242, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-382380242, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-382380242} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 22:02:36,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L750-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~z$r_buff1_thd1~0_83 |v_P0Thread1of1ForFork1_#t~ite8_40|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_39|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_83, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 22:02:36,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In851747003 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In851747003 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out851747003|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In851747003 |P1Thread1of1ForFork2_#t~ite11_Out851747003|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In851747003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In851747003} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In851747003, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out851747003|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In851747003} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 22:02:36,037 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In-451438267 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-451438267 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-451438267 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-451438267 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-451438267|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-451438267 |P1Thread1of1ForFork2_#t~ite12_Out-451438267|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-451438267, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-451438267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-451438267, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-451438267} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-451438267, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-451438267, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-451438267, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-451438267|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-451438267} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 22:02:36,038 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1345724147 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1345724147 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In-1345724147 |P1Thread1of1ForFork2_#t~ite13_Out-1345724147|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out-1345724147|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1345724147, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1345724147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1345724147, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-1345724147|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1345724147} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 22:02:36,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1375413774 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd2~0_In1375413774 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1375413774 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1375413774 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out1375413774| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1375413774| ~z$r_buff1_thd2~0_In1375413774) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1375413774, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1375413774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1375413774, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1375413774} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1375413774, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1375413774, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1375413774, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1375413774|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1375413774} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 22:02:36,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_94, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_186, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 22:02:36,040 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L829-1-->L835: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 22:02:36,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-1575953360 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1575953360 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1575953360| ~z~0_In-1575953360) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite47_Out-1575953360| ~z$w_buff1~0_In-1575953360) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1575953360, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575953360, ~z$w_buff1~0=~z$w_buff1~0_In-1575953360, ~z~0=~z~0_In-1575953360} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1575953360, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1575953360|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1575953360, ~z$w_buff1~0=~z$w_buff1~0_In-1575953360, ~z~0=~z~0_In-1575953360} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 22:02:36,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L835-4-->L836: Formula: (= v_~z~0_40 |v_ULTIMATE.start_main_#t~ite47_9|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_9|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_8|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_12|, ~z~0=v_~z~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48, ~z~0] because there is no mapped edge [2019-12-26 22:02:36,042 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2125427612 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-2125427612 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-2125427612|)) (and (= ~z$w_buff0_used~0_In-2125427612 |ULTIMATE.start_main_#t~ite49_Out-2125427612|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125427612, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125427612} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125427612, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125427612, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-2125427612|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 22:02:36,043 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-159295706 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-159295706 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-159295706 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-159295706 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite50_Out-159295706|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-159295706 |ULTIMATE.start_main_#t~ite50_Out-159295706|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-159295706, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-159295706, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-159295706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-159295706} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-159295706|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-159295706, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-159295706, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-159295706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-159295706} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 22:02:36,045 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-582581710 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-582581710 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-582581710| 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-582581710 |ULTIMATE.start_main_#t~ite51_Out-582581710|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582581710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-582581710} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-582581710, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-582581710|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-582581710} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 22:02:36,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1398088133 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1398088133 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1398088133 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1398088133 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1398088133| ~z$r_buff1_thd0~0_In-1398088133)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite52_Out-1398088133| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1398088133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398088133, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1398088133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1398088133} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1398088133|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1398088133, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1398088133, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1398088133, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1398088133} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 22:02:36,046 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_25 2) (= 2 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~z$r_buff1_thd0~0_219 |v_ULTIMATE.start_main_#t~ite52_38|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 0 v_~__unbuffered_p0_EAX~0_178)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_178, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_219, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~y~0=v_~y~0_25, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:02:36,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:02:36 BasicIcfg [2019-12-26 22:02:36,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:02:36,185 INFO L168 Benchmark]: Toolchain (without parser) took 107698.59 ms. Allocated memory was 138.9 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 101.0 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,185 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 718.44 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,187 INFO L168 Benchmark]: Boogie Preprocessor took 45.49 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,187 INFO L168 Benchmark]: RCFGBuilder took 833.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,188 INFO L168 Benchmark]: TraceAbstraction took 106032.21 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 22:02:36,190 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 718.44 ms. Allocated memory was 138.9 MB in the beginning and 203.4 MB in the end (delta: 64.5 MB). Free memory was 100.6 MB in the beginning and 156.7 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.81 ms. Allocated memory is still 203.4 MB. Free memory was 156.7 MB in the beginning and 154.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.49 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 833.09 ms. Allocated memory is still 203.4 MB. Free memory was 151.5 MB in the beginning and 101.5 MB in the end (delta: 50.0 MB). Peak memory consumption was 50.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 106032.21 ms. Allocated memory was 203.4 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 101.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7047 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 130103 CheckedPairsTotal, 120 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L825] FCALL, FORK 0 pthread_create(&t669, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] FCALL, FORK 0 pthread_create(&t670, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L829] FCALL, FORK 0 pthread_create(&t671, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 2 [L783] 3 __unbuffered_p2_EAX = y [L786] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L787] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L788] 3 z$flush_delayed = weak$$choice2 [L789] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L766] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L791] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L792] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L793] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L796] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L797] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L803] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L804] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L805] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L835] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=7, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L837] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L838] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 105.6s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 29.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7609 SDtfs, 8179 SDslu, 25743 SDs, 0 SdLazy, 12680 SolverSat, 251 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 57 SyntacticMatches, 17 SemanticMatches, 283 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156115occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 259453 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1414 NumberOfCodeBlocks, 1414 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1317 ConstructedInterpolants, 0 QuantifiedInterpolants, 242971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...