/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/mix019_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:41:19,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:41:19,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:41:19,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:41:19,137 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:41:19,139 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:41:19,140 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:41:19,142 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:41:19,143 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:41:19,144 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:41:19,145 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:41:19,146 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:41:19,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:41:19,148 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:41:19,149 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:41:19,154 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:41:19,155 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:41:19,156 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:41:19,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:41:19,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:41:19,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:41:19,167 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:41:19,168 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:41:19,169 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:41:19,174 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:41:19,174 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:41:19,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:41:19,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:41:19,177 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:41:19,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:41:19,179 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:41:19,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:41:19,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:41:19,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:41:19,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:41:19,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:41:19,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:41:19,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:41:19,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:41:19,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:41:19,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:41:19,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:41:19,215 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:41:19,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:41:19,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:41:19,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:41:19,217 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:41:19,217 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:41:19,217 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:41:19,218 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:41:19,218 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:41:19,218 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:41:19,219 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:41:19,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:41:19,219 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:41:19,220 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:41:19,220 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:41:19,220 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:41:19,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:41:19,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:41:19,221 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:41:19,221 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:41:19,221 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:41:19,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:41:19,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:41:19,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:41:19,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:41:19,222 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:41:19,223 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:41:19,223 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:41:19,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:41:19,223 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:41:19,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:41:19,565 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:41:19,570 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:41:19,571 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:41:19,572 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:41:19,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 12:41:19,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a732cdbcd/b75b970e4f044f0a86c6f8bab16037e0/FLAGf78b4d589 [2019-12-18 12:41:20,231 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:41:20,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix019_power.oepc.i [2019-12-18 12:41:20,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a732cdbcd/b75b970e4f044f0a86c6f8bab16037e0/FLAGf78b4d589 [2019-12-18 12:41:20,560 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a732cdbcd/b75b970e4f044f0a86c6f8bab16037e0 [2019-12-18 12:41:20,574 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:41:20,576 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:41:20,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:41:20,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:41:20,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:41:20,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:41:20" (1/1) ... [2019-12-18 12:41:20,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6d8139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:20, skipping insertion in model container [2019-12-18 12:41:20,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:41:20" (1/1) ... [2019-12-18 12:41:20,600 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:41:20,668 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:41:21,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:41:21,199 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:41:21,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:41:21,349 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:41:21,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21 WrapperNode [2019-12-18 12:41:21,350 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:41:21,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:41:21,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:41:21,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:41:21,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,390 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:41:21,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:41:21,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:41:21,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:41:21,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,437 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,437 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,448 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,456 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... [2019-12-18 12:41:21,462 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:41:21,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:41:21,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:41:21,463 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:41:21,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:41:21,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:41:21,523 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:41:21,523 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:41:21,524 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:41:21,524 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:41:21,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:41:21,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:41:21,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:41:21,527 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:41:22,289 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:41:22,289 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:41:22,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:41:22 BoogieIcfgContainer [2019-12-18 12:41:22,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:41:22,292 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:41:22,292 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:41:22,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:41:22,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:41:20" (1/3) ... [2019-12-18 12:41:22,297 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258dec55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:41:22, skipping insertion in model container [2019-12-18 12:41:22,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:41:21" (2/3) ... [2019-12-18 12:41:22,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@258dec55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:41:22, skipping insertion in model container [2019-12-18 12:41:22,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:41:22" (3/3) ... [2019-12-18 12:41:22,300 INFO L109 eAbstractionObserver]: Analyzing ICFG mix019_power.oepc.i [2019-12-18 12:41:22,311 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:41:22,312 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:41:22,322 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:41:22,323 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:41:22,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,388 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,388 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,389 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,389 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,390 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,390 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,391 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,392 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,393 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,394 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,395 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,396 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,397 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,398 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,403 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,408 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,409 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,410 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,411 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,412 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,412 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,412 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,413 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,414 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,415 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,416 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,417 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,418 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,419 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,423 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,441 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,442 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,443 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,444 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,445 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,446 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,447 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,448 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,449 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,450 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,451 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,452 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,453 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,454 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,458 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,459 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,460 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,461 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,462 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,463 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,464 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,467 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,468 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,469 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,469 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,475 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:41:22,500 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:41:22,521 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:41:22,522 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:41:22,522 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:41:22,522 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:41:22,522 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:41:22,522 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:41:22,522 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:41:22,523 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:41:22,541 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-18 12:41:22,543 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:41:22,652 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:41:22,652 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:41:22,679 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. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:41:22,707 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-18 12:41:22,774 INFO L126 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-18 12:41:22,775 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:41:22,787 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. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 12:41:22,805 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 12:41:22,806 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:41:27,598 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-12-18 12:41:28,241 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-18 12:41:28,379 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-18 12:41:28,644 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130103 [2019-12-18 12:41:28,644 INFO L214 etLargeBlockEncoding]: Total number of compositions: 120 [2019-12-18 12:41:28,648 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 105 transitions [2019-12-18 12:41:50,020 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 122102 states. [2019-12-18 12:41:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 122102 states. [2019-12-18 12:41:50,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 12:41:50,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:41:50,029 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 12:41:50,030 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-18 12:41:50,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:41:50,035 INFO L82 PathProgramCache]: Analyzing trace with hash 913940, now seen corresponding path program 1 times [2019-12-18 12:41:50,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:41:50,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227601208] [2019-12-18 12:41:50,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:41:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:41:50,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:41:50,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227601208] [2019-12-18 12:41:50,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:41:50,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:41:50,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650258936] [2019-12-18 12:41:50,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:41:50,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:41:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:41:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:41:50,332 INFO L87 Difference]: Start difference. First operand 122102 states. Second operand 3 states. [2019-12-18 12:41:53,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:41:53,762 INFO L93 Difference]: Finished difference Result 121140 states and 517588 transitions. [2019-12-18 12:41:53,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:41:53,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 12:41:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:41:54,475 INFO L225 Difference]: With dead ends: 121140 [2019-12-18 12:41:54,475 INFO L226 Difference]: Without dead ends: 107958 [2019-12-18 12:41:54,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:01,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107958 states. [2019-12-18 12:42:04,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107958 to 107958. [2019-12-18 12:42:04,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107958 states. [2019-12-18 12:42:04,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107958 states to 107958 states and 460128 transitions. [2019-12-18 12:42:04,589 INFO L78 Accepts]: Start accepts. Automaton has 107958 states and 460128 transitions. Word has length 3 [2019-12-18 12:42:04,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:04,589 INFO L462 AbstractCegarLoop]: Abstraction has 107958 states and 460128 transitions. [2019-12-18 12:42:04,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 107958 states and 460128 transitions. [2019-12-18 12:42:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 12:42:04,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:04,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:04,595 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-18 12:42:04,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:04,595 INFO L82 PathProgramCache]: Analyzing trace with hash 2082409598, now seen corresponding path program 1 times [2019-12-18 12:42:04,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:04,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774100483] [2019-12-18 12:42:04,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:04,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:04,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774100483] [2019-12-18 12:42:04,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:04,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:04,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079909581] [2019-12-18 12:42:04,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:04,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:04,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:04,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:04,694 INFO L87 Difference]: Start difference. First operand 107958 states and 460128 transitions. Second operand 4 states. [2019-12-18 12:42:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:09,284 INFO L93 Difference]: Finished difference Result 172022 states and 703369 transitions. [2019-12-18 12:42:09,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:42:09,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 12:42:09,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:09,938 INFO L225 Difference]: With dead ends: 172022 [2019-12-18 12:42:09,938 INFO L226 Difference]: Without dead ends: 171924 [2019-12-18 12:42:09,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:19,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171924 states. [2019-12-18 12:42:23,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171924 to 156115. [2019-12-18 12:42:23,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156115 states. [2019-12-18 12:42:24,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156115 states to 156115 states and 647087 transitions. [2019-12-18 12:42:24,562 INFO L78 Accepts]: Start accepts. Automaton has 156115 states and 647087 transitions. Word has length 11 [2019-12-18 12:42:24,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:24,562 INFO L462 AbstractCegarLoop]: Abstraction has 156115 states and 647087 transitions. [2019-12-18 12:42:24,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:24,562 INFO L276 IsEmpty]: Start isEmpty. Operand 156115 states and 647087 transitions. [2019-12-18 12:42:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:42:24,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:24,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:24,572 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-18 12:42:24,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash 594088235, now seen corresponding path program 1 times [2019-12-18 12:42:24,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:24,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254367356] [2019-12-18 12:42:24,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:24,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254367356] [2019-12-18 12:42:24,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:24,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:24,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185927933] [2019-12-18 12:42:24,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:24,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:24,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:24,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:24,647 INFO L87 Difference]: Start difference. First operand 156115 states and 647087 transitions. Second operand 3 states. [2019-12-18 12:42:24,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:24,788 INFO L93 Difference]: Finished difference Result 33388 states and 108650 transitions. [2019-12-18 12:42:24,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:24,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 12:42:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:24,854 INFO L225 Difference]: With dead ends: 33388 [2019-12-18 12:42:24,855 INFO L226 Difference]: Without dead ends: 33388 [2019-12-18 12:42:24,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:25,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33388 states. [2019-12-18 12:42:25,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33388 to 33388. [2019-12-18 12:42:25,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33388 states. [2019-12-18 12:42:25,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33388 states to 33388 states and 108650 transitions. [2019-12-18 12:42:25,567 INFO L78 Accepts]: Start accepts. Automaton has 33388 states and 108650 transitions. Word has length 13 [2019-12-18 12:42:25,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:25,567 INFO L462 AbstractCegarLoop]: Abstraction has 33388 states and 108650 transitions. [2019-12-18 12:42:25,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33388 states and 108650 transitions. [2019-12-18 12:42:25,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:42:25,570 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:25,571 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:25,571 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-18 12:42:25,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:25,571 INFO L82 PathProgramCache]: Analyzing trace with hash -805978823, now seen corresponding path program 1 times [2019-12-18 12:42:25,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:25,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383786225] [2019-12-18 12:42:25,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:25,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-18 12:42:25,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383786225] [2019-12-18 12:42:25,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:25,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:25,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880708205] [2019-12-18 12:42:25,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:25,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:25,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:25,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:25,681 INFO L87 Difference]: Start difference. First operand 33388 states and 108650 transitions. Second operand 3 states. [2019-12-18 12:42:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:25,906 INFO L93 Difference]: Finished difference Result 52822 states and 170897 transitions. [2019-12-18 12:42:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:25,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 12:42:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:26,003 INFO L225 Difference]: With dead ends: 52822 [2019-12-18 12:42:26,003 INFO L226 Difference]: Without dead ends: 52822 [2019-12-18 12:42:26,003 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-18 12:42:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52822 states. [2019-12-18 12:42:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52822 to 39094. [2019-12-18 12:42:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39094 states. [2019-12-18 12:42:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39094 states to 39094 states and 127496 transitions. [2019-12-18 12:42:29,513 INFO L78 Accepts]: Start accepts. Automaton has 39094 states and 127496 transitions. Word has length 16 [2019-12-18 12:42:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:29,514 INFO L462 AbstractCegarLoop]: Abstraction has 39094 states and 127496 transitions. [2019-12-18 12:42:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 39094 states and 127496 transitions. [2019-12-18 12:42:29,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:42:29,517 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:29,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:29,517 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-18 12:42:29,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:29,518 INFO L82 PathProgramCache]: Analyzing trace with hash -805853304, now seen corresponding path program 1 times [2019-12-18 12:42:29,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:29,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391677503] [2019-12-18 12:42:29,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:29,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:29,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391677503] [2019-12-18 12:42:29,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:29,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:29,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044143965] [2019-12-18 12:42:29,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:29,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:29,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:29,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:29,612 INFO L87 Difference]: Start difference. First operand 39094 states and 127496 transitions. Second operand 4 states. [2019-12-18 12:42:29,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:29,960 INFO L93 Difference]: Finished difference Result 46903 states and 150848 transitions. [2019-12-18 12:42:29,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:42:29,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:42:29,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:30,034 INFO L225 Difference]: With dead ends: 46903 [2019-12-18 12:42:30,034 INFO L226 Difference]: Without dead ends: 46903 [2019-12-18 12:42:30,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:30,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46903 states. [2019-12-18 12:42:30,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46903 to 42953. [2019-12-18 12:42:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-18 12:42:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 139113 transitions. [2019-12-18 12:42:30,775 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 139113 transitions. Word has length 16 [2019-12-18 12:42:30,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:30,775 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 139113 transitions. [2019-12-18 12:42:30,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:30,775 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 139113 transitions. [2019-12-18 12:42:30,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:42:30,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:30,779 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:30,779 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-18 12:42:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:30,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1222928522, now seen corresponding path program 1 times [2019-12-18 12:42:30,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:30,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748637772] [2019-12-18 12:42:30,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:30,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:30,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:30,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748637772] [2019-12-18 12:42:30,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:30,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:30,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192520309] [2019-12-18 12:42:30,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:30,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:30,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:30,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:30,840 INFO L87 Difference]: Start difference. First operand 42953 states and 139113 transitions. Second operand 4 states. [2019-12-18 12:42:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:31,648 INFO L93 Difference]: Finished difference Result 51478 states and 165621 transitions. [2019-12-18 12:42:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:42:31,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:42:31,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:31,735 INFO L225 Difference]: With dead ends: 51478 [2019-12-18 12:42:31,736 INFO L226 Difference]: Without dead ends: 51478 [2019-12-18 12:42:31,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51478 states. [2019-12-18 12:42:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51478 to 44383. [2019-12-18 12:42:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44383 states. [2019-12-18 12:42:32,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44383 states to 44383 states and 143934 transitions. [2019-12-18 12:42:32,530 INFO L78 Accepts]: Start accepts. Automaton has 44383 states and 143934 transitions. Word has length 16 [2019-12-18 12:42:32,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:32,531 INFO L462 AbstractCegarLoop]: Abstraction has 44383 states and 143934 transitions. [2019-12-18 12:42:32,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:32,531 INFO L276 IsEmpty]: Start isEmpty. Operand 44383 states and 143934 transitions. [2019-12-18 12:42:32,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:42:32,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:32,541 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-18 12:42:32,541 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-18 12:42:32,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash -655013944, now seen corresponding path program 1 times [2019-12-18 12:42:32,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:32,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388811376] [2019-12-18 12:42:32,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:32,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:32,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388811376] [2019-12-18 12:42:32,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:32,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:32,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930290564] [2019-12-18 12:42:32,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:32,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:32,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:32,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:32,617 INFO L87 Difference]: Start difference. First operand 44383 states and 143934 transitions. Second operand 5 states. [2019-12-18 12:42:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:33,250 INFO L93 Difference]: Finished difference Result 61264 states and 194140 transitions. [2019-12-18 12:42:33,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:42:33,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:42:33,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:33,353 INFO L225 Difference]: With dead ends: 61264 [2019-12-18 12:42:33,354 INFO L226 Difference]: Without dead ends: 61250 [2019-12-18 12:42:33,354 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-18 12:42:33,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61250 states. [2019-12-18 12:42:34,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61250 to 45686. [2019-12-18 12:42:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45686 states. [2019-12-18 12:42:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45686 states to 45686 states and 147920 transitions. [2019-12-18 12:42:34,675 INFO L78 Accepts]: Start accepts. Automaton has 45686 states and 147920 transitions. Word has length 22 [2019-12-18 12:42:34,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:34,676 INFO L462 AbstractCegarLoop]: Abstraction has 45686 states and 147920 transitions. [2019-12-18 12:42:34,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 45686 states and 147920 transitions. [2019-12-18 12:42:34,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:42:34,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:34,684 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-18 12:42:34,684 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-18 12:42:34,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:34,685 INFO L82 PathProgramCache]: Analyzing trace with hash -2032339914, now seen corresponding path program 1 times [2019-12-18 12:42:34,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:34,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828238708] [2019-12-18 12:42:34,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:34,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:34,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828238708] [2019-12-18 12:42:34,749 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:34,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:34,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435828179] [2019-12-18 12:42:34,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:34,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:34,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:34,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:34,750 INFO L87 Difference]: Start difference. First operand 45686 states and 147920 transitions. Second operand 5 states. [2019-12-18 12:42:35,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:35,417 INFO L93 Difference]: Finished difference Result 63752 states and 201665 transitions. [2019-12-18 12:42:35,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:42:35,417 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:42:35,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:35,526 INFO L225 Difference]: With dead ends: 63752 [2019-12-18 12:42:35,526 INFO L226 Difference]: Without dead ends: 63738 [2019-12-18 12:42:35,527 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-18 12:42:35,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63738 states. [2019-12-18 12:42:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63738 to 44032. [2019-12-18 12:42:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44032 states. [2019-12-18 12:42:36,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44032 states to 44032 states and 142639 transitions. [2019-12-18 12:42:36,432 INFO L78 Accepts]: Start accepts. Automaton has 44032 states and 142639 transitions. Word has length 22 [2019-12-18 12:42:36,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:36,432 INFO L462 AbstractCegarLoop]: Abstraction has 44032 states and 142639 transitions. [2019-12-18 12:42:36,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand 44032 states and 142639 transitions. [2019-12-18 12:42:36,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 12:42:36,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:36,445 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-18 12:42:36,445 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-18 12:42:36,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:36,445 INFO L82 PathProgramCache]: Analyzing trace with hash -701847110, now seen corresponding path program 1 times [2019-12-18 12:42:36,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:36,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793717690] [2019-12-18 12:42:36,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:36,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:36,509 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793717690] [2019-12-18 12:42:36,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:36,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:36,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088282026] [2019-12-18 12:42:36,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:42:36,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:36,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:42:36,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:36,511 INFO L87 Difference]: Start difference. First operand 44032 states and 142639 transitions. Second operand 4 states. [2019-12-18 12:42:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:36,780 INFO L93 Difference]: Finished difference Result 17193 states and 52641 transitions. [2019-12-18 12:42:36,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:42:36,780 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 12:42:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:36,812 INFO L225 Difference]: With dead ends: 17193 [2019-12-18 12:42:36,812 INFO L226 Difference]: Without dead ends: 17193 [2019-12-18 12:42:36,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:42:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17193 states. [2019-12-18 12:42:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17193 to 16865. [2019-12-18 12:42:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16865 states. [2019-12-18 12:42:37,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16865 states to 16865 states and 51705 transitions. [2019-12-18 12:42:37,066 INFO L78 Accepts]: Start accepts. Automaton has 16865 states and 51705 transitions. Word has length 25 [2019-12-18 12:42:37,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:37,066 INFO L462 AbstractCegarLoop]: Abstraction has 16865 states and 51705 transitions. [2019-12-18 12:42:37,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:42:37,067 INFO L276 IsEmpty]: Start isEmpty. Operand 16865 states and 51705 transitions. [2019-12-18 12:42:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 12:42:37,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:37,079 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:37,079 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-18 12:42:37,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1083173402, now seen corresponding path program 1 times [2019-12-18 12:42:37,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:37,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591496920] [2019-12-18 12:42:37,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:37,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:37,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:37,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591496920] [2019-12-18 12:42:37,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:37,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:37,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322553752] [2019-12-18 12:42:37,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:37,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:37,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:37,139 INFO L87 Difference]: Start difference. First operand 16865 states and 51705 transitions. Second operand 5 states. [2019-12-18 12:42:37,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:37,479 INFO L93 Difference]: Finished difference Result 21613 states and 65127 transitions. [2019-12-18 12:42:37,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:42:37,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 12:42:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:37,511 INFO L225 Difference]: With dead ends: 21613 [2019-12-18 12:42:37,512 INFO L226 Difference]: Without dead ends: 21613 [2019-12-18 12:42:37,512 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-18 12:42:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21613 states. [2019-12-18 12:42:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21613 to 20225. [2019-12-18 12:42:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20225 states. [2019-12-18 12:42:37,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20225 states to 20225 states and 61637 transitions. [2019-12-18 12:42:37,817 INFO L78 Accepts]: Start accepts. Automaton has 20225 states and 61637 transitions. Word has length 26 [2019-12-18 12:42:37,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:37,818 INFO L462 AbstractCegarLoop]: Abstraction has 20225 states and 61637 transitions. [2019-12-18 12:42:37,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 20225 states and 61637 transitions. [2019-12-18 12:42:37,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:42:37,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:37,832 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:42:37,833 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-18 12:42:37,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:37,833 INFO L82 PathProgramCache]: Analyzing trace with hash -799804073, now seen corresponding path program 1 times [2019-12-18 12:42:37,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:37,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335902957] [2019-12-18 12:42:37,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:37,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335902957] [2019-12-18 12:42:37,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:37,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:42:37,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629625878] [2019-12-18 12:42:37,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:37,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:37,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:37,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:37,907 INFO L87 Difference]: Start difference. First operand 20225 states and 61637 transitions. Second operand 5 states. [2019-12-18 12:42:38,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:38,300 INFO L93 Difference]: Finished difference Result 23624 states and 70894 transitions. [2019-12-18 12:42:38,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:42:38,300 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:42:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:38,348 INFO L225 Difference]: With dead ends: 23624 [2019-12-18 12:42:38,348 INFO L226 Difference]: Without dead ends: 23624 [2019-12-18 12:42:38,348 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-18 12:42:38,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23624 states. [2019-12-18 12:42:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23624 to 19452. [2019-12-18 12:42:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19452 states. [2019-12-18 12:42:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19452 states to 19452 states and 59284 transitions. [2019-12-18 12:42:38,679 INFO L78 Accepts]: Start accepts. Automaton has 19452 states and 59284 transitions. Word has length 28 [2019-12-18 12:42:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:38,679 INFO L462 AbstractCegarLoop]: Abstraction has 19452 states and 59284 transitions. [2019-12-18 12:42:38,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 19452 states and 59284 transitions. [2019-12-18 12:42:38,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:42:38,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:38,699 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-18 12:42:38,699 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-18 12:42:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash -145847770, now seen corresponding path program 1 times [2019-12-18 12:42:38,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:38,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689748611] [2019-12-18 12:42:38,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:38,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689748611] [2019-12-18 12:42:38,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:38,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:42:38,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540854827] [2019-12-18 12:42:38,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:42:38,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:38,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:42:38,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:42:38,779 INFO L87 Difference]: Start difference. First operand 19452 states and 59284 transitions. Second operand 6 states. [2019-12-18 12:42:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:39,441 INFO L93 Difference]: Finished difference Result 27031 states and 80502 transitions. [2019-12-18 12:42:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:42:39,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-18 12:42:39,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:39,493 INFO L225 Difference]: With dead ends: 27031 [2019-12-18 12:42:39,493 INFO L226 Difference]: Without dead ends: 27031 [2019-12-18 12:42:39,494 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-18 12:42:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27031 states. [2019-12-18 12:42:39,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27031 to 20764. [2019-12-18 12:42:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20764 states. [2019-12-18 12:42:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20764 states to 20764 states and 63071 transitions. [2019-12-18 12:42:39,982 INFO L78 Accepts]: Start accepts. Automaton has 20764 states and 63071 transitions. Word has length 32 [2019-12-18 12:42:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 20764 states and 63071 transitions. [2019-12-18 12:42:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:42:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 20764 states and 63071 transitions. [2019-12-18 12:42:40,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:42:40,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:40,006 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-18 12:42:40,006 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-18 12:42:40,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:40,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1380765993, now seen corresponding path program 1 times [2019-12-18 12:42:40,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:40,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674666051] [2019-12-18 12:42:40,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:40,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:40,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674666051] [2019-12-18 12:42:40,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:40,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:42:40,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269336659] [2019-12-18 12:42:40,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:42:40,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:40,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:42:40,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:42:40,100 INFO L87 Difference]: Start difference. First operand 20764 states and 63071 transitions. Second operand 6 states. [2019-12-18 12:42:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:40,801 INFO L93 Difference]: Finished difference Result 26334 states and 78684 transitions. [2019-12-18 12:42:40,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:42:40,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-12-18 12:42:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:40,838 INFO L225 Difference]: With dead ends: 26334 [2019-12-18 12:42:40,839 INFO L226 Difference]: Without dead ends: 26334 [2019-12-18 12:42:40,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:42:40,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26334 states. [2019-12-18 12:42:41,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26334 to 17642. [2019-12-18 12:42:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17642 states. [2019-12-18 12:42:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17642 states to 17642 states and 53957 transitions. [2019-12-18 12:42:41,137 INFO L78 Accepts]: Start accepts. Automaton has 17642 states and 53957 transitions. Word has length 34 [2019-12-18 12:42:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:41,137 INFO L462 AbstractCegarLoop]: Abstraction has 17642 states and 53957 transitions. [2019-12-18 12:42:41,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:42:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17642 states and 53957 transitions. [2019-12-18 12:42:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 12:42:41,154 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:41,154 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-18 12:42:41,154 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-18 12:42:41,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:41,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1372962452, now seen corresponding path program 1 times [2019-12-18 12:42:41,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:41,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798397054] [2019-12-18 12:42:41,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:41,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798397054] [2019-12-18 12:42:41,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:41,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:42:41,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199971202] [2019-12-18 12:42:41,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:41,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:41,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:41,216 INFO L87 Difference]: Start difference. First operand 17642 states and 53957 transitions. Second operand 3 states. [2019-12-18 12:42:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:41,297 INFO L93 Difference]: Finished difference Result 17641 states and 53955 transitions. [2019-12-18 12:42:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:41,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 12:42:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:41,340 INFO L225 Difference]: With dead ends: 17641 [2019-12-18 12:42:41,340 INFO L226 Difference]: Without dead ends: 17641 [2019-12-18 12:42:41,342 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17641 states. [2019-12-18 12:42:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17641 to 17641. [2019-12-18 12:42:41,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17641 states. [2019-12-18 12:42:41,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17641 states to 17641 states and 53955 transitions. [2019-12-18 12:42:41,624 INFO L78 Accepts]: Start accepts. Automaton has 17641 states and 53955 transitions. Word has length 39 [2019-12-18 12:42:41,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:41,624 INFO L462 AbstractCegarLoop]: Abstraction has 17641 states and 53955 transitions. [2019-12-18 12:42:41,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 17641 states and 53955 transitions. [2019-12-18 12:42:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:42:41,642 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:41,642 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-18 12:42:41,642 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-18 12:42:41,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash -2062304393, now seen corresponding path program 1 times [2019-12-18 12:42:41,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:41,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917988216] [2019-12-18 12:42:41,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:41,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917988216] [2019-12-18 12:42:41,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:41,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:42:41,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596310338] [2019-12-18 12:42:41,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:41,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:41,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:41,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:41,734 INFO L87 Difference]: Start difference. First operand 17641 states and 53955 transitions. Second operand 5 states. [2019-12-18 12:42:42,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:42,408 INFO L93 Difference]: Finished difference Result 25346 states and 76639 transitions. [2019-12-18 12:42:42,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:42:42,408 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:42:42,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:42,458 INFO L225 Difference]: With dead ends: 25346 [2019-12-18 12:42:42,459 INFO L226 Difference]: Without dead ends: 25346 [2019-12-18 12:42:42,461 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-18 12:42:42,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25346 states. [2019-12-18 12:42:42,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25346 to 23560. [2019-12-18 12:42:42,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23560 states. [2019-12-18 12:42:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23560 states to 23560 states and 71751 transitions. [2019-12-18 12:42:42,825 INFO L78 Accepts]: Start accepts. Automaton has 23560 states and 71751 transitions. Word has length 40 [2019-12-18 12:42:42,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:42,825 INFO L462 AbstractCegarLoop]: Abstraction has 23560 states and 71751 transitions. [2019-12-18 12:42:42,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:42,825 INFO L276 IsEmpty]: Start isEmpty. Operand 23560 states and 71751 transitions. [2019-12-18 12:42:42,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 12:42:42,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:42,853 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-18 12:42:42,853 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-18 12:42:42,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:42,853 INFO L82 PathProgramCache]: Analyzing trace with hash -950700709, now seen corresponding path program 2 times [2019-12-18 12:42:42,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:42,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541468126] [2019-12-18 12:42:42,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:42,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:42,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541468126] [2019-12-18 12:42:42,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:42,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:42:42,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684308136] [2019-12-18 12:42:42,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:42:42,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:42:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:42:42,931 INFO L87 Difference]: Start difference. First operand 23560 states and 71751 transitions. Second operand 5 states. [2019-12-18 12:42:43,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:43,035 INFO L93 Difference]: Finished difference Result 22175 states and 68518 transitions. [2019-12-18 12:42:43,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:42:43,035 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 12:42:43,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:43,065 INFO L225 Difference]: With dead ends: 22175 [2019-12-18 12:42:43,066 INFO L226 Difference]: Without dead ends: 22175 [2019-12-18 12:42:43,066 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-18 12:42:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22175 states. [2019-12-18 12:42:43,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22175 to 21251. [2019-12-18 12:42:43,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21251 states. [2019-12-18 12:42:43,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21251 states to 21251 states and 66025 transitions. [2019-12-18 12:42:43,511 INFO L78 Accepts]: Start accepts. Automaton has 21251 states and 66025 transitions. Word has length 40 [2019-12-18 12:42:43,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:43,511 INFO L462 AbstractCegarLoop]: Abstraction has 21251 states and 66025 transitions. [2019-12-18 12:42:43,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:42:43,512 INFO L276 IsEmpty]: Start isEmpty. Operand 21251 states and 66025 transitions. [2019-12-18 12:42:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:42:43,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:43,542 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-18 12:42:43,542 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-18 12:42:43,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:43,543 INFO L82 PathProgramCache]: Analyzing trace with hash 20161267, now seen corresponding path program 1 times [2019-12-18 12:42:43,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:43,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966606326] [2019-12-18 12:42:43,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:43,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:43,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966606326] [2019-12-18 12:42:43,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:43,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:42:43,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226989952] [2019-12-18 12:42:43,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:42:43,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:43,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:42:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:43,642 INFO L87 Difference]: Start difference. First operand 21251 states and 66025 transitions. Second operand 7 states. [2019-12-18 12:42:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:44,257 INFO L93 Difference]: Finished difference Result 62478 states and 192933 transitions. [2019-12-18 12:42:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 12:42:44,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:42:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:44,362 INFO L225 Difference]: With dead ends: 62478 [2019-12-18 12:42:44,362 INFO L226 Difference]: Without dead ends: 47634 [2019-12-18 12:42:44,363 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-18 12:42:44,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47634 states. [2019-12-18 12:42:44,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47634 to 25007. [2019-12-18 12:42:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25007 states. [2019-12-18 12:42:44,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25007 states to 25007 states and 78146 transitions. [2019-12-18 12:42:44,956 INFO L78 Accepts]: Start accepts. Automaton has 25007 states and 78146 transitions. Word has length 63 [2019-12-18 12:42:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:44,956 INFO L462 AbstractCegarLoop]: Abstraction has 25007 states and 78146 transitions. [2019-12-18 12:42:44,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:42:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 25007 states and 78146 transitions. [2019-12-18 12:42:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:42:44,985 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:44,985 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-18 12:42:44,985 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-18 12:42:44,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:44,986 INFO L82 PathProgramCache]: Analyzing trace with hash 618170621, now seen corresponding path program 2 times [2019-12-18 12:42:44,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:44,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558938003] [2019-12-18 12:42:44,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:45,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558938003] [2019-12-18 12:42:45,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:45,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:42:45,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102821875] [2019-12-18 12:42:45,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:42:45,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:45,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:42:45,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:45,075 INFO L87 Difference]: Start difference. First operand 25007 states and 78146 transitions. Second operand 7 states. [2019-12-18 12:42:45,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:45,619 INFO L93 Difference]: Finished difference Result 68433 states and 210070 transitions. [2019-12-18 12:42:45,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:42:45,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:42:45,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:45,689 INFO L225 Difference]: With dead ends: 68433 [2019-12-18 12:42:45,690 INFO L226 Difference]: Without dead ends: 48478 [2019-12-18 12:42:45,690 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-18 12:42:45,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48478 states. [2019-12-18 12:42:46,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48478 to 28798. [2019-12-18 12:42:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28798 states. [2019-12-18 12:42:46,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28798 states to 28798 states and 89643 transitions. [2019-12-18 12:42:46,588 INFO L78 Accepts]: Start accepts. Automaton has 28798 states and 89643 transitions. Word has length 63 [2019-12-18 12:42:46,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:46,588 INFO L462 AbstractCegarLoop]: Abstraction has 28798 states and 89643 transitions. [2019-12-18 12:42:46,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:42:46,589 INFO L276 IsEmpty]: Start isEmpty. Operand 28798 states and 89643 transitions. [2019-12-18 12:42:46,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:42:46,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:46,621 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-18 12:42:46,621 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-18 12:42:46,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:46,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1826673419, now seen corresponding path program 3 times [2019-12-18 12:42:46,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:46,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618600617] [2019-12-18 12:42:46,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:46,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618600617] [2019-12-18 12:42:46,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:46,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:42:46,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360191917] [2019-12-18 12:42:46,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:42:46,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:46,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:42:46,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:42:46,712 INFO L87 Difference]: Start difference. First operand 28798 states and 89643 transitions. Second operand 7 states. [2019-12-18 12:42:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:47,200 INFO L93 Difference]: Finished difference Result 59843 states and 183697 transitions. [2019-12-18 12:42:47,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:42:47,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-12-18 12:42:47,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:47,275 INFO L225 Difference]: With dead ends: 59843 [2019-12-18 12:42:47,275 INFO L226 Difference]: Without dead ends: 52762 [2019-12-18 12:42:47,275 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-18 12:42:47,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52762 states. [2019-12-18 12:42:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52762 to 29106. [2019-12-18 12:42:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29106 states. [2019-12-18 12:42:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29106 states to 29106 states and 90594 transitions. [2019-12-18 12:42:47,871 INFO L78 Accepts]: Start accepts. Automaton has 29106 states and 90594 transitions. Word has length 63 [2019-12-18 12:42:47,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:47,871 INFO L462 AbstractCegarLoop]: Abstraction has 29106 states and 90594 transitions. [2019-12-18 12:42:47,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:42:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 29106 states and 90594 transitions. [2019-12-18 12:42:47,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:42:47,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:47,901 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-18 12:42:47,901 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-18 12:42:47,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:47,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1896779851, now seen corresponding path program 4 times [2019-12-18 12:42:47,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:47,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915337847] [2019-12-18 12:42:47,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:47,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:47,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:47,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915337847] [2019-12-18 12:42:47,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:47,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:42:47,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538263605] [2019-12-18 12:42:47,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:42:47,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:47,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:42:47,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:47,954 INFO L87 Difference]: Start difference. First operand 29106 states and 90594 transitions. Second operand 3 states. [2019-12-18 12:42:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:48,175 INFO L93 Difference]: Finished difference Result 35624 states and 109784 transitions. [2019-12-18 12:42:48,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:42:48,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-18 12:42:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:48,242 INFO L225 Difference]: With dead ends: 35624 [2019-12-18 12:42:48,242 INFO L226 Difference]: Without dead ends: 35624 [2019-12-18 12:42:48,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:42:48,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35624 states. [2019-12-18 12:42:48,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35624 to 31022. [2019-12-18 12:42:48,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31022 states. [2019-12-18 12:42:49,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31022 states to 31022 states and 96384 transitions. [2019-12-18 12:42:49,037 INFO L78 Accepts]: Start accepts. Automaton has 31022 states and 96384 transitions. Word has length 63 [2019-12-18 12:42:49,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:49,038 INFO L462 AbstractCegarLoop]: Abstraction has 31022 states and 96384 transitions. [2019-12-18 12:42:49,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:42:49,038 INFO L276 IsEmpty]: Start isEmpty. Operand 31022 states and 96384 transitions. [2019-12-18 12:42:49,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:49,074 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:49,074 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-18 12:42:49,074 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-18 12:42:49,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1820548391, now seen corresponding path program 1 times [2019-12-18 12:42:49,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:49,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544143699] [2019-12-18 12:42:49,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:49,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:49,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544143699] [2019-12-18 12:42:49,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:49,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:42:49,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843918998] [2019-12-18 12:42:49,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:42:49,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:49,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:42:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:42:49,378 INFO L87 Difference]: Start difference. First operand 31022 states and 96384 transitions. Second operand 11 states. [2019-12-18 12:42:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:53,275 INFO L93 Difference]: Finished difference Result 61396 states and 184421 transitions. [2019-12-18 12:42:53,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-18 12:42:53,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:42:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:53,364 INFO L225 Difference]: With dead ends: 61396 [2019-12-18 12:42:53,364 INFO L226 Difference]: Without dead ends: 61016 [2019-12-18 12:42:53,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2019-12-18 12:42:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61016 states. [2019-12-18 12:42:54,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61016 to 35887. [2019-12-18 12:42:54,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35887 states. [2019-12-18 12:42:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35887 states to 35887 states and 110395 transitions. [2019-12-18 12:42:54,093 INFO L78 Accepts]: Start accepts. Automaton has 35887 states and 110395 transitions. Word has length 64 [2019-12-18 12:42:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:54,093 INFO L462 AbstractCegarLoop]: Abstraction has 35887 states and 110395 transitions. [2019-12-18 12:42:54,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:42:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 35887 states and 110395 transitions. [2019-12-18 12:42:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:54,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:54,134 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-18 12:42:54,134 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-18 12:42:54,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash -772692697, now seen corresponding path program 2 times [2019-12-18 12:42:54,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:54,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810882870] [2019-12-18 12:42:54,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:54,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:54,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810882870] [2019-12-18 12:42:54,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:54,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:42:54,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919114874] [2019-12-18 12:42:54,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 12:42:54,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:54,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 12:42:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 12:42:54,385 INFO L87 Difference]: Start difference. First operand 35887 states and 110395 transitions. Second operand 10 states. [2019-12-18 12:42:56,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:42:56,175 INFO L93 Difference]: Finished difference Result 56701 states and 172538 transitions. [2019-12-18 12:42:56,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:42:56,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 64 [2019-12-18 12:42:56,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:42:56,260 INFO L225 Difference]: With dead ends: 56701 [2019-12-18 12:42:56,260 INFO L226 Difference]: Without dead ends: 56481 [2019-12-18 12:42:56,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-12-18 12:42:56,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56481 states. [2019-12-18 12:42:57,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56481 to 42612. [2019-12-18 12:42:57,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42612 states. [2019-12-18 12:42:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42612 states to 42612 states and 131124 transitions. [2019-12-18 12:42:57,293 INFO L78 Accepts]: Start accepts. Automaton has 42612 states and 131124 transitions. Word has length 64 [2019-12-18 12:42:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:42:57,294 INFO L462 AbstractCegarLoop]: Abstraction has 42612 states and 131124 transitions. [2019-12-18 12:42:57,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 12:42:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 42612 states and 131124 transitions. [2019-12-18 12:42:57,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:42:57,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:42:57,344 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-18 12:42:57,344 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-18 12:42:57,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:42:57,344 INFO L82 PathProgramCache]: Analyzing trace with hash 98843029, now seen corresponding path program 3 times [2019-12-18 12:42:57,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:42:57,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728884438] [2019-12-18 12:42:57,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:42:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:42:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:42:57,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728884438] [2019-12-18 12:42:57,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:42:57,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 12:42:57,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821392956] [2019-12-18 12:42:57,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:42:57,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:42:57,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:42:57,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:42:57,566 INFO L87 Difference]: Start difference. First operand 42612 states and 131124 transitions. Second operand 11 states. [2019-12-18 12:43:00,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:00,297 INFO L93 Difference]: Finished difference Result 58003 states and 176439 transitions. [2019-12-18 12:43:00,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:43:00,298 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-18 12:43:00,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:00,386 INFO L225 Difference]: With dead ends: 58003 [2019-12-18 12:43:00,386 INFO L226 Difference]: Without dead ends: 57835 [2019-12-18 12:43:00,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:43:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57835 states. [2019-12-18 12:43:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57835 to 43639. [2019-12-18 12:43:01,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43639 states. [2019-12-18 12:43:01,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43639 states to 43639 states and 134160 transitions. [2019-12-18 12:43:01,170 INFO L78 Accepts]: Start accepts. Automaton has 43639 states and 134160 transitions. Word has length 64 [2019-12-18 12:43:01,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:01,171 INFO L462 AbstractCegarLoop]: Abstraction has 43639 states and 134160 transitions. [2019-12-18 12:43:01,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:43:01,171 INFO L276 IsEmpty]: Start isEmpty. Operand 43639 states and 134160 transitions. [2019-12-18 12:43:01,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:43:01,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:01,219 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-18 12:43:01,219 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-18 12:43:01,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:01,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1834617937, now seen corresponding path program 4 times [2019-12-18 12:43:01,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:01,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834533922] [2019-12-18 12:43:01,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:01,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834533922] [2019-12-18 12:43:01,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:01,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:43:01,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801476946] [2019-12-18 12:43:01,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-18 12:43:01,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:01,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-18 12:43:01,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:43:01,812 INFO L87 Difference]: Start difference. First operand 43639 states and 134160 transitions. Second operand 13 states. [2019-12-18 12:43:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:04,177 INFO L93 Difference]: Finished difference Result 59783 states and 181639 transitions. [2019-12-18 12:43:04,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:43:04,178 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-12-18 12:43:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:04,269 INFO L225 Difference]: With dead ends: 59783 [2019-12-18 12:43:04,270 INFO L226 Difference]: Without dead ends: 59627 [2019-12-18 12:43:04,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=878, Unknown=0, NotChecked=0, Total=1056 [2019-12-18 12:43:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59627 states. [2019-12-18 12:43:04,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59627 to 42280. [2019-12-18 12:43:04,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42280 states. [2019-12-18 12:43:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42280 states to 42280 states and 130131 transitions. [2019-12-18 12:43:05,069 INFO L78 Accepts]: Start accepts. Automaton has 42280 states and 130131 transitions. Word has length 64 [2019-12-18 12:43:05,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:05,070 INFO L462 AbstractCegarLoop]: Abstraction has 42280 states and 130131 transitions. [2019-12-18 12:43:05,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-18 12:43:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 42280 states and 130131 transitions. [2019-12-18 12:43:05,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 12:43:05,117 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:05,117 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-18 12:43:05,117 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-18 12:43:05,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:05,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1550075121, now seen corresponding path program 5 times [2019-12-18 12:43:05,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:05,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805774935] [2019-12-18 12:43:05,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:05,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805774935] [2019-12-18 12:43:05,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:05,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:05,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357112045] [2019-12-18 12:43:05,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:05,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:05,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:05,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:05,176 INFO L87 Difference]: Start difference. First operand 42280 states and 130131 transitions. Second operand 3 states. [2019-12-18 12:43:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:05,392 INFO L93 Difference]: Finished difference Result 42279 states and 130129 transitions. [2019-12-18 12:43:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:05,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 12:43:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:05,509 INFO L225 Difference]: With dead ends: 42279 [2019-12-18 12:43:05,509 INFO L226 Difference]: Without dead ends: 42279 [2019-12-18 12:43:05,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42279 states. [2019-12-18 12:43:06,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42279 to 32919. [2019-12-18 12:43:06,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32919 states. [2019-12-18 12:43:06,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32919 states to 32919 states and 103081 transitions. [2019-12-18 12:43:06,879 INFO L78 Accepts]: Start accepts. Automaton has 32919 states and 103081 transitions. Word has length 64 [2019-12-18 12:43:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:06,879 INFO L462 AbstractCegarLoop]: Abstraction has 32919 states and 103081 transitions. [2019-12-18 12:43:06,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 32919 states and 103081 transitions. [2019-12-18 12:43:06,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 12:43:06,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:06,918 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-18 12:43:06,918 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-18 12:43:06,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:06,918 INFO L82 PathProgramCache]: Analyzing trace with hash 78921339, now seen corresponding path program 1 times [2019-12-18 12:43:06,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:06,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593497414] [2019-12-18 12:43:06,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:06,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:06,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593497414] [2019-12-18 12:43:06,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:06,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:43:06,992 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042273403] [2019-12-18 12:43:06,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:43:06,992 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:06,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:43:06,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:06,993 INFO L87 Difference]: Start difference. First operand 32919 states and 103081 transitions. Second operand 3 states. [2019-12-18 12:43:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:07,107 INFO L93 Difference]: Finished difference Result 24985 states and 77272 transitions. [2019-12-18 12:43:07,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:43:07,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 12:43:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:07,146 INFO L225 Difference]: With dead ends: 24985 [2019-12-18 12:43:07,146 INFO L226 Difference]: Without dead ends: 24985 [2019-12-18 12:43:07,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:43:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24985 states. [2019-12-18 12:43:07,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24985 to 23025. [2019-12-18 12:43:07,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23025 states. [2019-12-18 12:43:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23025 states to 23025 states and 71140 transitions. [2019-12-18 12:43:07,485 INFO L78 Accepts]: Start accepts. Automaton has 23025 states and 71140 transitions. Word has length 65 [2019-12-18 12:43:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:07,485 INFO L462 AbstractCegarLoop]: Abstraction has 23025 states and 71140 transitions. [2019-12-18 12:43:07,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:43:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 23025 states and 71140 transitions. [2019-12-18 12:43:07,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:07,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:07,508 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-18 12:43:07,509 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-18 12:43:07,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:07,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1524862519, now seen corresponding path program 1 times [2019-12-18 12:43:07,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:07,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000065780] [2019-12-18 12:43:07,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:07,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:07,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000065780] [2019-12-18 12:43:07,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:07,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:43:07,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437660745] [2019-12-18 12:43:07,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:43:07,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:07,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:43:07,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:43:07,686 INFO L87 Difference]: Start difference. First operand 23025 states and 71140 transitions. Second operand 11 states. [2019-12-18 12:43:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:08,975 INFO L93 Difference]: Finished difference Result 49255 states and 152641 transitions. [2019-12-18 12:43:08,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-18 12:43:08,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:43:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:09,083 INFO L225 Difference]: With dead ends: 49255 [2019-12-18 12:43:09,083 INFO L226 Difference]: Without dead ends: 46671 [2019-12-18 12:43:09,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=802, Unknown=0, NotChecked=0, Total=992 [2019-12-18 12:43:09,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46671 states. [2019-12-18 12:43:09,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46671 to 27980. [2019-12-18 12:43:09,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27980 states. [2019-12-18 12:43:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27980 states to 27980 states and 86397 transitions. [2019-12-18 12:43:09,692 INFO L78 Accepts]: Start accepts. Automaton has 27980 states and 86397 transitions. Word has length 66 [2019-12-18 12:43:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:09,692 INFO L462 AbstractCegarLoop]: Abstraction has 27980 states and 86397 transitions. [2019-12-18 12:43:09,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:43:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27980 states and 86397 transitions. [2019-12-18 12:43:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:09,723 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:09,723 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-18 12:43:09,723 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-18 12:43:09,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:09,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1239159877, now seen corresponding path program 2 times [2019-12-18 12:43:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:09,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205136475] [2019-12-18 12:43:09,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:10,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:10,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205136475] [2019-12-18 12:43:10,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:10,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 12:43:10,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907536410] [2019-12-18 12:43:10,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 12:43:10,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:10,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 12:43:10,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 12:43:10,107 INFO L87 Difference]: Start difference. First operand 27980 states and 86397 transitions. Second operand 15 states. [2019-12-18 12:43:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:14,252 INFO L93 Difference]: Finished difference Result 59512 states and 180008 transitions. [2019-12-18 12:43:14,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-18 12:43:14,253 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 66 [2019-12-18 12:43:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:14,330 INFO L225 Difference]: With dead ends: 59512 [2019-12-18 12:43:14,331 INFO L226 Difference]: Without dead ends: 53726 [2019-12-18 12:43:14,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=393, Invalid=1769, Unknown=0, NotChecked=0, Total=2162 [2019-12-18 12:43:14,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53726 states. [2019-12-18 12:43:14,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53726 to 28586. [2019-12-18 12:43:14,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28586 states. [2019-12-18 12:43:14,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28586 states to 28586 states and 87944 transitions. [2019-12-18 12:43:14,937 INFO L78 Accepts]: Start accepts. Automaton has 28586 states and 87944 transitions. Word has length 66 [2019-12-18 12:43:14,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:14,938 INFO L462 AbstractCegarLoop]: Abstraction has 28586 states and 87944 transitions. [2019-12-18 12:43:14,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 12:43:14,938 INFO L276 IsEmpty]: Start isEmpty. Operand 28586 states and 87944 transitions. [2019-12-18 12:43:14,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:14,971 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:14,971 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-18 12:43:14,971 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-18 12:43:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1334990131, now seen corresponding path program 3 times [2019-12-18 12:43:14,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:14,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731323529] [2019-12-18 12:43:14,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:14,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:15,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731323529] [2019-12-18 12:43:15,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:15,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:43:15,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891795860] [2019-12-18 12:43:15,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:43:15,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:15,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:43:15,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:43:15,405 INFO L87 Difference]: Start difference. First operand 28586 states and 87944 transitions. Second operand 16 states. [2019-12-18 12:43:21,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:21,452 INFO L93 Difference]: Finished difference Result 61549 states and 186313 transitions. [2019-12-18 12:43:21,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 12:43:21,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-18 12:43:21,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:21,523 INFO L225 Difference]: With dead ends: 61549 [2019-12-18 12:43:21,524 INFO L226 Difference]: Without dead ends: 49201 [2019-12-18 12:43:21,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=607, Invalid=2933, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 12:43:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49201 states. [2019-12-18 12:43:22,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49201 to 27334. [2019-12-18 12:43:22,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27334 states. [2019-12-18 12:43:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27334 states to 27334 states and 83949 transitions. [2019-12-18 12:43:22,280 INFO L78 Accepts]: Start accepts. Automaton has 27334 states and 83949 transitions. Word has length 66 [2019-12-18 12:43:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:22,280 INFO L462 AbstractCegarLoop]: Abstraction has 27334 states and 83949 transitions. [2019-12-18 12:43:22,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:43:22,280 INFO L276 IsEmpty]: Start isEmpty. Operand 27334 states and 83949 transitions. [2019-12-18 12:43:22,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:22,311 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:22,311 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-18 12:43:22,311 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-18 12:43:22,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:22,312 INFO L82 PathProgramCache]: Analyzing trace with hash 38318619, now seen corresponding path program 4 times [2019-12-18 12:43:22,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:22,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554718662] [2019-12-18 12:43:22,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:22,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554718662] [2019-12-18 12:43:22,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:22,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 12:43:22,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647438814] [2019-12-18 12:43:22,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 12:43:22,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:22,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 12:43:22,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 12:43:22,949 INFO L87 Difference]: Start difference. First operand 27334 states and 83949 transitions. Second operand 17 states. [2019-12-18 12:43:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:27,608 INFO L93 Difference]: Finished difference Result 38294 states and 115259 transitions. [2019-12-18 12:43:27,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 12:43:27,608 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 66 [2019-12-18 12:43:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:27,655 INFO L225 Difference]: With dead ends: 38294 [2019-12-18 12:43:27,655 INFO L226 Difference]: Without dead ends: 31404 [2019-12-18 12:43:27,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 391 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=329, Invalid=1563, Unknown=0, NotChecked=0, Total=1892 [2019-12-18 12:43:27,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-18 12:43:28,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 26096. [2019-12-18 12:43:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26096 states. [2019-12-18 12:43:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26096 states to 26096 states and 79711 transitions. [2019-12-18 12:43:28,073 INFO L78 Accepts]: Start accepts. Automaton has 26096 states and 79711 transitions. Word has length 66 [2019-12-18 12:43:28,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:28,073 INFO L462 AbstractCegarLoop]: Abstraction has 26096 states and 79711 transitions. [2019-12-18 12:43:28,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 12:43:28,073 INFO L276 IsEmpty]: Start isEmpty. Operand 26096 states and 79711 transitions. [2019-12-18 12:43:28,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:28,103 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:28,104 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-18 12:43:28,104 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-18 12:43:28,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:28,104 INFO L82 PathProgramCache]: Analyzing trace with hash 162445107, now seen corresponding path program 5 times [2019-12-18 12:43:28,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:28,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507946019] [2019-12-18 12:43:28,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:28,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:43:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:43:28,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507946019] [2019-12-18 12:43:28,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:43:28,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:43:28,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218318164] [2019-12-18 12:43:28,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:43:28,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:43:28,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:43:28,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:43:28,261 INFO L87 Difference]: Start difference. First operand 26096 states and 79711 transitions. Second operand 11 states. [2019-12-18 12:43:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:43:29,210 INFO L93 Difference]: Finished difference Result 43391 states and 132338 transitions. [2019-12-18 12:43:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:43:29,216 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 12:43:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:43:29,267 INFO L225 Difference]: With dead ends: 43391 [2019-12-18 12:43:29,267 INFO L226 Difference]: Without dead ends: 37158 [2019-12-18 12:43:29,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:43:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37158 states. [2019-12-18 12:43:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37158 to 21932. [2019-12-18 12:43:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21932 states. [2019-12-18 12:43:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21932 states to 21932 states and 67409 transitions. [2019-12-18 12:43:29,848 INFO L78 Accepts]: Start accepts. Automaton has 21932 states and 67409 transitions. Word has length 66 [2019-12-18 12:43:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:43:29,848 INFO L462 AbstractCegarLoop]: Abstraction has 21932 states and 67409 transitions. [2019-12-18 12:43:29,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:43:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 21932 states and 67409 transitions. [2019-12-18 12:43:29,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 12:43:29,870 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:43:29,870 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-18 12:43:29,870 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-18 12:43:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:43:29,871 INFO L82 PathProgramCache]: Analyzing trace with hash 620198601, now seen corresponding path program 6 times [2019-12-18 12:43:29,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:43:29,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511992998] [2019-12-18 12:43:29,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:43:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:43:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:43:29,973 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:43:29,973 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:43:29,977 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_#NULL.offset_6| 0) (= 0 v_~z$r_buff0_thd3~0_377) (= v_~__unbuffered_cnt~0_128 0) (= v_~z$r_buff0_thd1~0_378 0) (= v_~z$mem_tmp~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22|)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff0_thd0~0_195 0) (= v_~y~0_28 0) (= v_~z$w_buff1_used~0_500 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t497~0.base_22| 1) |v_#valid_69|) (= 0 |v_#NULL.base_6|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd2~0_182 0) (= 0 v_~z$r_buff1_thd3~0_396) (= 0 v_~x~0_245) (= v_~z$r_buff1_thd1~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_35) (= v_~z$r_buff1_thd0~0_294 0) (= 0 |v_ULTIMATE.start_main_~#t497~0.offset_16|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t497~0.base_22|) (= v_~z$w_buff0~0_256 0) (= v_~main$tmp_guard0~0_22 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t497~0.base_22| 4)) (= v_~__unbuffered_p2_EBX~0_48 0) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t497~0.base_22|) |v_ULTIMATE.start_main_~#t497~0.offset_16| 0)) |v_#memory_int_19|) (= 0 v_~__unbuffered_p1_EAX~0_41) (= v_~z$r_buff1_thd2~0_280 0) (= v_~z$w_buff1~0_199 0) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_280, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_63|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_14|, #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_72|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_195, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~0.base_17|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_41, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_35, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_48, 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, ~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_377, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_128, ULTIMATE.start_main_~#t497~0.base=|v_ULTIMATE.start_main_~#t497~0.base_22|, ~x~0=v_~x~0_245, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_199, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, 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_294, ~y~0=v_~y~0_28, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_182, ULTIMATE.start_main_~#t497~0.offset=|v_ULTIMATE.start_main_~#t497~0.offset_16|, 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_#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_378, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_14|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t498~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t499~0.base, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~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_~#t497~0.base, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ULTIMATE.start_main_~#t498~0.base, ~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_~#t497~0.offset, 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_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 12:43:29,978 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_~x~0_11 1) (= 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)) 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, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} OutVars{~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_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_25} AuxVars[] AssignedVars[~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, ~x~0] because there is no mapped edge [2019-12-18 12:43:29,979 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L825-1-->L827: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t498~0.base_11|) |v_ULTIMATE.start_main_~#t498~0.offset_10| 1)) |v_#memory_int_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t498~0.base_11| 4) |v_#length_15|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t498~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t498~0.base_11|)) (= 0 |v_ULTIMATE.start_main_~#t498~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t498~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#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|, ULTIMATE.start_main_~#t498~0.offset=|v_ULTIMATE.start_main_~#t498~0.offset_10|, ULTIMATE.start_main_~#t498~0.base=|v_ULTIMATE.start_main_~#t498~0.base_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t498~0.offset, ULTIMATE.start_main_~#t498~0.base, #length] because there is no mapped edge [2019-12-18 12:43:29,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [856] [856] L827-1-->L829: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t499~0.base_12| 4)) (= (store |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12| 1) |v_#valid_29|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t499~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t499~0.offset_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t499~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t499~0.base_12|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t499~0.base_12|) |v_ULTIMATE.start_main_~#t499~0.offset_10| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t499~0.base=|v_ULTIMATE.start_main_~#t499~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|, ULTIMATE.start_main_~#t499~0.offset=|v_ULTIMATE.start_main_~#t499~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t499~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t499~0.offset] because there is no mapped edge [2019-12-18 12:43:29,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L766-2-->L766-5: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd2~0_In1475404102 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite9_Out1475404102| |P1Thread1of1ForFork2_#t~ite10_Out1475404102|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In1475404102 256)))) (or (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out1475404102| ~z~0_In1475404102)) (and (not .cse2) .cse0 (not .cse1) (= |P1Thread1of1ForFork2_#t~ite9_Out1475404102| ~z$w_buff1~0_In1475404102)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1475404102, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1475404102, ~z$w_buff1~0=~z$w_buff1~0_In1475404102, ~z~0=~z~0_In1475404102} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1475404102|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1475404102, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out1475404102|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1475404102, ~z$w_buff1~0=~z$w_buff1~0_In1475404102, ~z~0=~z~0_In1475404102} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-18 12:43:29,984 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L792-->L792-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In18973448 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite23_In18973448| |P2Thread1of1ForFork0_#t~ite23_Out18973448|) (= ~z$w_buff1~0_In18973448 |P2Thread1of1ForFork0_#t~ite24_Out18973448|)) (and (= |P2Thread1of1ForFork0_#t~ite24_Out18973448| |P2Thread1of1ForFork0_#t~ite23_Out18973448|) (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In18973448 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In18973448 256))) (= 0 (mod ~z$w_buff0_used~0_In18973448 256)) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In18973448 256) 0)))) .cse0 (= ~z$w_buff1~0_In18973448 |P2Thread1of1ForFork0_#t~ite23_Out18973448|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In18973448, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18973448, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In18973448|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18973448, ~z$w_buff1~0=~z$w_buff1~0_In18973448, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18973448, ~weak$$choice2~0=~weak$$choice2~0_In18973448} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In18973448, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out18973448|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In18973448, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out18973448|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In18973448, ~z$w_buff1~0=~z$w_buff1~0_In18973448, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In18973448, ~weak$$choice2~0=~weak$$choice2~0_In18973448} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-18 12:43:29,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L794-->L794-8: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In177118461 256))) (.cse0 (= 0 (mod ~weak$$choice2~0_In177118461 256))) (.cse5 (= 0 (mod ~z$r_buff1_thd3~0_In177118461 256))) (.cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out177118461| |P2Thread1of1ForFork0_#t~ite30_Out177118461|)) (.cse4 (= (mod ~z$w_buff0_used~0_In177118461 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In177118461 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_In177118461| |P2Thread1of1ForFork0_#t~ite28_Out177118461|) (or (and (= |P2Thread1of1ForFork0_#t~ite29_Out177118461| |P2Thread1of1ForFork0_#t~ite29_In177118461|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite30_Out177118461| ~z$w_buff1_used~0_In177118461)) (and .cse0 .cse1 (= |P2Thread1of1ForFork0_#t~ite29_Out177118461| ~z$w_buff1_used~0_In177118461) (or (and .cse2 .cse3) .cse4 (and .cse2 .cse5))))) (let ((.cse6 (not .cse2))) (and (or (not .cse3) .cse6) (= |P2Thread1of1ForFork0_#t~ite29_Out177118461| |P2Thread1of1ForFork0_#t~ite28_Out177118461|) (= |P2Thread1of1ForFork0_#t~ite28_Out177118461| 0) .cse0 (or (not .cse5) .cse6) .cse1 (not .cse4))))) InVars {P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_In177118461|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In177118461, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In177118461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In177118461, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In177118461, ~weak$$choice2~0=~weak$$choice2~0_In177118461, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_In177118461|} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out177118461|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In177118461, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In177118461, ~z$w_buff1_used~0=~z$w_buff1_used~0_In177118461, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In177118461, P2Thread1of1ForFork0_#t~ite30=|P2Thread1of1ForFork0_#t~ite30_Out177118461|, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out177118461|, ~weak$$choice2~0=~weak$$choice2~0_In177118461} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite30, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 12:43:29,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L794-8-->L796: Formula: (and (= v_~z$r_buff0_thd3~0_371 v_~z$r_buff0_thd3~0_370) (= v_~z$w_buff1_used~0_493 |v_P2Thread1of1ForFork0_#t~ite30_38|) (not (= (mod v_~weak$$choice2~0_130 256) 0))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_371, 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_370, 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-18 12:43:29,987 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-18 12:43:29,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L802-2-->L802-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1403748432 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-1403748432 256) 0)) (.cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-1403748432| |P2Thread1of1ForFork0_#t~ite39_Out-1403748432|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-1403748432| ~z$w_buff1~0_In-1403748432)) (and (or .cse2 .cse0) .cse1 (= |P2Thread1of1ForFork0_#t~ite38_Out-1403748432| ~z~0_In-1403748432)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1403748432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1403748432, ~z$w_buff1~0=~z$w_buff1~0_In-1403748432, ~z~0=~z~0_In-1403748432} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-1403748432|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1403748432|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1403748432, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1403748432, ~z$w_buff1~0=~z$w_buff1~0_In-1403748432, ~z~0=~z~0_In-1403748432} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-18 12:43:29,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L803-->L803-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In531927809 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In531927809 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out531927809| ~z$w_buff0_used~0_In531927809)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out531927809| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In531927809, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In531927809} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In531927809, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out531927809|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In531927809} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-18 12:43:29,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L804-->L804-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In224998684 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In224998684 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In224998684 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In224998684 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite41_Out224998684| ~z$w_buff1_used~0_In224998684)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out224998684|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In224998684, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In224998684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In224998684, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In224998684} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In224998684, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In224998684, ~z$w_buff1_used~0=~z$w_buff1_used~0_In224998684, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In224998684, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out224998684|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-18 12:43:29,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L805-->L805-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1339832217 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1339832217 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1339832217|)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1339832217 |P2Thread1of1ForFork0_#t~ite42_Out-1339832217|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1339832217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1339832217} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1339832217, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1339832217, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1339832217|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:43:29,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L806-->L806-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In1712067967 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In1712067967 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1712067967 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In1712067967 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out1712067967|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In1712067967 |P2Thread1of1ForFork0_#t~ite43_Out1712067967|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1712067967, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1712067967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1712067967, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1712067967} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out1712067967|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1712067967, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1712067967, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1712067967, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1712067967} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-18 12:43:29,991 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_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_308 |v_P2Thread1of1ForFork0_#t~ite43_56|)) 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_308, ~__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-18 12:43:29,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1360125857 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1360125857 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1360125857 |P0Thread1of1ForFork1_#t~ite5_Out-1360125857|)) (and (not .cse1) (= |P0Thread1of1ForFork1_#t~ite5_Out-1360125857| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1360125857, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1360125857} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1360125857|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1360125857, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1360125857} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-18 12:43:29,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In60324693 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In60324693 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In60324693 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In60324693 256) 0))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out60324693| ~z$w_buff1_used~0_In60324693) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite6_Out60324693| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In60324693, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In60324693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60324693, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In60324693} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In60324693, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out60324693|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In60324693, ~z$w_buff1_used~0=~z$w_buff1_used~0_In60324693, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In60324693} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-18 12:43:29,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L750: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1456694472 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd1~0_In1456694472 256) 0))) (or (and (= ~z$r_buff0_thd1~0_Out1456694472 ~z$r_buff0_thd1~0_In1456694472) (or .cse0 .cse1)) (and (= ~z$r_buff0_thd1~0_Out1456694472 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1456694472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1456694472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1456694472, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1456694472|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1456694472} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 12:43:29,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1905666558 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1905666558 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1905666558 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd1~0_In-1905666558 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out-1905666558| ~z$r_buff1_thd1~0_In-1905666558)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite8_Out-1905666558| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1905666558, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1905666558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1905666558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1905666558} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1905666558|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1905666558, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1905666558, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1905666558, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1905666558} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 12:43:29,993 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-18 12:43:29,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L767-->L767-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1889124472 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In1889124472 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out1889124472| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1889124472| ~z$w_buff0_used~0_In1889124472)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1889124472, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1889124472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1889124472, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1889124472|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1889124472} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-18 12:43:29,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L768-->L768-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-444352442 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-444352442 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-444352442 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-444352442 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-444352442 |P1Thread1of1ForFork2_#t~ite12_Out-444352442|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-444352442|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-444352442, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-444352442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-444352442, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-444352442} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-444352442, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-444352442, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-444352442, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-444352442|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-444352442} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-18 12:43:29,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1484590073 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1484590073 256) 0))) (or (and (= ~z$r_buff0_thd2~0_In1484590073 |P1Thread1of1ForFork2_#t~ite13_Out1484590073|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1484590073|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484590073, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484590073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484590073, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1484590073|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484590073} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-18 12:43:29,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-511456301 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In-511456301 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-511456301 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-511456301 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite14_Out-511456301| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite14_Out-511456301| ~z$r_buff1_thd2~0_In-511456301) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-511456301, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-511456301, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-511456301, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-511456301} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-511456301, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-511456301, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-511456301, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-511456301|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-511456301} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-18 12:43:29,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_94 1) v_~__unbuffered_cnt~0_93) (= v_~z$r_buff1_thd2~0_188 |v_P1Thread1of1ForFork2_#t~ite14_50|) (= 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_188, ~__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-18 12:43:29,996 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-18 12:43:29,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L835-2-->L835-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In223088996 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In223088996 256)))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out223088996| ~z~0_In223088996) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out223088996| ~z$w_buff1~0_In223088996)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In223088996, ~z$w_buff1_used~0=~z$w_buff1_used~0_In223088996, ~z$w_buff1~0=~z$w_buff1~0_In223088996, ~z~0=~z~0_In223088996} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In223088996, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out223088996|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In223088996, ~z$w_buff1~0=~z$w_buff1~0_In223088996, ~z~0=~z~0_In223088996} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:43:29,997 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-18 12:43:29,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L836-->L836-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-420728954 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-420728954 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-420728954 |ULTIMATE.start_main_#t~ite49_Out-420728954|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite49_Out-420728954|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-420728954, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-420728954} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-420728954, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-420728954, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-420728954|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 12:43:29,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1520690908 256))) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-1520690908 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1520690908 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1520690908 256) 0))) (or (and (= ~z$w_buff1_used~0_In-1520690908 |ULTIMATE.start_main_#t~ite50_Out-1520690908|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1520690908| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1520690908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520690908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1520690908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520690908} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1520690908|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1520690908, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1520690908, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1520690908, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1520690908} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 12:43:29,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L838-->L838-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-1770269176 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1770269176 256)))) (or (and (= |ULTIMATE.start_main_#t~ite51_Out-1770269176| 0) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In-1770269176 |ULTIMATE.start_main_#t~ite51_Out-1770269176|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1770269176, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770269176} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1770269176, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-1770269176|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1770269176} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 12:43:29,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L839-->L839-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-573688834 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-573688834 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-573688834 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-573688834 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite52_Out-573688834| ~z$r_buff1_thd0~0_In-573688834) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-573688834| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573688834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573688834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-573688834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-573688834} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-573688834|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-573688834, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-573688834, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-573688834, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-573688834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 12:43:29,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L839-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p1_EAX~0_22) (= 1 v_~__unbuffered_p2_EAX~0_21) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~main$tmp_guard1~0_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_12 0) (= v_~__unbuffered_p2_EBX~0_34 0) (= 2 v_~x~0_186)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186} OutVars{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, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_22, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_21, ~x~0=v_~x~0_186, 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-18 12:43:30,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:43:30 BasicIcfg [2019-12-18 12:43:30,094 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:43:30,096 INFO L168 Benchmark]: Toolchain (without parser) took 129520.93 ms. Allocated memory was 142.6 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 99.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,097 INFO L168 Benchmark]: CDTParser took 0.57 ms. Allocated memory is still 142.6 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 12:43:30,097 INFO L168 Benchmark]: CACSL2BoogieTranslator took 770.24 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.6 MB in the beginning and 151.8 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.81 ms. Allocated memory is still 199.2 MB. Free memory was 151.8 MB in the beginning and 148.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,098 INFO L168 Benchmark]: Boogie Preprocessor took 40.30 ms. Allocated memory is still 199.2 MB. Free memory was 148.8 MB in the beginning and 146.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,099 INFO L168 Benchmark]: RCFGBuilder took 828.63 ms. Allocated memory is still 199.2 MB. Free memory was 146.8 MB in the beginning and 97.0 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,099 INFO L168 Benchmark]: TraceAbstraction took 127802.24 ms. Allocated memory was 199.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 96.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 962.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:43:30,102 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.57 ms. Allocated memory is still 142.6 MB. Free memory is still 118.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 770.24 ms. Allocated memory was 142.6 MB in the beginning and 199.2 MB in the end (delta: 56.6 MB). Free memory was 98.6 MB in the beginning and 151.8 MB in the end (delta: -53.2 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.81 ms. Allocated memory is still 199.2 MB. Free memory was 151.8 MB in the beginning and 148.8 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.30 ms. Allocated memory is still 199.2 MB. Free memory was 148.8 MB in the beginning and 146.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 828.63 ms. Allocated memory is still 199.2 MB. Free memory was 146.8 MB in the beginning and 97.0 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 127802.24 ms. Allocated memory was 199.2 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 96.0 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 962.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 176 ProgramPointsBefore, 94 ProgramPointsAfterwards, 213 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 7044 VarBasedMoverChecksPositive, 336 VarBasedMoverChecksNegative, 168 SemBasedMoverChecksPositive, 252 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 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(&t497, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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_p1_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=1, 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(&t498, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=1, 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 = 2 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [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_p1_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=2, 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] [L829] FCALL, FORK 0 pthread_create(&t499, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_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=2, 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] [L780] 3 y = 1 [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, 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=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, 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=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, 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=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, 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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, x=2, 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] [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_p1_EAX=0, __unbuffered_p2_EAX=1, __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=7, weak$$choice2=1, x=2, y=1, 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: 127.4s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 47.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8343 SDtfs, 11342 SDslu, 32623 SDs, 0 SdLazy, 25630 SolverSat, 538 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 45 SyntacticMatches, 37 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3207 ImplicationChecksByTransitivity, 7.3s 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: 46.3s AutomataMinimizationTime, 31 MinimizatonAttempts, 338067 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 1416 NumberOfCodeBlocks, 1416 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1319 ConstructedInterpolants, 0 QuantifiedInterpolants, 371628 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...